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