Conferences in DBLP
Michael Backes , Birgit Pfitzmann A Cryptographically Sound Security Proof of the Needham-Schroeder-Lowe Public-Key Protocol. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2003, pp:1-12 [Conf ] Andreas Baltz , Gerold Jäger , Anand Srivastav Constructions of Sparse Asymmetric Connectors: Extended Abstract. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2003, pp:13-22 [Conf ] Nicolas Biri , Didier Galmiche A Separation Logic for Resource Distribution: Extended Abstract. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2003, pp:23-37 [Conf ] Andrew P. Black , Vincent Cremet , Rachid Guerraoui , Martin Odersky An Equational Theory for Transactions. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2003, pp:38-49 [Conf ] Stephen L. Bloom , Zoltán Ésik Axioms for Regular Words: Extended Abstract. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2003, pp:50-61 [Conf ] Mikolaj Bojanczyk 1-Bounded TWA Cannot Be Determinized. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2003, pp:62-73 [Conf ] Ahmed Bouajjani , Tayssir Touili Reachability Analysis of Process Rewrite Systems. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2003, pp:74-87 [Conf ] Alexis-Julien Bouquet , Olivier Serre , Igor Walukiewicz Pushdown Games with Unboundedness and Regular Conditions. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2003, pp:88-99 [Conf ] Véronique Bruyère , Jean-François Raskin Real-Time Model-Checking: Parameters Everywhere. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2003, pp:100-111 [Conf ] Arnaud Carayol , Stefan Wöhrle The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2003, pp:112-123 [Conf ] Yannick Chevalier , Ralf Küsters , Michaël Rusinowitch , Mathieu Turuani Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2003, pp:124-135 [Conf ] Emmanuel Coquery , François Fages Subtyping Constraints in Quasi-lattices. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2003, pp:136-148 [Conf ] Nikhil R. Devanur , Vijay V. Vazirani An Improved Approximation Scheme for Computing Arrow-Debreu Prices for the Linear Case. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2003, pp:149-155 [Conf ] Volker Diekert , Markus Lohrey Word Equations over Graph Products. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2003, pp:156-167 [Conf ] Devdatt P. Dubhashi , Luigi Laura , Alessandro Panconesi Analysis and Experimental Evaluation of a Simple Algorithm for Collaborative Filtering in Planted Partition Models: Extended Abstract. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2003, pp:168-182 [Conf ] Funda Ergün , S. Muthukrishnan , Süleyman Cenk Sahinalp Comparing Sequences with Segment Rearrangements. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2003, pp:183-194 [Conf ] Zoltán Ésik , Pascal Weil On Logically Defined Recognizable Tree Languages. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2003, pp:195-207 [Conf ] Parikshit Gopalan , Richard J. Lipton , Aranyak Mehta Randomized Time-Space Tradeoffs for Directed Graph Connectivity. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2003, pp:208-216 [Conf ] Joachim Gudmundsson , Giri Narasimhan , Michiel H. M. Smid Distance-Preserving Approximations of Polygonal Paths. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2003, pp:217-228 [Conf ] Sumanta Guha Joint Separation of Geometric Clusters and the Extreme Irregularities of Regular Polyhedra. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2003, pp:229-243 [Conf ] Anupam Gupta , Aravind Srinivasan On the Covering Steiner Problem. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2003, pp:244-251 [Conf ] Daniel Hirschkoff , Étienne Lozes , Davide Sangiorgi Minimality Results for the Spatial Logics. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2003, pp:252-264 [Conf ] Srinivas R. Kashyap , Samir Khuller Algorithms for Non-uniform Size Data Placement on Parallel Disks. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2003, pp:265-276 [Conf ] Telikepalli Kavitha Efficient Algorithms for Abelian Group Isomorphism and Related Problems. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2003, pp:277-288 [Conf ] Jochen Könemann , R. Ravi Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2003, pp:289-301 [Conf ] Christof Löding , Philipp Rohde Model Checking and Satisfiability for Sabotage Modal Logic. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2003, pp:302-313 [Conf ] Meena Mahajan , Raghavan Rama , Venkatesh Raman , S. Vijayakumar Merging and Sorting By Strip Moves. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2003, pp:314-325 [Conf ] Sebastian Maneth The Macro Tree Transducer Hierarchy Collapses for Functions of Linear Size Increase. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2003, pp:326-337 [Conf ] Swarup Mohalik , Igor Walukiewicz Distributed Games. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2003, pp:338-351 [Conf ] S. Muthukrishnan , Martin Strauss Maintenance of Multidimensional Histograms. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2003, pp:352-362 [Conf ] Ramaswamy Ramanujam , S. P. Suresh Tagging Makes Secrecy Decidable with Unbounded Nonces as Well. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2003, pp:363-374 [Conf ] Holger Spakowski , Mayur Thakur , Rahul Tripathi Quantum and Classical Complexity Classes: Separations, Collapses, and Closure Properties. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2003, pp:375-386 [Conf ] Maik Weinard , Georg Schnitger On the Greedy Superstring Conjecture. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2003, pp:387-398 [Conf ] Randal E. Bryant Reasoning about Infinite State Systems Using Boolean Methods. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2003, pp:399-407 [Conf ] Jin-yi Cai , Osamu Watanabe Stringent Relativization. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2003, pp:408-419 [Conf ] Gregor Gößler , Joseph Sifakis Component-Based Construction of Deadlock-Free Systems: Extended Abstract. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2003, pp:420-433 [Conf ] Moni Naor Moderately Hard Functions: From Complexity to Spam Fighting. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2003, pp:434-442 [Conf ] Avi Wigderson Zigzag Products, Expander Constructions, Connections, and Applications. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2003, pp:443- [Conf ]