default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInternational Journal of Foundations of Computer Science, Volume 22
Volume 22, Number 1, January 2011
- Rudolf Freund, Marian Gheorghe, Solomon Marcus, Victor Mitrana, Mario J. Pérez-Jiménez:
Preface. - Oscar H. Ibarra:
On Strong Reversibility in P Systems and Related Problems. 7-14 - Kamala Krithivasan, Venkata Padmavati Metta, Deepak Garg
:
On String Languages Generated by Spiking Neural P Systems with Anti-Spikes. 15-27 - Linqiang Pan, Daniel Díaz-Pernil, Mario J. Pérez-Jiménez:
Computation of Ramsey Numbers by P Systems with Active Membranes. 29-38 - Andrei Paun, Mihaela Paun, Alfonso Rodríguez-Patón, Manuela Sidoroff:
P Systems with proteins on Membranes: a Survey. 39-53 - Ignacio Pérez-Hurtado, Mario J. Pérez-Jiménez, Agustin Riscos-Núñez, Miguel Angel Gutiérrez-Naranjo, Miquel Rius-Font:
On a Partial Affirmative Answer for a Păun's Conjecture. 55-64 - Antonio E. Porreca, Alberto Leporati, Giancarlo Mauri, Claudio Zandron:
P Systems with Active Membranes Working in Polynomial Space. 65-73 - Petr Sosík, Alfonso Rodríguez-Patón, Ludek Cienciala:
On the Power of Families of Recognizer Spiking Neural P Systems. 75-88 - Daniela Besozzi, Paolo Cazzaniga, Stefania Cocolo, Giancarlo Mauri, Dario Pescini:
Modeling Diffusion in a Signal Transduction Pathway: the Use of Virtual Volumes in P Systems. 89-96 - Vincenzo Manca, Luca Marchetti:
Log-Gain stoichiometric Stepwise Regression for MP Systems. 97-106 - Miguel A. Martínez-del-Amor, Ignacio Pérez-Hurtado, Mario J. Pérez-Jiménez, Agustin Riscos-Núñez, Fernando Sancho-Caparrini:
A Simulation Algorithm for Multienvironment Probabilistic P Systems: a Formal Verification. 107-118 - Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo Milazzo, Simone Tini:
An Overview on Operational Semantics in Membrane Computing. 119-131 - Florentin Ipate, Raluca Lefticaru, Cristina Tudose:
Formal Verification of P Systems Using Spin. 133-142 - Artiom Alhazov, Marian Kogler, Maurice Margenstern, Yurii Rogozhin, Sergey Verlan:
Small Universal Tvdh and Test Tube Systems. 143-154 - Fernando Arroyo, Juan Castellanos, Victor Mitrana, Eugenio Santos, José M. Sempere:
Filter Position in Networks of Substitution Processors Does not Matter. 155-165 - Andrzej Ehrenfeucht, Michael G. Main, Grzegorz Rozenberg:
Functions Defined by Reaction Systems. 167-178 - Pierluigi Frisco, Hendrik Jan Hoogeboom:
P Systems and Topology: Some Suggestions for Research. 179-190 - Cristian S. Calude, Matteo Cavaliere, Radu Mardare:
An Observer-Based de-Quantisation of Deutsch's Algorithm. 191-201 - Erzsébet Csuhaj-Varjú, Marion Oswald, György Vaszil:
Pc Grammar Systems with Clusters of Components. 203-212 - Mark Daley, Lila Kari, Shinnosuke Seki, Petr Sosík:
Orthogonal Shuffle on Trajectories. 213-222 - Jürgen Dassow, György Vaszil:
On the Number of Active Symbols in Lindenmayer Systems. 223-235 - Miroslav Langer, Alica Kelemenová:
Positioned Agents in Eco-Grammar Systems. 237-246 - Fumiya Okubo, Takashi Yokomori:
Morphic Characterizations of Language Families in Terms of Insertion Systems and Star Languages. 247-260 - Arto Salomaa:
Power Sums Associated with Certain Recursive Procedures on Words. 261-272 - Radu-Florian Atanasiu:
Erratum: "Parikh Matrix Mapping and Languages". 273
Volume 22, Number 2, February 2011
- Volker Diekert, Dirk Nowotka:
Preface. 275-276 - Marie-Pierre Béal, Mikhail V. Berlinkov, Dominique Perrin:
A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata. 277-288 - Alberto Bertoni, Christian Choffrut, Roberto Radicioni:
The Inclusion Problem of Context-Free Languages: Some Tractable Cases. 289-299 - Janusz A. Brzozowski, Elyot Grant, Jeffrey O. Shallit:
Closures in Formal Languages and Kuratowski's Theorem. 301-321 - Szilárd Zsolt Fazekas:
Powers of Regular Languages. 323-330 - Galina Jirásková:
Magic Numbers and Ternary Alphabet. 331-344 - Markku Laine, Wojciech Plandowski:
Word Equations with One Unknown. 345-375 - Tommi Lehtinen, Alexander Okhotin:
On Equations over Sets of Numbers and their Limitations. 377-393 - Holger Petersen:
Simulations by Time-Bounded Counter Machines. 395-409 - Georg Zetzsche:
Toward Understanding the Generative Capacity of Erasing Rules in Matrix Grammars. 411-426 - Zsolt Gazdag, Zoltán L. Németh:
A Kleene Theorem for Bisemigroup and binoid Languages. 427-446 - Lila Kari, Benoît Masson, Shinnosuke Seki:
Properties of Pseudo-Primitive Words and their Applications. 447-471 - Vesa Halava, Stepan Holub:
Reduction Tree of the Binary Generalized Post Correspondence Problem. 473-490 - Stephen L. Bloom, Zoltán Ésik:
Algebraic Linear Orderings. 491-515
Volume 22, Number 3, April 2011
- Jacir Luiz Bordim, Koji Nakano, Akihiro Fujiwara:
Preface. - Javid Taheri, Albert Y. Zomaya:
On the Performance of Static and Dynamic Location Management Strategies in Mobile Computing. 519-546 - Akihiro Fujiwara, Takeshi Tateishi:
Logic and Arithmetic Operations with a Constant Number of Steps in Membrane Computing. 547-564 - Flávio Keidi Miyazawa, André Luís Vignatti:
Bounds on the Convergence Time of Distributed Selfish Bin Packing. 565-582 - Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Graph Orientation to Maximize the Minimum Weighted Outdegree. 583-601 - Wei Sun:
Population Size Modeling for GA in Time-Critical Task Scheduling. 603-620 - Anne Benoit, Veronika Rehn-Sonigo, Yves Robert, Henri Casanova:
Resource Allocation Strategies for Constructive in-Network Stream Processing. 621-638 - Marin Bougeret, Pierre-François Dutot, Alfredo Goldman, Yanik Ngoko, Denis Trystram:
Approximating the Discrete Resource Sharing Scheduling Problem. 639-656 - Ajoy Kumar Datta, Stéphane Devismes, Florian Horn, Lawrence L. Larmore:
Self-Stabilizing k-out-of-ℓ Exclusion in Tree Networks. 657-677 - Lali Barrière, Paola Flocchini, Eduardo Mesa Barrameda, Nicola Santoro:
Uniform Scattering of Autonomous Mobile Robots in a Grid. 679-697 - Stepan Holub:
Binary Morphisms with Stable Suffix Complexity. 699-712 - Sushanta Karmakar, Arobinda Gupta:
Adaptive Distributed Mutual Exclusion by Dynamic Topology Switching. 713-737 - Han-Yu Lin, Chien-Lung Hsu:
A Novel Identity-Based Key-Insulated Convertible Authenticated Encryption Scheme. 739-756
Volume 22, Number 4, June 2011
- Olivier Bournez, Igor Potapov:
Preface. - Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezine:
Automatic Verification of Directory-Based Consistency Protocols with Graph Constraints. 761-782 - Mohamed Faouzi Atig, Peter Habermehl:
On Yen's Path Logic for Petri Nets. 783-799 - Pieter Collins, Ivan S. Zapreev:
Computable Semantics for CTL* on Discrete-Time and Continuous-Space Dynamic Systems. 801-821 - Thomas A. Henzinger, Barbara Jobstmann, Verena Wolf:
Formalisms for Specifying Markovian Population Models. 823-841 - Denis Lugiez:
Forward Analysis of Dynamic Network of Pushdown Systems is Easier without Order. 843-862 - Amaldev Manuel, Ramaswamy Ramanujam:
Class Counting Automata on Datawords. 863-882 - Cyril Allauzen, Mehryar Mohri, Ashish Rastogi:
General Algorithms for Testing the Ambiguity of Finite Automata and the Double-Tape Ambiguity of Finite-State Transducers. 883-904 - Julien Cassaigne, Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni:
Avoiding Abelian Powers in Binary Words with Bounded Abelian Complexity. 905-920 - Meng Zhang, Liang Hu, Yi Zhang:
Weighted Automata for Full-Text Indexing. 921-943 - Gonzalo Navarro, Rodrigo Paredes, Patricio V. Poblete, Peter Sanders:
Stronger Quickheaps. 945-969 - Deshi Ye, Qinming He:
Worst-Case Performance Evaluation on Multiprocessor Task Scheduling with Resource Augmentation. 971-982 - Debashis Mondal, Abhay Kumar, Arijit Bishnu, Krishnendu Mukhopadhyaya, Subhas C. Nandy:
Measuring the Quality of Surveillance in a Wireless Sensor Network. 983-998
Volume 22, Number 5, August 2011
- Akihiro Fujiwara, Hirotsugu Kakugawa, Koji Nakano:
Preface. - Yamin Li, Shietung Peng, Wanming Chu:
Disjoint-Paths and Fault-Tolerant Routing on Recursive Dual-Net. 1001-1018 - Shihong Xu, Hong Shen:
A Distributed Approximation Algorithm for Fault-Tolerant Metric Facility Location. 1019-1034 - Marc Moreno Maza, Yuzhen Xie:
Balanced Dense Polynomial Multiplication on Multi-Cores. 1035-1055 - Duhu Man, Yasuaki Ito, Koji Nakano:
An Efficient Parallel Sorting Compatible with the Standard Qsort. 1057-1071 - Shlomi Dolev, Yuval Elovici, Alexander Kesselman, Polina Zilberman:
Trawling Traffic under Attack Overcoming DDoS Attacks by Target-Controlled Traffic Filtering. 1073-1098 - Yukiko Yamauchi, Doina Bein, Toshimitsu Masuzawa:
Reliable Communication on Emulated Channels Resilient to Transient Faults. 1099-1122 - Emmanuelle Anceaume, Francisco Vilar Brasileiro, Romaric Ludinard, Bruno Sericola, Frédéric Tronel:
Dependability Evaluation of Cluster-Based Distributed Systems. 1123-1142 - Fabienne Carrier, Stéphane Devismes, Franck Petit, Yvan Rivierre:
Asymptotically Optimal Deterministic Rendezvous. 1143-1159 - Abusayeed M. Saifullah, Yung H. Tsin:
Self-Stabilizing Computation of 3-Edge-Connected Components. 1161-1185 - Aysun Ozan Aytaç, Tufan Turaci:
Vertex Vulnerability Parameter of Gear Graphs. 1187-1195 - Yo-Sub Han, Kai Salomaa:
Overlap-Free Languages and solid Codes. 1197-1209 - Takaaki Mizuki, Satoru Nakayama, Hideaki Sone:
An Application of ST-Numbering to Secret Key Agreement. 1211-1227 - Aysun Ozan Aytaç, Zeynep Nihan Odabas:
Residual Closeness of wheels and Related Networks. 1229-1240
Volume 22, Number 6, September 2011
- Cunsheng Ding, Qi Wang:
Preface. - Lilya Budaghyan, Tor Helleseth:
On Isotopisms of Commutative presemifields and CCZ-Equivalence of Functions. 1243-1258 - Claude Carlet:
More Vectorial Boolean Functions with Unbounded nonlinearity Profile. 1259-1269 - Keqin Feng, Jing Yang:
Vectorial Boolean Functions with Good Cryptographic Properties. 1271-1282 - Xiutao Feng, Zhenqing Shi, Chuankun Wu, Dengguo Feng:
On Guess and Determine Analysis of Rabbit. 1283-1296 - Mark Goresky, Andrew Klapper:
Statistical Properties of the Arithmetic Correlation of Sequences. 1297-1315 - Honggang Hu, Guang Gong:
Periods on Two Kinds of nonlinear Feedback Shift Registers with Time Varying Feedback Functions. 1317-1329 - Xuelian Li, Yupu Hu, Juntao Gao:
Lower Bounds on the Second Order nonlinearity of Boolean Functions. 1331-1349 - Laurent Poinsot, Alexander Pott:
Non-Boolean Almost Perfect nonlinear Functions on Non-Abelian Groups. 1351-1367 - Reihaneh Safavi-Naini, Shaoquan Jiang:
Unconditionally Secure Conference Key Distribution: Security Notions, Bounds and Constructions. 1369-1393 - Christophe Tartary, Huaxiong Wang, Yun Zhang:
An Efficient and Information Theoretically Secure Rational Secret Sharing Scheme Based on Symmetric bivariate polynomials. 1395-1416 - Yang Yang, Xiaohu Tang, Udaya Parampalli:
Authentication Codes from difference Balanced Functions. 1417-1429 - Yin Zhang, Meicheng Liu, Dongdai Lin:
On the nonexistence of Bent Functions. 1431-1438 - Danny Z. Chen, Haitao Wang:
Processing an Offline Insertion-Query Sequence with Applications. 1439-1456 - Hamed M. K. Alazemi, Anton Cerný:
Counting subwords Using a Trie Automaton. 1457-1469 - Arnold L. Rosenberg, Ron Chi-Lung Chiang:
Heterogeneity in Computing: Insights from a Worksharing Scheduling Problem. 1471-1493
Volume 22, Number 7, November 2011
- Sheng Yu:
Preface. - Robert Brijder, Andrzej Ehrenfeucht, Michael G. Main, Grzegorz Rozenberg:
A Tour of reaction Systems. 1499-1517 - Dora Giammarresi:
Exploring inside Tiling Recognizable Picture Languages to Find Deterministic subclasses. 1519-1532 - Markus Holzer, Martin Kutrib:
The Complexity of Regular(-like) Expressions. 1533-1548 - Michel Rigo, Laurent Waxweiler:
Logical Characterization of Recognizable Sets of polynomials over a Finite Field. 1549-1563 - Mikhail V. Berlinkov:
On a Conjecture by carpi and d'alessandro. 1565-1576 - Henning Bordihn, Martin Kutrib, Andreas Malcher:
Undecidability and Hierarchy Results for Parallel Communicating Finite Automata. 1577-1592 - Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
On the Average State Complexity of Partial derivative Automata: an analytic Combinatorics Approach. 1593-1606 - Sylvia Friese, Helmut Seidl, Sebastian Maneth:
Earliest Normal Form and Minimization for Bottom-up Tree Transducers. 1607-1623 - Tom Head:
Computing with Light: toward Parallel Boolean Algebra. 1625-1637 - Galina Jirásková, Tomás Masopust:
Complexity in Union-Free Regular Languages. 1639-1653 - Lila Kari, Shinnosuke Seki:
Schema for Parallel Insertion and Deletion: Revisited. 1655-1668 - Elena V. Pribavkina, Emanuele Rodaro:
State Complexity of Code Operators. 1669-1681 - Arseny M. Shur:
On the existence of Minimal β-powers. 1683-1696 - Benjamin Steinberg:
The Averaging Trick and the černý Conjecture. 1697-1706 - Saladi Rahul, Prosenjit Gupta, Krishnan Sundara Rajan:
Data Structures for Range-Aggregation over Categories. 1707-1728 - Allen Yuan, Eddie Cheng, László Lipták:
Linearly Many Faults in (n, k)-Star Graphs. 1729-1745 - Lakshmanan Kuppusamy, Anand Mahendran, Kamala Krithivasan:
On the Ambiguity of Insertion Systems. 1747-1758
Volume 22, Number 8, December 2011
- Michael Domaratzki, Kai Salomaa:
Preface. - Cyril Allauzen, Corinna Cortes, Mehryar Mohri:
A Dual Coordinate Descent Algorithm for SVMs Combined with Rational Kernels. 1761-1779 - Cyril Allauzen, Michael Riley, Johan Schalkwyk:
A Filter-Based Algorithm for Efficient Composition of Finite-State Transducers. 1781-1795 - Bo Cui, Yuan Gao, Lila Kari, Sheng Yu:
State Complexity of Two Combined Operations: Catenation-Union and Catenation-Intersection. 1797-1812 - Volker Diekert, Steffen Kopecki:
It is NL-Complete to Decide Whether a Hairpin Completion of Regular Languages is Regular. 1813-1828 - Manfred Droste, Ingmar Meinecke:
Weighted Automata and Regular Expressions over Valuation Monoids. 1829-1844 - Zoltán Ésik, Andreas Maletti:
The Category of Simulations for Weighted Tree Automata. 1845-1859 - Manfred Kufleitner, Alexander Lauser:
Partially Ordered Two-Way BüChi Automata. 1861-1876 - Andreas Maletti, Daniel Quernheim:
Optimal Hyper-Minimization. 1877-1891 - Jan Zdárek, Borivoj Melichar:
Tree-Based 2D Indexing. 1893-1907 - Fang Yu, Tevfik Bultan, Oscar H. Ibarra:
Relational String Verification Using Multi-Track Automata. 1909-1924 - Jean-Camille Birget:
On the Circuit-Size of inverses. 1925-1938 - Chavdar Dangalchev:
Residual Closeness and Generalized Closeness. 1939-1948 - Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Pawel Zylinski:
Approximation Algorithms for Buy-at-Bulk Geometric Network Design. 1949-1969 - Csilla Bujtás, György Dósa, Csanád Imreh, Judit Nagy-György, Zsolt Tuza:
The Graph-Bin Packing Problem. 1971-1993
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-21 20:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
