default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID23rd FSTTCS 2003: Mumbai, India
- Paritosh K. Pandya, Jaikumar Radhakrishnan:
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 23rd Conference, Mumbai, India, December 15-17, 2003, Proceedings. Lecture Notes in Computer Science 2914, Springer 2003, ISBN 3-540-20680-9
Contributed Papers
- Michael Backes, Birgit Pfitzmann:
A Cryptographically Sound Security Proof of the Needham-Schroeder-Lowe Public-Key Protocol. 1-12 - Andreas Baltz, Gerold Jäger, Anand Srivastav:
Constructions of Sparse Asymmetric Connectors: Extended Abstract. 13-22 - Nicolas Biri, Didier Galmiche:
A Separation Logic for Resource Distribution: Extended Abstract. 23-37 - Andrew P. Black, Vincent Cremet, Rachid Guerraoui, Martin Odersky:
An Equational Theory for Transactions. 38-49 - Stephen L. Bloom, Zoltán Ésik:
Axioms for Regular Words: Extended Abstract. 50-61 - Mikolaj Bojanczyk:
1-Bounded TWA Cannot Be Determinized. 62-73 - Ahmed Bouajjani, Tayssir Touili:
Reachability Analysis of Process Rewrite Systems. 74-87 - Alexis-Julien Bouquet, Olivier Serre, Igor Walukiewicz:
Pushdown Games with Unboundedness and Regular Conditions. 88-99 - Véronique Bruyère, Jean-François Raskin:
Real-Time Model-Checking: Parameters Everywhere. 100-111 - Arnaud Carayol, Stefan Wöhrle:
The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata. 112-123 - Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani:
Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents. 124-135 - Emmanuel Coquery, François Fages:
Subtyping Constraints in Quasi-lattices. 136-148 - Nikhil R. Devanur, Vijay V. Vazirani:
An Improved Approximation Scheme for Computing Arrow-Debreu Prices for the Linear Case. 149-155 - Volker Diekert, Markus Lohrey:
Word Equations over Graph Products. 156-167 - Devdatt P. Dubhashi, Luigi Laura, Alessandro Panconesi:
Analysis and Experimental Evaluation of a Simple Algorithm for Collaborative Filtering in Planted Partition Models: Extended Abstract. 168-182 - Funda Ergün, S. Muthukrishnan, Süleyman Cenk Sahinalp:
Comparing Sequences with Segment Rearrangements. 183-194 - Zoltán Ésik, Pascal Weil:
On Logically Defined Recognizable Tree Languages. 195-207 - Parikshit Gopalan, Richard J. Lipton, Aranyak Mehta:
Randomized Time-Space Tradeoffs for Directed Graph Connectivity. 208-216 - Joachim Gudmundsson, Giri Narasimhan
, Michiel H. M. Smid:
Distance-Preserving Approximations of Polygonal Paths. 217-228 - Sumanta Guha:
Joint Separation of Geometric Clusters and the Extreme Irregularities of Regular Polyhedra. 229-243 - Anupam Gupta, Aravind Srinivasan:
On the Covering Steiner Problem. 244-251 - Daniel Hirschkoff, Étienne Lozes, Davide Sangiorgi:
Minimality Results for the Spatial Logics. 252-264 - Srinivas R. Kashyap, Samir Khuller:
Algorithms for Non-uniform Size Data Placement on Parallel Disks. 265-276 - Telikepalli Kavitha:
Efficient Algorithms for Abelian Group Isomorphism and Related Problems. 277-288 - Jochen Könemann, R. Ravi:
Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees. 289-301 - Christof Löding, Philipp Rohde:
Model Checking and Satisfiability for Sabotage Modal Logic. 302-313 - Meena Mahajan, Raghavan Rama, Venkatesh Raman, Vijayakumar Sundarrajan:
Merging and Sorting By Strip Moves. 314-325 - Sebastian Maneth:
The Macro Tree Transducer Hierarchy Collapses for Functions of Linear Size Increase. 326-337 - Swarup Mohalik, Igor Walukiewicz:
Distributed Games. 338-351 - S. Muthukrishnan, Martin Strauss:
Maintenance of Multidimensional Histograms. 352-362 - Ramaswamy Ramanujam, S. P. Suresh:
Tagging Makes Secrecy Decidable with Unbounded Nonces as Well. 363-374 - Holger Spakowski, Mayur Thakur, Rahul Tripathi:
Quantum and Classical Complexity Classes: Separations, Collapses, and Closure Properties. 375-386 - Maik Weinard, Georg Schnitger:
On the Greedy Superstring Conjecture. 387-398
Invited Papers
- Randal E. Bryant:
Reasoning about Infinite State Systems Using Boolean Methods. 399-407 - Jin-yi Cai, Osamu Watanabe:
Stringent Relativization. 408-419 - Gregor Gößler, Joseph Sifakis:
Component-Based Construction of Deadlock-Free Systems: Extended Abstract. 420-433 - Moni Naor:
Moderately Hard Functions: From Complexity to Spam Fighting. 434-442 - Avi Wigderson:
Zigzag Products, Expander Constructions, Connections, and Applications. 443
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-21 20:37 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
