FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

Proving Lower Bounds Via Pseudo-random Generators

Pages 92-105

Agrawal, Manindra

Erdős Magic

Pages 106-106

Spencer, Joel

No Coreset, No Cry: II

Pages 107-115

Edwards, Michael (et al.)

Improved Bounds on the Union Complexity of Fat Objects

Pages 116-127

Berg, Mark

On the Bisimulation Congruence in χ-Calculus

Pages 128-139

Chen, Taolue (et al.)

Extending Howe’s Method to Early Bisimulations for Typed Mobile Embedded Resources with Local Names

Pages 140-151

Godskesen, Jens Chr. (et al.)

Approximation Algorithms for Wavelength Assignment

Pages 152-163

Kumar, Vijay (et al.)

The Set Cover with Pairs Problem

Pages 164-176

Hassin, Refael (et al.)

Non-disclosure for Distributed Mobile Code

Pages 177-188

Matos, Ana Almeida

Quantitative Models and Implicit Complexity

Pages 189-200

Lago, Ugo (et al.)

The MSO Theory of Connectedly Communicating Processes

Pages 201-212

Madhusudan, P. (et al.)

Reachability of Hennessy-Milner Properties for Weakly Extended PRS

Pages 213-224

Křetínský, Mojmír (et al.)

Decision Procedures for Queues with Integer Constraints

Pages 225-237

Zhang, Ting (et al.)

The Directed Planar Reachability Problem

Pages 238-249

Allender, Eric (et al.)

Dimensions of Copeland-Erdös Sequences

Pages 250-260

Gu, Xiaoyang (et al.)

Refining the Undecidability Frontier of Hybrid Automata

Pages 261-272

Mysore, Venkatesh (et al.)

When Are Timed Automata Weakly Timed Bisimilar to Time Petri Nets?

Pages 273-284

Bérard, Beatrice (et al.)

Subquadratic Algorithms for Workload-Aware Haar Wavelet Synopses

Pages 285-296

Muthukrishnan, S.

Practical Algorithms for Tracking Database Join Sizes

Pages 297-309

Ganguly, Sumit (et al.)

On Sampled Semantics of Timed Systems

Pages 310-321

Krčál, Pavel (et al.)

Eventual Timed Automata

Pages 322-334

D’Souza, Deepak (et al.)

Causal Closure for MSC Languages

Pages 335-347

Adsul, Bharat (et al.)

Reachability Analysis of Multithreaded Software with Asynchronous Communication

Pages 348-359

Bouajjani, Ahmed (et al.)

Probabilistic Analysis for a Multiple Depot Vehicle Routing Problem

Pages 360-371

Baltz, Andreas (et al.)

Computing the Expected Accumulated Reward and Gain for a Subclass of Infinite Markov Chains

Pages 372-383

Brázdil, Tomáš (et al.)

Towards a CTL* Tableau

Pages 384-395

Reynolds, Mark

Bisimulation Quantified Logics: Undecidability

Pages 396-407

French, Tim

Logarithmic-Time Single Deleter, Multiple Inserter Wait-Free Queues and Stacks

Pages 408-419

Jayanti, Prasad (et al.)

Monitoring Stable Properties in Dynamic Peer-to-Peer Distributed Systems

Pages 420-431

Peri, Sathya (et al.)

On the Expressiveness of TPTL and MTL

Pages 432-443

Bouyer, Patricia (et al.)

Modal Strength Reduction in Quantified Discrete Duration Calculus

Pages 444-456

Krishna, Shankara Narayanan (et al.)

Comparing Trees Via Crossing Minimization

Pages 457-469

Fernau, Henning (et al.)

On Counting the Number of Consistent Genotype Assignments for Pedigrees

Pages 470-482

Srba, Jiří

Fixpoint Logics on Hierarchical Structures

Pages 483-494

Göller, Stefan (et al.)

The Equivalence Problem for Deterministic MSO Tree Transducers Is Decidable

Pages 495-504

Engelfriet, Joost (et al.)

Market Equilibrium for CES Exchange Economies: Existence, Multiplicity, and Computation

Pages 505-516

Codenotti, Bruno (et al.)

Testing Concurrent Systems: An Interpretation of Intuitionistic Logic

Pages 517-528

Jagadeesan, Radha (et al.)

Proofs of Termination of Rewrite Systems for Polytime Functions

Pages 529-540

Arai, Toshiyasu (et al.)

On the Controller Synthesis for Finite-State Markov Decision Processes

Pages 541-552

Kučera, Antonín (et al.)

Reasoning About Quantum Knowledge

Pages 553-564

D’Hondt, Ellie (et al.)