Conferences in DBLP
Krishnendu Chatterjee , Thomas A. Henzinger Semiperfect-Information Games. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:1-18 [Conf ] Russell Impagliazzo Computational Complexity Since 1980. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:19-47 [Conf ] Raimund Seidel Developments in Data Structure Research During the First 25 Years of FSTTCS. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:48-59 [Conf ] Natarajan Shankar Inference Systems for Logical Algorithms. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:60-78 [Conf ] Igor Walukiewicz From Logic to Games. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:79-91 [Conf ] Manindra Agrawal Proving Lower Bounds Via Pseudo-random Generators. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:92-105 [Conf ] Joel Spencer Erdös Magic. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:106- [Conf ] Michael Edwards , Kasturi R. Varadarajan No Coreset, No Cry: II. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:107-115 [Conf ] Mark de Berg Improved Bounds on the Union Complexity of Fat Objects. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:116-127 [Conf ] Taolue Chen , Tingting Han , Jian Lu On the Bisimulation Congruence in chi -Calculus. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:128-139 [Conf ] Jens Chr. Godskesen , Thomas T. Hildebrandt Extending Howe's Method to Early Bisimulations for Typed Mobile Embedded Resources with Local Names. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:140-151 [Conf ] Vijay Kumar , Atri Rudra Approximation Algorithms for Wavelength Assignment. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:152-163 [Conf ] Refael Hassin , Danny Segev The Set Cover with Pairs Problem. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:164-176 [Conf ] Ana Almeida Matos Non-disclosure for Distributed Mobile Code. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:177-188 [Conf ] Ugo Dal Lago , Martin Hofmann Quantitative Models and Implicit Complexity. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:189-200 [Conf ] P. Madhusudan , P. S. Thiagarajan , Shaofa Yang The MSO Theory of Connectedly Communicating Processes. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:201-212 [Conf ] Mojmír Kretínský , Vojtech Rehák , Jan Strejcek Reachability of Hennessy-Milner Properties for Weakly Extended PRS. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:213-224 [Conf ] Ting Zhang , Henny B. Sipma , Zohar Manna Decision Procedures for Queues with Integer Constraints. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:225-237 [Conf ] Eric Allender , Samir Datta , Sambuddha Roy The Directed Planar Reachability Problem. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:238-249 [Conf ] Xiaoyang Gu , Jack H. Lutz , Philippe Moser Dimensions of Copeland-Erdös Sequences. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:250-260 [Conf ] Venkatesh Mysore , Amir Pnueli Refining the Undecidability Frontier of Hybrid Automata. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:261-272 [Conf ] Béatrice Bérard , Franck Cassez , Serge Haddad , Didier Lime , Olivier H. Roux When Are Timed Automata Weakly Timed Bisimilar to Time Petri Nets? [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:273-284 [Conf ] S. Muthukrishnan Subquadratic Algorithms for Workload-Aware Haar Wavelet Synopses. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:285-296 [Conf ] Sumit Ganguly , Deepanjan Kesh , Chandan Saha Practical Algorithms for Tracking Database Join Sizes. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:297-309 [Conf ] Pavel Krcál , Radek Pelánek On Sampled Semantics of Timed Systems. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:310-321 [Conf ] Deepak D'Souza , M. Raj Mohan Eventual Timed Automata. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:322-334 [Conf ] Bharat Adsul , Madhavan Mukund , K. Narayan Kumar , Vasumathi Narayanan Causal Closure for MSC Languages. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:335-347 [Conf ] Ahmed Bouajjani , Javier Esparza , Stefan Schwoon , Jan Strejcek Reachability Analysis of Multithreaded Software with Asynchronous Communication. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:348-359 [Conf ] Andreas Baltz , Devdatt P. Dubhashi , Libertad Tansini , Anand Srivastav , Sören Werth Probabilistic Analysis for a Multiple Depot Vehicle Routing Problem. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:360-371 [Conf ] Tomás Brázdil , Antonín Kucera Computing the Expected Accumulated Reward and Gain for a Subclass of Infinite Markov Chains. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:372-383 [Conf ] Mark Reynolds Towards a CTL* Tableau. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:384-395 [Conf ] Tim French Bisimulation Quantified Logics: Undecidability. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:396-407 [Conf ] Prasad Jayanti , Srdjan Petrovic Logarithmic-Time Single Deleter, Multiple Inserter Wait-Free Queues and Stacks. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:408-419 [Conf ] Sathya Peri , Neeraj Mittal Monitoring Stable Properties in Dynamic Peer-to-Peer Distributed Systems. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:420-431 [Conf ] Patricia Bouyer , Fabrice Chevalier , Nicolas Markey On the Expressiveness of TPTL and MTL. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:432-443 [Conf ] Shankara Narayanan Krishna , Paritosh K. Pandya Modal Strength Reduction in Quantified Discrete Duration Calculus. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:444-456 [Conf ] Henning Fernau , Michael Kaufmann , Mathias Poths Comparing Trees Via Crossing Minimization. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:457-469 [Conf ] Jirí Srba On Counting the Number of Consistent Genotype Assignments for Pedigrees. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:470-482 [Conf ] Stefan Göller , Markus Lohrey Fixpoint Logics on Hierarchical Structures. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:483-494 [Conf ] Joost Engelfriet , Sebastian Maneth The Equivalence Problem for Deterministic MSO Tree Transducers Is Decidable. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:495-504 [Conf ] Bruno Codenotti , Benton McCune , Sriram Penumatcha , Kasturi R. Varadarajan Market Equilibrium for CES Exchange Economies: Existence, Multiplicity, and Computation. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:505-516 [Conf ] Radha Jagadeesan , Gopalan Nadathur , Vijay A. Saraswat Testing Concurrent Systems: An Interpretation of Intuitionistic Logic. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:517-528 [Conf ] Toshiyasu Arai , Georg Moser Proofs of Termination of Rewrite Systems for Polytime Functions. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:529-540 [Conf ] Antonín Kucera , Oldrich Strazovský On the Controller Synthesis for Finite-State Markov Decision Processes. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:541-552 [Conf ] Ellie D'Hondt , Prakash Panangaden Reasoning About Quantum Knowledge. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:553-564 [Conf ]