Conferences in DBLP
Dexter Kozen Efficient Resolution of Singularities of Plane Curves. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1994, pp:1-11 [Conf ] Jean Marc Couveignes , Juan Francisco Diaz-Frias , Michel de Rougemont , Miklos Santha On the Interactive Complexity of Graph Reliability. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1994, pp:12-23 [Conf ] Martin Dietzfelbinger , Martin Hühne Matching Upper and Lower Bounds for Simulation of Several Tapes on One Multidimensional Tape. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1994, pp:24-35 [Conf ] Hervé Caussinus , François Lemieux The Complexity of Computing over Quasigroups. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1994, pp:36-47 [Conf ] Meena Mahajan , V. Vinay Non-commutative Computation, Depth Reduction, and Skew Circuits (Extended Abstract). [Citation Graph (0, 0)][DBLP ] FSTTCS, 1994, pp:48-59 [Conf ] Thierry Coquand , Peter Dybjer Inductive Definitions and Type Theory: an Introduction (Preliminary Version). [Citation Graph (0, 0)][DBLP ] FSTTCS, 1994, pp:60-76 [Conf ] Manfred Broy , Ursula Hinkel , Tobias Nipkow , Christian Prehofer , Birgit Schieder Interpreter Verification for a Functional Language. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1994, pp:77-88 [Conf ] Laks V. S. Lakshmanan An Epistemic Foundation for Logic Programming with Uncertainty. [Citation Graph (1, 0)][DBLP ] FSTTCS, 1994, pp:89-100 [Conf ] Hideki Tsuiki On Typed Calculi with a Merge Operator. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1994, pp:101-112 [Conf ] Daniele Frigioni , Alberto Marchetti-Spaccamela , Umberto Nanni Incremental Algorithms for the Single-Source Shortest Path Problem. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1994, pp:113-124 [Conf ] Srinivasa Rao Arikati , Anil Maheshwari An O(n) Algorithm for Realizing Degree Sequences. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1994, pp:125-136 [Conf ] C. R. Subramanian , C. E. Veni Madhavan Coloring Semi-Random Graphs in Polynomial Expected Time. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1994, pp:137-148 [Conf ] Wolfgang Thomas Finite-State Strategies in Regular Infinite Games. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1994, pp:149-158 [Conf ] Subhas C. Nandy , Arani Sinha , Bhargab B. Bhattacharya Location of the Largest Empty Rectangle among Arbitrary Obstacles. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1994, pp:159-170 [Conf ] Elias Dahlhaus Efficient Parallel and Linear Time Sequential Split Decomposition (Extended Abstract). [Citation Graph (0, 0)][DBLP ] FSTTCS, 1994, pp:171-180 [Conf ] Supriya Biswas , D. Chithra Prasad , Sudebkumar Prasant Pal Algorithms for Convex Visibility Problems. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1994, pp:181-192 [Conf ] Sandeep Sen Lower Bounds for Parallel Algebraic Decision Trees, Complexity of Convex Hulls and Related Problems. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1994, pp:193-204 [Conf ] Roberto M. Amadio , Sanjiva Prasad Localities and Failures (Extended Abstract). [Citation Graph (0, 0)][DBLP ] FSTTCS, 1994, pp:205-216 [Conf ] V. Natarajan , Ivan Christoff , Linda Christoff , Rance Cleaveland Priority and Abstraction in Process Algebra. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1994, pp:217-230 [Conf ] K. Narayan Kumar , Paritosh K. Pandya On the Computational Power of Operators in ICSP with Fairness. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1994, pp:231-242 [Conf ] Wang Yi , Bengt Jonsson Decidability of Timed Language-Inclusion for Networks of Real-Time Communicating Sequential Processes. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1994, pp:243-255 [Conf ] Lance Fortnow My Favorite Ten Complexity Theorems of the Past Decade. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1994, pp:256-275 [Conf ] Yuichi Kaji , Toru Fujiwara , Tadao Kasami Solving a Unification Problem under Constrained Substitutions Using Tree Automata. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1994, pp:276-287 [Conf ] R. Ramesh , I. V. Ramakrishnan , R. C. Sekar Automata-Driven Efficient Subterm Unification. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1994, pp:288-299 [Conf ] Prabhakar Raghavan Randomized Approximation Algorithms in Combinatorial Optimization. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1994, pp:300-317 [Conf ] Vivek Arora , Santosh Vempala , Huzur Saran , Vijay V. Vazirani A Limited-Backtrack Greedy Schema for Approximation Algorithms. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1994, pp:318-329 [Conf ] Pierluigi Crescenzi , Luca Trevisan On Approximation Scheme Preserving Reducability and Its Applications. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1994, pp:330-341 [Conf ] Harry B. Hunt III , Madhav V. Marathe , Venkatesh Radhakrishnan , S. S. Ravi , Daniel J. Rosenkrantz , Richard Edwin Stearns Approximation Schemes Using L-Reductions. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1994, pp:342-353 [Conf ] Ashok Subramanian An Explanation of Splaying. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1994, pp:354-365 [Conf ] Jörg Desel Proving Non-Reachabililty by Modulo-Place-Invariants. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1994, pp:366-377 [Conf ] Edgar Knapp Soundness and Completeness of UNITY Logic. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1994, pp:378-389 [Conf ] Petr Savický , Ingo Wegener Efficient Algorithms for the Transformation Betweeen Different Types of Binary Decision Diagrams. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1994, pp:390-401 [Conf ] Michael Siegel , Frank A. Stomp Extending the Limits of Sequentially Phased Reasoning. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1994, pp:402-413 [Conf ] Vladimir Estivill-Castro , Derick Wood Foundations for Faster External Sorting (Extended Abstract). [Citation Graph (1, 0)][DBLP ] FSTTCS, 1994, pp:414-425 [Conf ] John N. Hooker , V. Vinay Branching Rules for Satisfiability (Extended Abstract). [Citation Graph (0, 0)][DBLP ] FSTTCS, 1994, pp:426-437 [Conf ] Deepak Kapur , Mahadevan Subramaniam Using Linear Arithmetic Procedure for Generating Induction Schemes. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1994, pp:438-449 [Conf ]