Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Mojmír Kretínský, Vojtech Rehák, Jan Strejcek |
Reachability of Hennessy-Milner Properties for Weakly Extended PRS. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Xiaoyang Gu, Jack H. Lutz, Philippe Moser |
Dimensions of Copeland-Erdös Sequences. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Jirí Srba |
On Counting the Number of Consistent Genotype Assignments for Pedigrees. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Sathya Peri, Neeraj Mittal |
Monitoring Stable Properties in Dynamic Peer-to-Peer Distributed Systems. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | P. Madhusudan, P. S. Thiagarajan, Shaofa Yang |
The MSO Theory of Connectedly Communicating Processes. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Tomás Brázdil, Antonín Kucera 0001 |
Computing the Expected Accumulated Reward and Gain for a Subclass of Infinite Markov Chains. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Joel Spencer |
Erdös Magic. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | S. Muthukrishnan 0001 |
Subquadratic Algorithms for Workload-Aware Haar Wavelet Synopses. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Taolue Chen, Tingting Han 0001, Jian Lu 0001 |
On the Bisimulation Congruence in chi-Calculus. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Mark de Berg |
Improved Bounds on the Union Complexity of Fat Objects. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Jens Chr. Godskesen, Thomas T. Hildebrandt |
Extending Howe's Method to Early Bisimulations for Typed Mobile Embedded Resources with Local Names. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Venkatesh Mysore, Amir Pnueli |
Refining the Undecidability Frontier of Hybrid Automata. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
1 | John C. Reynolds |
Toward a Grainless Semantics for Shared-Variable Concurrency. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Kamal Lodaya, Meena Mahajan (eds.) |
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 24th International Conference, Chennai, India, December 16-18, 2004, Proceedings |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | John M. Hitchcock, Aduri Pavan |
Hardness Hypotheses, Derandomization, and Circuit Complexity. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Sumit Gulwani, Ashish Tiwari 0001, George C. Necula |
Join Algorithms for the Theory of Uninterpreted Functions. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | G. Venkatesh |
Reasoning About Game Equilibria Using Temporal Logic. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Patricia Bouyer, Franck Cassez, Emmanuel Fleury, Kim Guldstrand Larsen |
Optimal Strategies in Priced Timed Game Automata. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Vijay Chandru, Ramesh Hariharan, Narasimha M. Krishnakumar |
Short-Cuts on Star, Source and Planar Unfoldings. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Julia Kempe, Alexei Y. Kitaev, Oded Regev 0001 |
The Complexity of the Local Hamiltonian Problem. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Abhay Vardhan, Koushik Sen, Mahesh Viswanathan 0001, Gul Agha |
Actively Learning to Verify Safety for FIFO Automata. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Paul Gastin, Benjamin Lerman, Marc Zeitoun |
Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Ivana Mijajlovic, Noah Torp-Smith, Peter W. O'Hearn |
Refinement and Separation Contexts. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Javier Esparza, Kousha Etessami |
Verifying Probabilistic Procedural Programs. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Angelo Montanari, Gabriele Puppis |
Decidability of MSO Theories of Tree Structures. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Olaf Beyersdorff |
Representable Disjoint NP-Pairs. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Marco Carbone, Mogens Nielsen, Vladimiro Sassone |
A Calculus for Trust Management. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Luis Rademacher, Santosh S. Vempala |
Testing Geometric Convexity. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Max A. Alekseyev, Pavel A. Pevzner |
Genome Halving Problem Revisited. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Anuj Dawar, Philippa Gardner, Giorgio Ghelli |
Adjunct Elimination Through Games in Static Ambient Logic. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Mayur Thakur, Rahul Tripathi |
Complexity of Linear Connectivity Problems in Directed Hypergraphs. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Gerold Jäger, Anand Srivastav |
Improved Approximation Algorithms for Maximum Graph Partitioning Problems. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Martin Fürer, Shiva Prasad Kasiviswanathan |
An Almost Linear Time Approximation Algorithm for the Permanen of a Random (0-1) Matrix. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Michaël Adélaïde, Claire Pagetti |
On the Urgency Expressiveness. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
timed regular expression, minimal number of clocks, n-clock timed language, Timed automaton, urgency |
1 | Sanjay Jain 0001, Efim B. Kinber |
Learning Languages from Positive Data and a Finite Number of Queries. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Srinivasan Parthasarathy 0002, Rajiv Gandhi |
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Ahmed Bouajjani, Antoine Meyer |
Symbolic Reachability Analysis of Higher-Order Context-Free Processes. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Hartmut Klauck |
Quantum and Classical Communication-Space Tradeoffs from Rectangle Bounds. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Parosh Aziz Abdulla, Pritha Mahata, Richard Mayr |
Decidability of Zenoness, Syntactic Boundedness and Token-Liveness for Dense-Timed Petri Nets. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Christof Löding, P. Madhusudan, Olivier Serre |
Visibly Pushdown Games. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro, Gaoyan Xie |
Real-Counter Automata and Their Decision Problems. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Anuj Dawar, David Janin |
On the Bisimulation Invariant Fragment of Monadic S1 in the Finite. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Denis Thérien |
Regular Languages, Unambiguous Concatenation and Computational Complexity. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Bharat Adsul, Milind A. Sohoni |
Asynchronous Automata-Theoretic Characterization of Aperiodic Trace Languages. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Ashok Kumar Ponnuswami, H. Venkateswaran |
Monotone Multilinear Boolean Circuits for Bipartite Perfect Matching Require Exponential Size. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Shay Kutten, Boaz Patt-Shamir |
Adaptive Stabilization of Reactive Protocols. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Kumar Neeraj Verma |
Alternation in Equational Tree Automata Modulo XOR. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Ho-Lun Cheng, Tony Tan |
Subdividing Alpha Complex. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Nikhil R. Devanur, Richard J. Lipton, Nisheeth K. Vishnoi |
On the Complexity of Hilbert's 17th Problem. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Dino Distefano, Joost-Pieter Katoen, Arend Rensink |
Who is Pointing When to Whom? |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Piotr Indyk |
Streaming Algorithms for Geometric Problems. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin |
Expand, Enlarge, and Check: New Algorithms for the Coverability Problem of WSTS. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Mark de Berg, Micha Streppel |
Approximate Range Searching Using Binary Space Partitions. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Sariel Har-Peled |
No, Coreset, No Cry. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Joachim Gudmundsson, Christos Levcopoulos |
Minimum Weight Pseudo-Triangulations. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn |
A Decidable Fragment of Separation Logic. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Nicolas Biri, Didier Galmiche |
A Separation Logic for Resource Distribution: Extended Abstract. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Alexis-Julien Bouquet, Olivier Serre, Igor Walukiewicz |
Pushdown Games with Unboundedness and Regular Conditions. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Sebastian Maneth |
The Macro Tree Transducer Hierarchy Collapses for Functions of Linear Size Increase. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Gregor Gößler, Joseph Sifakis |
Component-Based Construction of Deadlock-Free Systems: Extended Abstract. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Jochen Könemann, R. Ravi 0001 |
Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Parikshit Gopalan, Richard J. Lipton, Aranyak Mehta |
Randomized Time-Space Tradeoffs for Directed Graph Connectivity. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Randal E. Bryant |
Reasoning about Infinite State Systems Using Boolean Methods. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Ahmed Bouajjani, Tayssir Touili |
Reachability Analysis of Process Rewrite Systems. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Mikolaj Bojanczyk |
1-Bounded TWA Cannot Be Determinized. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Avi Wigderson |
Zigzag Products, Expander Constructions, Connections, and Applications. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Christof Löding, Philipp Rohde |
Model Checking and Satisfiability for Sabotage Modal Logic. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid |
Distance-Preserving Approximations of Polygonal Paths. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Arnaud Carayol, Stefan Wöhrle |
The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Emmanuel Coquery, François Fages |
Subtyping Constraints in Quasi-lattices. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Andrew P. Black, Vincent Cremet, Rachid Guerraoui, Martin Odersky |
An Equational Theory for Transactions. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Devdatt P. Dubhashi, Luigi Laura, Alessandro Panconesi |
Analysis and Experimental Evaluation of a Simple Algorithm for Collaborative Filtering in Planted Partition Models: Extended Abstract. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Ramaswamy Ramanujam, S. P. Suresh |
Tagging Makes Secrecy Decidable with Unbounded Nonces as Well. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Zoltán Ésik, Pascal Weil |
On Logically Defined Recognizable Tree Languages. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Telikepalli Kavitha |
Efficient Algorithms for Abelian Group Isomorphism and Related Problems. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Volker Diekert, Markus Lohrey |
Word Equations over Graph Products. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
1 | S. Muthukrishnan 0001, Martin Strauss 0001 |
Maintenance of Multidimensional Histograms. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Meena Mahajan, Raghavan Rama 0001, Venkatesh Raman 0001, Vijayakumar Sundarrajan |
Merging and Sorting By Strip Moves. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Michael Backes 0001, Birgit Pfitzmann |
A Cryptographically Sound Security Proof of the Needham-Schroeder-Lowe Public-Key Protocol. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Paritosh K. Pandya, Jaikumar Radhakrishnan (eds.) |
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 23rd Conference, Mumbai, India, December 15-17, 2003, Proceedings |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Andreas Baltz, Gerold Jäger, Anand Srivastav |
Constructions of Sparse Asymmetric Connectors: Extended Abstract. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Jin-yi Cai, Osamu Watanabe 0001 |
Stringent Relativization. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Sumanta Guha |
Joint Separation of Geometric Clusters and the Extreme Irregularities of Regular Polyhedra. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Stephen L. Bloom, Zoltán Ésik |
Axioms for Regular Words: Extended Abstract. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Funda Ergün, S. Muthukrishnan 0001, Süleyman Cenk Sahinalp |
Comparing Sequences with Segment Rearrangements. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Anupam Gupta 0001, Aravind Srinivasan |
On the Covering Steiner Problem. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Véronique Bruyère, Jean-François Raskin |
Real-Time Model-Checking: Parameters Everywhere. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani |
Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Nikhil R. Devanur, Vijay V. Vazirani |
An Improved Approximation Scheme for Computing Arrow-Debreu Prices for the Linear Case. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Holger Spakowski, Mayur Thakur, Rahul Tripathi |
Quantum and Classical Complexity Classes: Separations, Collapses, and Closure Properties. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Daniel Hirschkoff, Étienne Lozes, Davide Sangiorgi |
Minimality Results for the Spatial Logics. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Srinivas R. Kashyap, Samir Khuller |
Algorithms for Non-uniform Size Data Placement on Parallel Disks. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Swarup Mohalik, Igor Walukiewicz |
Distributed Games. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Maik Weinard, Georg Schnitger |
On the Greedy Superstring Conjecture. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Moni Naor |
Moderately Hard Functions: From Complexity to Spam Fighting. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, Scott Shenker |
Hardness Results for Multicast Cost Sharing. |
FSTTCS |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Sebastian Maneth |
The Complexity of Compositions of Deterministic Tree Transducers. |
FSTTCS |
2002 |
DBLP DOI BibTeX RDF |
Deterministic Macro Tree Transducers, Complexity |
1 | Carsten Fritz, Thomas Wilke |
State Space Reductions for Alternating Büchi Automata. |
FSTTCS |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Yogish Sabharwal, Nishant Sharma, Sandeep Sen |
Nearest Neighbors Search Using Point Location in Balls with Applications to Approximate Voronoi Decompositions. |
FSTTCS |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Stéphane Demri, Deepak D'Souza |
An Automata-Theoretic Approach to Constraint LTL. |
FSTTCS |
2002 |
DBLP DOI BibTeX RDF |
|