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