• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 31 matches

• 1990
• 
  Anish Arora, Mohamed G. Gouda:
  Distributed Reset (Extended Abstract). FSTTCS 1990: 316-331
• 
  Akshar Bharati, Rajeev Sangal, Vineet Chaitanya:
  Natural Language Processing, Complexity Theory and Logic (Extended Abstract). FSTTCS 1990: 410-420
• 
  John Case, Dayanand S. Rajan, Anil M. Shende:
  Optimally Representing Euclidean Space Discretely for Analogically Simulating Physical Phenomena. FSTTCS 1990: 190-203
• 
  B. Chandrasekaran, N. Hari Narayanan:
  Towards a Theory of Commonsense Visual Reasoning. FSTTCS 1990: 388-409
• 
  Karel Culík II, Simant Dube:
  Automata-Theoretic Techniques for Image Generation and Compression. FSTTCS 1990: 76-90
• 
  Amitava Datta, G. D. S. Ramkumar:
  On Some Largest Empty Orthoconvex Polygons in a Point Set. FSTTCS 1990: 270-285
• 
  Jyh-Jong Fu, Richard C. T. Lee:
  Voronoi Diagrams of Moving Points in the Plane. FSTTCS 1990: 238-254
• 
  Peter Grønning, Thomas Qvist Nielsen, Hans Henrik Løvengreen:
  Refinement and Composition of Transition-based Rely-Guarantee Specification with Auxiliary Variables. FSTTCS 1990: 332-348
• 
  Tien Huynh, Leo Joskowicz, Catherine Lassez, Jean-Louis Lassez:
  Reasoning About Linear Constraints Using Parametric Queries. FSTTCS 1990: 1-20
• 
  Tong-Ying Tony Juang, Subbarayan Venkatesan:
  Efficient Algorithms for Crash Recovery in Distributed Systems. FSTTCS 1990: 349-361
• 
  Deepak Kapur, G. Sivakumar, Hantao Zhang:
  A New Method for Proving Termination of AC-Rewrite Systems. FSTTCS 1990: 133-148
• 
  S. Rao Kosaraju:
  On Parallel Evaluation of Classes of Circuits. FSTTCS 1990: 232-237
• 
  Marta Z. Kwiatkowska:
  Defining Process Fairness for Non-Interleaving Concurrency. FSTTCS 1990: 286-300
• 
  Christos Levcopoulos, Andrzej Lingas, Ola Petersson, Wojciech Rytter:
  Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar Graphs. FSTTCS 1990: 204-214
• 
  Christopher P. Lewington:
  Towards Constructive Program Derivation in VDM. FSTTCS 1990: 115-132
• 
  Rong Lin, Stephan Olariu:
  Fast Parallel Algorithms for Cographs. FSTTCS 1990: 176-189
• 
  M. Masseron, Christophe Tollu, Jacqueline Vauzeilles:
  Generating Plans in Linear Logic. FSTTCS 1990: 63-75
• 
  Subhas C. Nandy, Bhargab B. Bhattacharya, Sibabrata Ray:
  Efficient algorithms for Identifying All Maximal Isothetic Empty Rectangles in VLSI Layout Design. FSTTCS 1990: 255-269
• 
  Rocco De Nicola, Gian-Luigi Ferrari:
  Observational Logics and Concurrency Models. FSTTCS 1990: 301-315
• 
  David Pearson, Vijay V. Vazirani:
  A Fast Parallel Algorithm for Finding a Maximal Bipartite Set. FSTTCS 1990: 225-231
• 
  Sanguthevar Rajasekaran:
  Randomized Parallel Selection. FSTTCS 1990: 215-224
• 
  Rajeev Raman:
  The Power of Collision: Randomized Parallel Algorithms for Chaining and Integer Sorting. FSTTCS 1990: 161-175
• 
  Gianna Reggio:
  A Non-Standard Inductive Semantics. FSTTCS 1990: 362-372
• 
  John H. Reif, Akhilesh Tyagi:
  Efficient Parallel Algorithms for Optical Computing with the DFT Primitive. FSTTCS 1990: 149-160
• 
  Abdellatif Saoudi:
  Recognizable Infinite Tree Sets and their Complexity. FSTTCS 1990: 91-103
• 
  Kurt Sieber:
  Relating Full Abstraction Results for Different Programming Languages. FSTTCS 1990: 373-387
• 
  Ramesh Subrahmanyam:
  Complexity of Algebraic Specification. FSTTCS 1990: 33-37
• 
  Ralf Treinen:
  A New Method for Undecidability Proofs of First Order Theories. FSTTCS 1990: 48-62
• 
  V. Vinay, V. Chandru:
  The Expressibility of Nondeterministic Auxiliary Stack Automata and its Relation to Treesize Bounded Alternating Auxiliary Pushdown Automata. FSTTCS 1990: 104-114
• 
  Li-Yan Yuan, Jia-Huai You:
  Discriminant Circumscription. FSTTCS 1990: 21-32

skipping 1 more match