Abstract is missing.
- Rewriting Systems with DataAhmed Bouajjani, Peter Habermehl, Yan Jurski, Mihaela Sighireanu. 1-22 [doi]
- Spiking Neural P Systems: Some CharacterizationsOscar H. Ibarra, Sara Woodworth. 23-37 [doi]
- Approximating Graphs by Graphs and Functions (Abstract)László Lovász. 38 [doi]
- Traces, Feedback, and the Geometry of Computation (Abstract)Philip J. Scott. 39 [doi]
- A Largest Common d-Dimensional Subsequence of Two d-Dimensional StringsAbdullah N. Arslan. 40-51 [doi]
- Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear ProgramsStavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis. 52-63 [doi]
- A Novel Information Transmission Problem and Its Optimal SolutionEric Bach, Jin-yi Cai. 64-75 [doi]
- Local Testing of Message Sequence Charts Is DifficultPuneet Bhateja, Paul Gastin, Madhavan Mukund, K. Narayan Kumar. 76-87 [doi]
- On Notions of Regularity for Data LanguagesHenrik Björklund, Thomas Schwentick. 88-99 [doi]
- FJMIP: A Calculus for a Modular Object InitializationViviana Bono, Jaroslaw D. M. Kusmierek. 100-112 [doi]
- Top-Down Deterministic Parsing of Languages Generated by CD Grammar SystemsHenning Bordihn, György Vaszil. 113-124 [doi]
- The Complexity of Membership Problems for Circuits over Sets of Positive NumbersHans-Georg Breunig. 125-136 [doi]
- Pattern Matching in Protein-Protein Interaction GraphsGaëlle Brevier, Romeo Rizzi, Stéphane Vialette. 137-148 [doi]
- From Micro to Macro: How the Overlap Graph Determines the Reduction Graph in CiliatesRobert Brijder, Hendrik Jan Hoogeboom, Grzegorz Rozenberg. 149-160 [doi]
- A String-Based Model for Simple Gene AssemblyRobert Brijder, Miika Langille, Ion Petre. 161-172 [doi]
- On the Computational Power of Genetic Gates with Interleaving Semantics: The Power of Inhibition and DegradationNadia Busi, Claudio Zandron. 173-186 [doi]
- On Block-Wise Symmetric Signatures for MatchgatesJin-yi Cai, Pinyan Lu. 187-198 [doi]
- Path Algorithms on Regular GraphsDidier Caucal, Dinh Trong Hieu. 199-212 [doi]
- Factorization of Fuzzy AutomataMiroslav Ciric, Aleksandar Stamenkovic, Jelena Ignjatovic, Tatjana Petkovic. 213-225 [doi]
- Factorisation Forests for Infinite WordsThomas Colcombet. 226-237 [doi]
- Marked Systems and Circular SplicingClelia de Felice, Gabriele Fici, Rosalba Zizza. 238-249 [doi]
- The Quantum Query Complexity of Algebraic PropertiesSebastian Dörn, Thomas Thierauf. 250-260 [doi]
- On the Topological Complexity of Weakly Recognizable Tree LanguagesJacques Duparc, Filip Murlak. 261-273 [doi]
- Productivity of Stream DefinitionsJörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Ariya Isihara, Jan Willem Klop. 274-287 [doi]
- Multi-dimensional Packing with ConflictsLeah Epstein, Asaf Levin, Rob van Stee. 288-299 [doi]
- On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial TimeGábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski. 300-311 [doi]
- Efficient Parameterized Preprocessing for Cluster EditingMichael R. Fellows, Michael A. Langston, Frances A. Rosamond, Peter Shaw. 312-321 [doi]
- Representing the Boolean OR Function by Quadratic Polynomials Modulo 6Gyula Györ. 322-327 [doi]
- On the Complexity of KingsEdith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe. 328-340 [doi]
- Notions of Hyperbolicity in MonoidsMichael Hoffmann 0002, Richard M. Thomas. 341-352 [doi]
- P Systems with Adjoining Controlled Communication RulesMihai Ionescu, Dragos Sburlan. 353-364 [doi]
- The Simplest Language Where Equivalence of Finite Substitutions Is UndecidableMichal Kunc. 365-375 [doi]
- Real-Time Reversible Iterative ArraysMartin Kutrib, Andreas Malcher. 376-387 [doi]
- The Computational Complexity of Monotonicity in Probabilistic NetworksJohan Kwisthout. 388-399 [doi]
- Impossibility Results on Weakly Black-Box Hardness AmplificationChi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu. 400-411 [doi]
- Maximal and Minimal Scattered Context RewritingAlexander Meduna, Jirí Techet. 412-423 [doi]
- Strictly Deterministic CD-Systems of Restarting AutomataHartmut Messerschmidt, Friedrich Otto. 424-434 [doi]
- Product Rules in Semidefinite ProgrammingRajat Mittal, Mario Szegedy. 435-445 [doi]
- Expressive Power of LL(k) Boolean GrammarsAlexander Okhotin. 446-457 [doi]
- Complexity of Pebble Tree-Walking AutomataMathias Samuelides, Luc Segoufin. 458-469 [doi]
- Some Complexity Results for Prefix Gröbner Bases in Free Monoid RingsAndrea Sattler-Klein. 470-481 [doi]
- Fast Asymptotic FPTAS for Packing Fragmentable Items with CostsHadas Shachnai, Omer Yehezkely. 482-493 [doi]
- An O(1.787:::n:::)-Time Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR NodesTakeyuki Tamura, Tatsuya Akutsu. 494-505 [doi]