default search action
27th FSTTCS 2007: New Delhi, India
- Vikraman Arvind, Sanjiva Prasad:
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings. Lecture Notes in Computer Science 4855, Springer 2007, ISBN 978-3-540-77049-7
Invited Papers
- Maurice Herlihy:
The Multicore Revolution. 1-8 - Richard M. Karp:
Streaming Algorithms for Selection and Approximate Sorting. 9-20 - Benjamin C. Pierce:
Adventures in Bidirectional Programming. 21-22 - Thomas W. Reps, Akash Lal, Nicholas Kidd:
Program Analysis Using Weighted Pushdown Systems. 23-51 - Salil P. Vadhan:
The Complexity of Zero Knowledge. 52-70
Contributed Papers
- Amit Kumar
, Yogish Sabharwal:
The Priority k-Median Problem. 71-83 - Takuro Fukunaga, Magnús M. Halldórsson, Hiroshi Nagamochi:
"Rent-or-Buy" Scheduling and Cost Coloring Problems. 84-95 - Naveen Garg
Order Scheduling Models: Hardness and Algorithms. 96-107 - Michael Backes, Markus Dürmuth, Ralf Küsters:
On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography. 108-120 - Yannick Chevalier, Mounira Kourjieh:
Key Substitution in the Symbolic Analysis of Cryptographic Protocols. 121-132 - Stéphanie Delaune, Steve Kremer
Symbolic Bisimulation for the Applied Pi Calculus. 133-145 - Christian Glaßer, Alan L. Selman, Stephen D. Travers, Liyu Zhang:
Non-mitotic Sets. 146-157 - Jacobo Torán:
Reductions to Graph Isomorphism. 158-167 - Ryan C. Harkins, John M. Hitchcock
Strong Reductions and Isomorphism of Complete Sets. 168-178 - Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Marcus Größer:
Probabilistic and Topological Semantics for Timed Automata. 179-191 - Michel Hirschowitz, André Hirschowitz, Tom Hirschowitz:
A Theory for Game Theories. 192-203 - Diptikalyan Saha:
An Incremental Bisimulation Algorithm. 204-215 - Andreas Jakoby, Till Tantau:
Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs. 216-227 - Ravi Kumar, D. Sivakumar:
Communication Lower Bounds Via the Chromatic Number. 228-240 - Olaf Beyersdorff:
The Deduction Theorem for Strong Propositional Proof Systems. 241-252 - Christian Glaßer, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr:
Satisfiability of Algebraic Circuits over Sets of Natural Numbers. 253-264 - Pierre Chambart, Philippe Schnoebelen:
Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems. 265-276 - Nicolas Baudru, Rémi Morin:
Synthesis of Safe Message-Passing Systems. 277-289 - S. Akshay, Benedikt Bollig, Paul Gastin:
Automata and Logics for Timed Message Sequence Charts. 290-302 - Benedikt Bollig, Dietrich Kuske, Ingmar Meinecke:
Propositional Dynamic Logic for Message-Passing Systems. 303-315 - Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh:
Better Algorithms and Bounds for Directed Maximum Leaf Problems. 316-327 - Telikepalli Kavitha:
Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs. 328-339 - Herbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider
Covering Graphs with Few Complete Bipartite Subgraphs. 340-351 - Véronique Cortier, Jérémie Delaitre, Stéphanie Delaune:
Safely Composing Security Protocols. 352-363 - Judicaël Courant, Cristian Ene, Yassine Lakhnech:
Computationally Sound Typing for Non-interference: The Case of Deterministic Encryption. 364-375 - Myrto Arapinis, Marie Duflot
Bounding Messages for Free in Security Protocols. 376-387 - Mathieu Brévilliers, Nicolas Chevallier, Dominique Schmitt:
Triangulations of Line Segment Sets in the Plane. 388-399 - Therese Biedl, Masud Hasan, Alejandro López-Ortiz:
Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections. 400-411 - Rajasekhar Inkulu, Sanjiv Kapoor:
Finding a Rectilinear Shortest Path in R2 Using Corridor Based Staircase Structures. 412-423 - Jesper Jansson
Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space. 424-435 - Krishnendu Chatterjee:
Stochastic Müller Games are PSPACE-Complete. 436-448 - Sven Schewe
Solving Parity Games in Big Steps. 449-460 - Michael Benedikt, Alan Jeffrey:
Efficient and Expressive Tree Filters. 461-472 - Krishnendu Chatterjee:
Markov Decision Processes with Multiple Long-Run Average Objectives. 473-484 - Sanjeev Khanna, Keshav Kunal, Benjamin C. Pierce:
A Formal Investigation of. 485-496 - Anand Srivastav, Sören Werth:
Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem. 497-507 - Walid Belkhir, Luigi Santocanale:
Undirected Graphs of Entanglement 2. 508-519 - Jérôme Leroux, Grégoire Sutre:
Acceleration in Convex Data-Flow Analysis. 520-531 - Matthias Schmalz, Hagen Völzer, Daniele Varacca:
Model Checking Almost All Paths Can Be Less Expensive Than Checking All Paths. 532-543 - Rémy Haemmerlé, François Fages, Sylvain Soliman:
Closures and Modules Within Linear Logic Concurrent Constraint Programming. 544-556
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-12-17 21:06 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: