-
1
-
A Cryptographically Sound Security Proof of the Needham-Schroeder-Lowe Public-Key Protocol
-
13
-
Constructions of Sparse Asymmetric Connectors
-
23
-
A Separation Logic for Resource Distribution
-
38
-
An Equational Theory for Transactions
-
50
-
Axioms for Regular Words
-
62
-
1-Bounded TWA Cannot Be Determinized
-
74
-
Reachability Analysis of Process Rewrite Systems
-
88
-
Pushdown Games with Unboundedness and Regular Conditions
-
100
-
Real-Time Model-Checking: Parameters Everywhere
-
112
-
The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata
-
124
-
Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents
-
136
-
Subtyping Constraints in Quasi-lattices
-
149
-
An Improved Approximation Scheme for Computing Arrow-Debreu Prices for the Linear Case
-
156
-
Word Equations over Graph Products
-
168
-
Analysis and Experimental Evaluation of a Simple Algorithm for Collaborative Filtering in Planted Partition Models
-
183
-
Comparing Sequences with Segment Rearrangements
-
195
-
On Logically Defined Recognizable Tree Languages
-
208
-
Randomized Time-Space Tradeoffs for Directed Graph Connectivity
-
217
-
Distance-Preserving Approximations of Polygonal Paths
-
229
-
Joint Separation of Geometric Clusters and the Extreme Irregularities of Regular Polyhedra
-
244
-
On the Covering Steiner Problem
-
252
-
Minimality Results for the Spatial Logics
-
265
-
Algorithms for Non-uniform Size Data Placement on Parallel Disks
-
277
-
Efficient Algorithms for Abelian Group Isomorphism and Related Problems
-
289
-
Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees
-
302
-
Model Checking and Satisfiability for Sabotage Modal Logic
-
314
-
Merging and Sorting By Strip Moves
-
326
-
The Macro Tree Transducer Hierarchy Collapses for Functions of Linear Size Increase
-
338
-
Distributed Games
-
352
-
Maintenance of Multidimensional Histograms
-
363
-
Tagging Makes Secrecy Decidable with Unbounded Nonces as Well
-
375
-
Quantum and Classical Complexity Classes: Separations, Collapses, and Closure Properties
-
387
-
On the Greedy Superstring Conjecture
-
399
-
Reasoning about Infinite State Systems Using Boolean Methods
-
408
-
Stringent Relativization
-
420
-
Component-Based Construction of Deadlock-Free Systems
-
434
-
Moderately Hard Functions: From Complexity to Spam Fighting
-
443
-
Zigzag Products, Expander Constructions, Connections, and Applications
