Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Jesper Jansson 0001, Kunihiko Sadakane, Wing-Kin Sung |
Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
|
1 | Michel Hirschowitz, André Hirschowitz, Tom Hirschowitz |
A Theory for Game Theories. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
categories, Game semantics |
1 | Benedikt Bollig, Dietrich Kuske, Ingmar Meinecke |
Propositional Dynamic Logic for Message-Passing Systems. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
|
1 | Ravi Kumar 0001, D. Sivakumar 0001 |
Communication Lower Bounds Via the Chromatic Number. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
|
1 | Michael Backes 0001, Markus Dürmuth, Ralf Küsters |
On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
|
1 | Jacobo Torán |
Reductions to Graph Isomorphism. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
Computational complexity, reducibilities, graph isomorphism |
1 | Christel Baier, Nathalie Bertrand 0001, Patricia Bouyer, Thomas Brihaye, Marcus Größer |
Probabilistic and Topological Semantics for Timed Automata. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
|
1 | Myrto Arapinis, Marie Duflot |
Bounding Messages for Free in Security Protocols. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
|
1 | Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh 0001 |
Better Algorithms and Bounds for Directed Maximum Leaf Problems. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
|
1 | Sven Schewe |
Solving Parity Games in Big Steps. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
|
1 | Salil P. Vadhan |
The Complexity of Zero Knowledge. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
|
1 | Nicolas Baudru, Rémi Morin |
Synthesis of Safe Message-Passing Systems. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
|
1 | Michael Benedikt, Alan Jeffrey |
Efficient and Expressive Tree Filters. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
|
1 | Christian Glaßer, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr |
Satisfiability of Algebraic Circuits over Sets of Natural Numbers. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
|
1 | Benjamin C. Pierce |
Adventures in Bidirectional Programming. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
|
1 | Telikepalli Kavitha |
Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
|
1 | Rajasekhar Inkulu, Sanjiv Kapoor |
Finding a Rectilinear Shortest Path in R2 Using Corridor Based Staircase Structures. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
|
1 | Matthias Schmalz, Hagen Völzer, Daniele Varacca |
Model Checking Almost All Paths Can Be Less Expensive Than Checking All Paths. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
|
1 | Naveen Garg 0001, Amit Kumar 0001, Vinayaka Pandit |
Order Scheduling Models: Hardness and Algorithms. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
|
1 | Olaf Beyersdorff |
The Deduction Theorem for Strong Propositional Proof Systems. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
|
1 | Ryan C. Harkins, John M. Hitchcock, Aduri Pavan |
Strong Reductions and Isomorphism of Complete Sets. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
|
1 | Rémy Haemmerlé, François Fages, Sylvain Soliman |
Closures and Modules Within Linear Logic Concurrent Constraint Programming. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
|
1 | Andreas Jakoby, Till Tantau |
Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
logspace algorithms, distance problem, longest path problem, bounded tree-width, K 4-minor-free graphs, Series-parallel graphs |
1 | Jérôme Leroux, Grégoire Sutre |
Acceleration in Convex Data-Flow Analysis. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
|
1 | Krishnendu Chatterjee |
Markov Decision Processes with Multiple Long-Run Average Objectives. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
|
1 | Pierre Chambart, Philippe Schnoebelen |
Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
Lossy channel systems, Higman’s Lemma, Post correspondence problem |
1 | Thomas W. Reps, Akash Lal, Nicholas Kidd |
Program Analysis Using Weighted Pushdown Systems. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
|
1 | Paul Gastin, Nathalie Sznajder, Marc Zeitoun |
Distributed Synthesis for Well-Connected Architectures. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Florent Becker, Ivan Rapaport, Eric Rémila |
Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Gordon D. Plotkin |
Hennessy-Plotkin-Brookes Revisited. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
1 | James Laird |
Game Semantics for Higher-Order Concurrency. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Gary Wassermann, Zhendong Su 0001 |
Validity Checking for Finite Automata over Linear Arithmetic Constraints. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Michael Ummels |
Rational Behaviour and Strategy Construction in Infinite Multiplayer Games. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Benjamin Doerr, Christian Klein 0001 |
Unbiased Rounding of Rational Matrices. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Russell Harmer, Olivier Laurent 0001 |
The Anatomy of Innocence Revisited. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Sourav Chakraborty 0001, Jaikumar Radhakrishnan, Nandakumar Raghunathan, Prashant Sasatte |
Zero Error List-Decoding Capacity of the q/(q-1) Channel. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Chaitanya Swamy, David B. Shmoys |
Approximation Algorithms for 2-Stage Stochastic Optimization Problems. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Aduri Pavan, Rahul Santhanam, N. V. Vinodchandran |
Some Results on Average-Case Hardness Within the Polynomial Hierarchy. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Josée Desharnais, François Laviolette, Sami Zhioua |
Testing Probabilistic Equivalence Through Reinforcement Learning. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Andreas Bauer 0002, Martin Leucker, Christian Schallhart |
Monitoring of Real-Time Properties. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Tamal K. Dey, Jian Sun 0002 |
Normal and Feature Approximations from Noisy Point Clouds. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Sun-Yuan Hsieh |
Linear-Time Algorithms for Two Subtree-Comparison Problems on Phylogenetic Trees with Different Species. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Ranko Lazic 0001 |
Safely Freezing LTL. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Christian Dax, Martin Hofmann 0001, Martin Lange |
A Proof System for the Linear Time µ-Calculus. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Laura Bozzelli, Mojmír Kretínský, Vojtech Rehák, Jan Strejcek |
On Decidability of LTL Model Checking for Process Rewrite Systems. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Gruia Calinescu, Michael J. Pelsmajer |
Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Thierry Cachat |
Tree Automata Make Ordinal Theory Easy. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Marcus Größer, Gethin Norman, Christel Baier, Frank Ciesinski, Marta Z. Kwiatkowska, David Parker 0001 |
On Reduction Criteria for Probabilistic Reward Models. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Mohammad Reza Mousavi 0001, Iain C. C. Phillips, Michel A. Reniers, Irek Ulidowski |
The Meaning of Ordered SOS. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Pankaj K. Agarwal, Sergio Cabello, Joan Antoni Sellarès, Micha Sharir |
Computing a Center-Transversal Line. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Gérard Boudol |
Shared-Variable Concurrency: A Proposal. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Beatriz Alarcón, Raúl Gutiérrez, Salvador Lucas |
Context-Sensitive Dependency Pairs. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
program analysis, termination, term rewriting, Dependency pairs |
1 | Sushmita Gupta, Venkatesh Raman 0001, Saket Saurabh 0001 |
Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Rajeev Alur, Swarat Chaudhuri |
Branching Pushdown Tree Automata. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Didier Galmiche, Dominique Larchey-Wendling |
Expressivity Properties of Boolean. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
1 | K. Murali Krishnan 0001, L. Sunil Chandran |
Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
1 | S. Arun-Kumar, Naveen Garg 0001 (eds.) |
FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 26th International Conference, Kolkata, India, December 13-15, 2006, Proceedings |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Emo Welzl |
The Number of Crossing Free Configurations on Finite Point Sets in the Plane. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Shankar Kalyanaraman, Christopher Umans |
On Obtaining Pseudorandomness from Error-Correcting Codes. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Michael A. Bekos, Michael Kaufmann 0001, Katerina Potika, Antonios Symvonis |
Multi-stack Boundary Labeling Problems. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Tanmoy Chakraborty 0001, Samir Datta |
One-Input-Face MPCVP Is Hard for L, But in LogDCFL. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
L, LogDCFL, monotone planar circuits |
1 | Fedor V. Fomin, Fabrizio Grandoni 0001, Dieter Kratsch |
Solving Connected Dominating Set Faster Than 2n. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Sariel Har-Peled |
Coresets for Discrete Integration and Clustering. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Véronique Cortier, Steve Kremer, Ralf Küsters, Bogdan Warinschi |
Computationally Sound Symbolic Secrecy in the Presence of Hash Functions. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey, Jacob Illum Rasmussen |
Almost Optimal Strategies in One Clock Priced Timed Games. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Fabrice Chevalier, Deepak D'Souza, Pavithra Prabhakar |
On Continuous Timed Automata with Input-Determined Guards. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Michael Edwards, Kasturi R. Varadarajan |
No Coreset, No Cry: II. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Béatrice Bérard, Franck Cassez, Serge Haddad, Didier Lime, Olivier H. Roux |
When Are Timed Automata Weakly Timed Bisimilar to Time Petri Nets? |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
Weak Timed Bisimilarity, Timed Automata, Time Petri Nets |
1 | Andreas Baltz, Devdatt P. Dubhashi, Libertad Tansini, Anand Srivastav, Sören Werth |
Probabilistic Analysis for a Multiple Depot Vehicle Routing Problem. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Bruno Codenotti, Benton McCune, Sriram Penumatcha, Kasturi R. Varadarajan |
Market Equilibrium for CES Exchange Economies: Existence, Multiplicity, and Computation. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Prasad Jayanti, Srdjan Petrovic |
Logarithmic-Time Single Deleter, Multiple Inserter Wait-Free Queues and Stacks. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Ana Almeida Matos |
Non-disclosure for Distributed Mobile Code. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Radha Jagadeesan, Gopalan Nadathur, Vijay A. Saraswat |
Testing Concurrent Systems: An Interpretation of Intuitionistic Logic. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Ramaswamy Ramanujam, Sandeep Sen (eds.) |
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 25th International Conference, Hyderabad, India, December 15-18, 2005, Proceedings |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Shankara Narayanan Krishna, Paritosh K. Pandya |
Modal Strength Reduction in Quantified Discrete Duration Calculus. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Henning Fernau, Michael Kaufmann 0001, Mathias Poths |
Comparing Trees Via Crossing Minimization. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Patricia Bouyer, Fabrice Chevalier, Nicolas Markey |
On the Expressiveness of TPTL and MTL. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Raimund Seidel |
Developments in Data Structure Research During the First 25 Years of FSTTCS. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Refael Hassin, Danny Segev |
The Set Cover with Pairs Problem. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Russell Impagliazzo |
Computational Complexity Since 1980. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Krishnendu Chatterjee, Thomas A. Henzinger |
Semiperfect-Information Games. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Deepak D'Souza, M. Raj Mohan |
Eventual Timed Automata. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Joost Engelfriet, Sebastian Maneth |
The Equivalence Problem for Deterministic MSO Tree Transducers Is Decidable. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Eric Allender, Samir Datta, Sambuddha Roy |
The Directed Planar Reachability Problem. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Bharat Adsul, Madhavan Mukund, K. Narayan Kumar, Vasumathi Narayanan |
Causal Closure for MSC Languages. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Igor Walukiewicz |
From Logic to Games. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Manindra Agrawal |
Proving Lower Bounds Via Pseudo-random Generators. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Toshiyasu Arai, Georg Moser |
Proofs of Termination of Rewrite Systems for Polytime Functions. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Antonín Kucera 0001, Oldrich Strazovský |
On the Controller Synthesis for Finite-State Markov Decision Processes. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Vijay Kumar, Atri Rudra |
Approximation Algorithms for Wavelength Assignment. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Pavel Krcál, Radek Pelánek |
On Sampled Semantics of Timed Systems. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Ugo Dal Lago, Martin Hofmann 0001 |
Quantitative Models and Implicit Complexity. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Tim French 0002 |
Bisimulation Quantified Logics: Undecidability. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Mark Reynolds 0001 |
Towards a CTL* Tableau. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Ahmed Bouajjani, Javier Esparza, Stefan Schwoon, Jan Strejcek |
Reachability Analysis of Multithreaded Software with Asynchronous Communication. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Stefan Göller, Markus Lohrey |
Fixpoint Logics on Hierarchical Structures. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Natarajan Shankar |
Inference Systems for Logical Algorithms. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Sumit Ganguly, Deepanjan Kesh, Chandan Saha 0001 |
Practical Algorithms for Tracking Database Join Sizes. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Ting Zhang 0001, Henny B. Sipma, Zohar Manna |
Decision Procedures for Queues with Integer Constraints. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Ellie D'Hondt, Prakash Panangaden |
Reasoning About Quantum Knowledge. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|