
Conferences in DBLP
 Manuel Blum
Program Checking. [Citation Graph (0, 0)][DBLP] FSTTCS, 1991, pp:19 [Conf]
 Andreas Blass, Yuri Gurevich
Randomizing Reductions of Search Problems. [Citation Graph (0, 0)][DBLP] FSTTCS, 1991, pp:1024 [Conf]
 David Sands
Time Analysis, Cost Equivalence and Program Refinement. [Citation Graph (0, 0)][DBLP] FSTTCS, 1991, pp:2539 [Conf]
 Subrata Mitra, G. Sivakumar
ACEquation Solving. [Citation Graph (0, 0)][DBLP] FSTTCS, 1991, pp:4056 [Conf]
 QingPing Tan, HuoWang Chen
On the Operational Interpretation of Complex Types. [Citation Graph (0, 0)][DBLP] FSTTCS, 1991, pp:5770 [Conf]
 Kamal Lodaya, Ramaswamy Ramanujam
Tense Logics for Local Reasoning in Distributed Systems. [Citation Graph (0, 0)][DBLP] FSTTCS, 1991, pp:7188 [Conf]
 Luca Aceto, Uffe Engberg
Failures Semantics for a Simple Process Language with Refinement. [Citation Graph (0, 0)][DBLP] FSTTCS, 1991, pp:89108 [Conf]
 Hardi Hungar
Correstness of Programs over Poor Signatures. [Citation Graph (0, 0)][DBLP] FSTTCS, 1991, pp:109120 [Conf]
 John Case, Sanjay Jain, Arun Sharma
Complexity Issues for Vacillatory Function Identification. [Citation Graph (0, 0)][DBLP] FSTTCS, 1991, pp:121140 [Conf]
 Bertrand Le Saëc, JeanEric Pin, Pascal Weil
A Purely Algebraic Proof of McNaughton's Theorem on Infinite Words. [Citation Graph (0, 0)][DBLP] FSTTCS, 1991, pp:141151 [Conf]
 Tao Jiang, Edward McDowell, Bala Ravikumar
The Structure and Complexity of Minimal NFA's over a Unary Alphabet. [Citation Graph (0, 0)][DBLP] FSTTCS, 1991, pp:152171 [Conf]
 Meena Mahajan, Kamala Krithivasan
Relativised Cellular Automata and Complexity Classes. [Citation Graph (0, 0)][DBLP] FSTTCS, 1991, pp:172185 [Conf]
 Sam M. Kim, Robert McNaughton
Computing the Order of a Locally Testable Automaton. [Citation Graph (0, 0)][DBLP] FSTTCS, 1991, pp:186211 [Conf]
 Judy Goldsmith, Lane A. Hemachandra, Kenneth Kunen
On the Structure and Complexity of Infinite Sets with Minimal Perfect Hash Functions. [Citation Graph (0, 0)][DBLP] FSTTCS, 1991, pp:212223 [Conf]
 Manindra Agrawal
NPhard Sets and Creativeness over Constant Time Languages. [Citation Graph (0, 0)][DBLP] FSTTCS, 1991, pp:224241 [Conf]
 Iain A. Stewart
Complete Problems Involving Boolean Labelled Structures and Projections Translations. [Citation Graph (0, 0)][DBLP] FSTTCS, 1991, pp:242260 [Conf]
 V. Vinay
Is BP.+P a Probabilistic Class? [Citation Graph (0, 0)][DBLP] FSTTCS, 1991, pp:261265 [Conf]
 J. Ian Munro, Venkatesh Raman
Fast Sorting InPlace Sorting with O(n) Data. [Citation Graph (0, 0)][DBLP] FSTTCS, 1991, pp:266277 [Conf]
 Vangelis Th. Paschos
A Theorem on the Approximation of Set Cover and Vertex Cover. [Citation Graph (0, 0)][DBLP] FSTTCS, 1991, pp:278287 [Conf]
 Sachin B. Patkar, H. Narayanan
A Fast Algorithm for the Principle Partition of a Graph. [Citation Graph (0, 0)][DBLP] FSTTCS, 1991, pp:288306 [Conf]
 Inga Niepel, Peter Rossmanith
Uniform Circuits and Exclusive Read PRAMs. [Citation Graph (0, 0)][DBLP] FSTTCS, 1991, pp:307318 [Conf]
 Martin Fürer
Contracting Planar Graphs Efficiency in Parallel. [Citation Graph (0, 0)][DBLP] FSTTCS, 1991, pp:319335 [Conf]
 Danny Krizanc, Lata Narayanan, Rajeev Raman
Fast Deterministic Selection on MeshConnected Processor Arrays. [Citation Graph (0, 0)][DBLP] FSTTCS, 1991, pp:336346 [Conf]
 Yishay Mansour, James K. Park, Baruch Schieber
Improved Selection on Totally Monotone Arrays. [Citation Graph (0, 0)][DBLP] FSTTCS, 1991, pp:347359 [Conf]
 Christos H. Papadimitriou, P. Venkat Rangan, Martha Sideri
Designing Secure Communication Protocols from Trust Specifications. [Citation Graph (0, 0)][DBLP] FSTTCS, 1991, pp:360368 [Conf]
 Subir Kumar Gosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan
Computing the Shortest Path Tree in a Weak Visibility Polygon. [Citation Graph (0, 0)][DBLP] FSTTCS, 1991, pp:369389 [Conf]
 Binay K. Bhattacharya
Usefulness of AngleSweep over LineSweep. [Citation Graph (0, 0)][DBLP] FSTTCS, 1991, pp:390419 [Conf]
 Glynn Winskel
Petri Nets and Transition Systems (Abstract for an invited talk). [Citation Graph (0, 0)][DBLP] FSTTCS, 1991, pp:420 [Conf]
