Abstract is missing.
- Semiperfect-Information GamesKrishnendu Chatterjee, Thomas A. Henzinger. 1-18 [doi]
- Computational Complexity Since 1980Russell Impagliazzo. 19-47 [doi]
- Developments in Data Structure Research During the First 25 Years of FSTTCSRaimund Seidel. 48-59 [doi]
- Inference Systems for Logical AlgorithmsNatarajan Shankar. 60-78 [doi]
- From Logic to GamesIgor Walukiewicz. 79-91 [doi]
- Proving Lower Bounds Via Pseudo-random GeneratorsManindra Agrawal. 92-105 [doi]
- Erdös MagicJoel Spencer. 106 [doi]
- No Coreset, No Cry: IIMichael Edwards, Kasturi R. Varadarajan. 107-115 [doi]
- Improved Bounds on the Union Complexity of Fat ObjectsMark de Berg. 116-127 [doi]
- On the Bisimulation Congruence in ::::chi::::-CalculusTaolue Chen, Tingting Han, Jian Lu. 128-139 [doi]
- Extending Howe s Method to Early Bisimulations for Typed Mobile Embedded Resources with Local NamesJens Chr. Godskesen, Thomas T. Hildebrandt. 140-151 [doi]
- Approximation Algorithms for Wavelength AssignmentVijay Kumar, Atri Rudra. 152-163 [doi]
- The Set Cover with Pairs ProblemRefael Hassin, Danny Segev. 164-176 [doi]
- Non-disclosure for Distributed Mobile CodeAna Almeida Matos. 177-188 [doi]
- Quantitative Models and Implicit ComplexityUgo Dal Lago, Martin Hofmann. 189-200 [doi]
- The MSO Theory of Connectedly Communicating ProcessesP. Madhusudan, P. S. Thiagarajan, Shaofa Yang. 201-212 [doi]
- Reachability of Hennessy-Milner Properties for Weakly Extended PRSMojmír Kretínský, Vojtech Rehák, Jan Strejcek. 213-224 [doi]
- Decision Procedures for Queues with Integer ConstraintsTing Zhang, Henny B. Sipma, Zohar Manna. 225-237 [doi]
- The Directed Planar Reachability ProblemEric Allender, Samir Datta, Sambuddha Roy. 238-249 [doi]
- Dimensions of Copeland-Erdös SequencesXiaoyang Gu, Jack H. Lutz, Philippe Moser. 250-260 [doi]
- Refining the Undecidability Frontier of Hybrid AutomataVenkatesh Mysore, Amir Pnueli. 261-272 [doi]
- When Are Timed Automata Weakly Timed Bisimilar to Time Petri Nets?Béatrice Bérard, Franck Cassez, Serge Haddad, Didier Lime, Olivier H. Roux. 273-284 [doi]
- Subquadratic Algorithms for Workload-Aware Haar Wavelet SynopsesS. Muthukrishnan. 285-296 [doi]
- Practical Algorithms for Tracking Database Join SizesSumit Ganguly, Deepanjan Kesh, Chandan Saha. 297-309 [doi]
- On Sampled Semantics of Timed SystemsPavel Krcál, Radek Pelánek. 310-321 [doi]
- Eventual Timed AutomataDeepak D Souza, M. Raj Mohan. 322-334 [doi]
- Causal Closure for MSC LanguagesBharat Adsul, Madhavan Mukund, K. Narayan Kumar, Vasumathi Narayanan. 335-347 [doi]
- Reachability Analysis of Multithreaded Software with Asynchronous CommunicationAhmed Bouajjani, Javier Esparza, Stefan Schwoon, Jan Strejcek. 348-359 [doi]
- Probabilistic Analysis for a Multiple Depot Vehicle Routing ProblemAndreas Baltz, Devdatt P. Dubhashi, Libertad Tansini, Anand Srivastav, Sören Werth. 360-371 [doi]
- Computing the Expected Accumulated Reward and Gain for a Subclass of Infinite Markov ChainsTomás Brázdil, Antonín Kucera. 372-383 [doi]
- Towards a CTL* TableauMark Reynolds. 384-395 [doi]
- Bisimulation Quantified Logics: UndecidabilityTim French. 396-407 [doi]
- Logarithmic-Time Single Deleter, Multiple Inserter Wait-Free Queues and StacksPrasad Jayanti, Srdjan Petrovic. 408-419 [doi]
- Monitoring Stable Properties in Dynamic Peer-to-Peer Distributed SystemsSathya Peri, Neeraj Mittal. 420-431 [doi]
- On the Expressiveness of TPTL and MTLPatricia Bouyer, Fabrice Chevalier, Nicolas Markey. 432-443 [doi]
- Modal Strength Reduction in Quantified Discrete Duration CalculusShankara Narayanan Krishna, Paritosh K. Pandya. 444-456 [doi]
- Comparing Trees Via Crossing MinimizationHenning Fernau, Michael Kaufmann, Mathias Poths. 457-469 [doi]
- On Counting the Number of Consistent Genotype Assignments for PedigreesJirí Srba. 470-482 [doi]
- Fixpoint Logics on Hierarchical StructuresStefan Göller, Markus Lohrey. 483-494 [doi]
- The Equivalence Problem for Deterministic MSO Tree Transducers Is DecidableJoost Engelfriet, Sebastian Maneth. 495-504 [doi]
- Market Equilibrium for CES Exchange Economies: Existence, Multiplicity, and ComputationBruno Codenotti, Benton McCune, Sriram Penumatcha, Kasturi R. Varadarajan. 505-516 [doi]
- Testing Concurrent Systems: An Interpretation of Intuitionistic LogicRadha Jagadeesan, Gopalan Nadathur, Vijay A. Saraswat. 517-528 [doi]
- Proofs of Termination of Rewrite Systems for Polytime FunctionsToshiyasu Arai, Georg Moser. 529-540 [doi]
- On the Controller Synthesis for Finite-State Markov Decision ProcessesAntonín Kucera, Oldrich Strazovský. 541-552 [doi]
- Reasoning About Quantum KnowledgeEllie D Hondt, Prakash Panangaden. 553-564 [doi]