Conferences in DBLP
Mike Paterson , Shlomit Tassa , Uri Zwick Looking for MUM and DAD: Text-Text Comparisons Do Help. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1995, pp:1-10 [Conf ] Sanjay Jain Branch and Bound on the Network Model. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1995, pp:11-21 [Conf ] Pallab Dasgupta , P. P. Chakrabarti , S. C. De Sarkar A Near Optimal Algorithm for the Extended Cow-Path Problem in the Presence of Relative Errors. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1995, pp:22-36 [Conf ] Abhik Roychoudhury , Susmita Sur-Kolay Efficient Algorithms for Vertex Arboricity of Planar Graphs. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1995, pp:37-51 [Conf ] Ajit A. Diwan , N. Usharani A Condition for the Three Colourability of Planar Locally Path Graphs. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1995, pp:52-61 [Conf ] Peter Baumann , Karl Lermer A Framework for the Specification of Reactive and Concurrent Systems in Z. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1995, pp:62-79 [Conf ] Job Zwiers , Ulrich Hannemann , Yassine Lakhnech , Willem P. de Roever Synthesizing Different Development Paradigms: Combining Top-Down with Bottom-Up Reasoning About Distributed Systems. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1995, pp:80-95 [Conf ] Jozef Hooman Verifying Part of the ACCESS.bus Protocol Using PVS. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1995, pp:96-110 [Conf ] Luigi Petrone Reusing Batch Parsers as Incremental Parsers. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1995, pp:111-123 [Conf ] Prakash Panangaden The Expressive Power of Indeterminate Primitives in Asynchronous Computation. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1995, pp:124-150 [Conf ] Jacques Garrigue The Transformation Calculus. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1995, pp:151-165 [Conf ] Jerzy Tiuryn Equational Axiomatization of Bicoercibility for Polymorphic Types. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1995, pp:166-179 [Conf ] Michel Raynal , André Schiper From Causal Consistency to Sequential Consistency in Shared Memory Systems. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1995, pp:180-194 [Conf ] Alexander I. Tomlinson , Vijay K. Garg Observation of Software for Distributed Systems with RCL. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1995, pp:195-209 [Conf ] Nick D. Dendris , Lefteris M. Kirousis , Yannis C. Stamatiou , Dimitrios M. Thilikos Partiality and Approximation Schemes for Local Consistency in Networks of Constraints. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1995, pp:210-224 [Conf ] Deepak Kapur , G. Sivakumar Maximal Extensions os Simplification Orderings. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1995, pp:225-239 [Conf ] Rainer Schuler Average Polynominal Time Is Hard for Exponential Time Under sn-Reductions. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1995, pp:240-247 [Conf ] Ravi Kumar , D. Sivakumar On Self-Testing without the Generator Bottleneck. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1995, pp:248-262 [Conf ] Mogens Nielsen , Allan Cheng Obseving Behaviour Categorically. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1995, pp:263-278 [Conf ] Paul Caspi , Jean-Claude Fernandez , Alain Girault An Algorithm for Reducing Binary Branchings. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1995, pp:279-293 [Conf ] Michele Boreale , Luca Trevisan On the Complexity of Bisimilarity for Value-Passing Processes (Extended Abstract). [Citation Graph (0, 0)][DBLP ] FSTTCS, 1995, pp:294-308 [Conf ] Ashvin Dsouza , Bard Bloom On the Expressive Power of CCS. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1995, pp:309-323 [Conf ] Martin Odersky Polarized Name Passing. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1995, pp:324-337 [Conf ] R. Balasubramanian , Venkatesh Raman Path Balance Heuristic for Self-Adjusting Binary Search Trees. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1995, pp:338-348 [Conf ] S. Rao Kosaraju Pattern Matching in Compressed Texts. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1995, pp:349-362 [Conf ] Srinivasa Rao Arikati , Shiva Chaudhuri , Christos D. Zaroliagis All-Pairs Min-Cut in Sparse Networks. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1995, pp:363-376 [Conf ] Sandip K. Biswas , Sampath Kannan Minimizing Space Usage in Evaluation of Expression Trees. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1995, pp:377-390 [Conf ] Herbert Edelsbrunner Smooth Surfaces for Multi-Scale Shape Representation. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1995, pp:391-412 [Conf ] Christos Levcopoulos , Andrzej Lingas , Cao Wang On Parallel Complexity of Planar Triangulations. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1995, pp:413-427 [Conf ] Frank Follert , Elmar Schömer , Jürgen Sellen , Michiel H. M. Smid , Christian Thiel Computing a Largest Empty Anchored Cylinder, and Related Problems. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1995, pp:428-442 [Conf ] Drago Krznaric , Christos Levcopoulos Computing Hierarchies of Clusters from the Euclidean Minimum Spanning Tree in Linear Time. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1995, pp:443-455 [Conf ] Nils Klarlund , Madhavan Mukund , Milind A. Sohoni Determinizing Büchi Asnchronous Automata. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1995, pp:456-470 [Conf ] Eugene Asarin , Oded Maler Achilles and the Tortoise Climbing Up the Arithmetical Hierarchy. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1995, pp:471-483 [Conf ] Anca Browne , Zohar Manna , Henny Sipma Generalized Temporal Verification Diagrams. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1995, pp:484-498 [Conf ] Andrea Bianco , Luca de Alfaro Model Checking of Probabalistic and Nondeterministic Systems. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1995, pp:499-513 [Conf ]