-
1
-
Region Analysis and a π-Calculus with Groups
-
21
-
Abstract Data Types in Computer Algebra
-
36
-
What Do We Learn from Experimental Algorithmics?
-
52
-
And/Or Hierarchies and Round Abstraction
-
64
-
Computational Politics: Electoral Systems
-
84
-
0–1 Laws for Fragments of Existential Second-Order Logic: A Survey
-
99
-
On Algorithms and Interaction
-
114
-
On the Use of Duality and Geometry in Layouts for ATM Networks
-
132
-
On the Lower Bounds for One-Way Quantum Automata
-
141
-
Axiomatizing Fully Complete Models for ML Polymorphic Types
-
152
-
Measure Theoretic Completeness Notions for the Exponential Time Classes
-
162
-
Edge-Bisection of Chordal Rings
-
172
-
Equation Satisfiability and Program Satisfiability for Finite Monoids
-
182
-
XML Grammars
-
192
-
Simplifying Flow Networks
-
202
-
Balanced <Emphasis Type="Italic">k</Emphasis>-Colorings
-
212
-
A Compositional Model for Confluent Dynamic Data-Flow Networks
-
222
-
Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication
-
232
-
Expressiveness of Updatable Timed Automata
-
243
-
Iterative Arrays with Small Time Bounds
-
253
-
Embedding Fibonacci Cubes into Hypercubes with Ω(2<Superscript>cn</Superscript>) Faulty Nodes
-
264
-
Periodic-Like Words
-
275
-
The Monadic Theory of Morphic Infinite Words and Generalizations
-
285
-
Optical Routing of Uniform Instances in Tori
-
295
-
Factorizing Codes and Schützenberger Conjectures
-
304
-
Compositional Characterizations of λ-Terms Using Intersection Types
-
314
-
Time and Message Optimal Leader Election in Asynchronous Oriented Complete Networks
-
323
-
Subtractive Reductions and Complete Problems for Counting Complexity Classes
-
333
-
On the Autoreducibility of Random Sequences
-
343
-
Iteration Theories of Boolean Functions
-
353
-
An Algorithm Constructing the Semilinear Post for 2-Dim Reset/Transfer VASS
-
363
-
NP-Completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs
-
373
-
Explicit Fusions
-
383
-
State Space Reduction Using Partial τ-Confluence
-
394
-
Reducing the Number of Solutions of NP Functions
-
405
-
Regular Collections of Message Sequence Charts
-
415
-
Alternating and Empty Alternating Auxiliary Stack Automata
-
426
-
Counter Machines: Decidable Properties and Applications to Verification Problems
-
436
-
A Family of NFA’s Which Need 2<Superscript>n</Superscript> — <Emphasis Type="Italic">α</Emphasis> Deterministic States
-
446
-
Preemptive Scheduling on Dedicated Processors: Applications of Fractional Graph Coloring
-
456
-
Matching Modulo Associativity and Idempotency Is NP—Complete
-
467
-
On NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems
-
477
-
Algebraic and Uniqueness Properties of Parity Ordered Binary Decision Diagrams and Their Generalization
-
488
-
Formal Series over Algebras
-
497
-
μ-Calculus Synthesis
-
508
-
The Infinite Versions of L<Emphasis Type="SmallCaps">og</Emphasis>S<Emphasis Type="SmallCaps">pace</Emphasis> ≠ P Are Consistent with the Axioms of Set Theory
-
518
-
Timed Automata with Monotonic Activities
-
528
-
On a Generalization of Bi-Complement Reducible Graphs
-
539
-
Automatic Graphs and Graph <Emphasis Type="Italic">D0L</Emphasis>-Systems
-
549
-
Bilinear Functions and Trees over the (max, +) Semiring
-
559
-
Derivability in Locally Quantified Modal Logics via Translation in Set Theory
-
569
-
π-Calculus, Structured Coalgebras, and Minimal HD-Automata
-
579
-
Informative Labeling Schemes for Graphs
-
589
-
Separation Results for Rebound Automata
-
599
-
Unary Pushdown Automata and Auxiliary Space Lower Bounds
-
609
-
Binary Decision Diagrams by Shared Rewriting
-
619
-
Verifying Single and Multi-mutator Garbage Collectors with Owicki-Gries in Isabelle/HOL
-
629
-
Why so Many Temporal Logics Climb up the Trees?
-
640
-
Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems
-
650
-
A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism
-
660
-
On Diving in Trees Thomas Schwentick
-
670
-
Abstract Syntax and Variable Binding for Linear Binders
-
680
-
Regularity of Congruential Graphs
-
690
-
Sublinear Ambiguity
-
699
-
An Automata-Based Recognition Algorithm for Semi-extended Regular Expressions
