Conferences in DBLP
Amir Pnueli System Specification and Refinement in Temporal Logic. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1992, pp:1-38 [Conf ] Mads Dam Fixed Points of Büchi Automata. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1992, pp:39-50 [Conf ] Y. S. Ramakrishna , Laura K. Dillon , Louise E. Moser , P. M. Melliar-Smith , G. Kutty An Automata-Theoretic Decision Procedure for Future Interval Logic. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1992, pp:51-67 [Conf ] Philippe Granger Improving the Results of Static Analyses Programs by Local Decreasing Iteration. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1992, pp:68-79 [Conf ] Pankaj K. Agarwal , Marc J. van Kreveld Implicit Point Location in Arrangements of Line Segments, with an Application to Motion Planning. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1992, pp:80-91 [Conf ] Shreesh Jadhav , Asish Mukhopadhyay , Binay K. Bhattacharya An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1992, pp:92-103 [Conf ] Christos Levcopoulos , Andrzej Lingas C-sensitive Triangulations Approximate the MinMax Length Triangulation. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1992, pp:104-115 [Conf ] Harry Buhrman , Steven Homer Superpolynomial Circuits, Almost Sparse Oracles and the Exponential Hierarchy. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1992, pp:116-127 [Conf ] Rainer Schuler , Tomoyuki Yamakami Structural Average Case Complexity. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1992, pp:128-139 [Conf ] Vikraman Arvind , Johannes Köbler , Martin Mundhenk On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1992, pp:140-151 [Conf ] K. Ganesan One-way Functions and Isomorphism Conjecture. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1992, pp:152-163 [Conf ] Richa Agarwala , David Fernández-Baca Solving the Lagrangian Dual when the Number of Constraints is Fixed. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1992, pp:164-175 [Conf ] Laks V. S. Lakshmanan , Daniel A. Nonen Superfiniteness of Query Answers in Deductive Databases: An Automata-Theoretic Approach. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1992, pp:176-190 [Conf ] Joachim Steinbach Proving Polynomials Positive. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1992, pp:191-202 [Conf ] Renganathan Sundararajan , John S. Conery An Abstract Interpretation Scheme for Groundedness, Freeness, and Sharing Analysis of Logic Programs. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1992, pp:203-216 [Conf ] Bruno Monsuez Polymorphic Typing by Abstract Interpretation. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1992, pp:217-228 [Conf ] Gérard P. Huet The Gallina Specification language: A Case Study. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1992, pp:229-240 [Conf ] Wolfgang Reif Verification of Large Software Systems. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1992, pp:241-252 [Conf ] Vijay K. Garg , Brian Waldecker Detection of Unstable Predicates in Distributed Programs. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1992, pp:253-264 [Conf ] Sachin B. Patkar , H. Narayanan Fast Sequential and Randomised Parallel Algorithms for Rigidity and approximate Min k-cut. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1992, pp:265-278 [Conf ] R. Ravi , Balaji Raghavachari , Philip N. Klein Approximation Through Local Optimality: Designing Networks with Small Degree. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1992, pp:279-290 [Conf ] Samson Abramsky , Radha Jagadeesan Games and Full Completeness for Multiplicative Linear Logic (Extended Abstract). [Citation Graph (0, 0)][DBLP ] FSTTCS, 1992, pp:291-301 [Conf ] Jens Chr. Godskesen , Kim Guldstrand Larsen Real-Time Calculi and Expansion Theorems. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1992, pp:302-315 [Conf ] Didier Caucal Branching Bisimulation for Context-free Processes. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1992, pp:316-327 [Conf ] Madhavan Mukund , Mogens Nielsen CCS, Location and Asynchronous Transition Systems. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1992, pp:328-341 [Conf ] Linda Christoff , Ivan Christoff Reasonong about Safety and Liveness Properties for Probabilistic Processes. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1992, pp:342-355 [Conf ] S. Muthukrishnan , H. Ramesh String Matching Under a General Matching Relation. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1992, pp:356-367 [Conf ] Charles U. Martel , Ramesh Subramonian On the Complexity of Certified Write All Algorithms. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1992, pp:368-379 [Conf ] J. Ian Munro , Venkatesh Raman Selection from Read-Only Memory and Sorting with Optimum Data Movement. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1992, pp:380-391 [Conf ] Bala Ravikumar Some Observations on 2-way Probabilistic Finite Automata. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1992, pp:392-403 [Conf ] Kurt Mehlhorn Recent Developments in Algorithms for the Maximum-Flow Problem (Abstract). [Citation Graph (0, 0)][DBLP ] FSTTCS, 1992, pp:404- [Conf ]