Conferences in DBLP
Neil Immerman Descriptive Complexity and Model Checking. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1998, pp:1-5 [Conf ] Nili Guttmann-Beck , Refael Hassin , Samir Khuller , Balaji Raghavachari Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1998, pp:6-17 [Conf ] Dimitris Fotakis , Paul G. Spirakis A Hamiltonian Approach to the Assignment of Non-reusable Frequencies. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1998, pp:18-29 [Conf ] Carolina Lavatelli Deadlock Sensitive Types for Lambda Calculus with Resources. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1998, pp:30-41 [Conf ] Paola Quaglia , David Walker On Encoding p-pi in m-pi. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1998, pp:42-53 [Conf ] Sudipto Guha , Samir Khuller Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1998, pp:54-65 [Conf ] Mahesh Kallahalla , Peter J. Varman Red-Black Prefetching: An Approximation Algorithm for Parallel Disk Scheduling. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1998, pp:66-77 [Conf ] Jean-Pierre Talpin , David Nowak A Synchronous Semantics of Higher-Order Processes for Modeling Reconfigurable Reactive Systems. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1998, pp:78-89 [Conf ] Ilaria Castellani , Matthew Hennessy Testing Theories for Asynchronous Languages. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1998, pp:90-101 [Conf ] John H. Reif Alternative Computational Models: A Comparison of Biomolecular and Quantum Computation. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1998, pp:102-121 [Conf ] Maya Madhavan , Priti Shankar Optimal Regular Tree Pattern Matching Using Pushdown Automata. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1998, pp:122-133 [Conf ] Andreas Neumann , Helmut Seidl Locating Matches of Tree Patterns in Forests. [Citation Graph (1, 0)][DBLP ] FSTTCS, 1998, pp:134-145 [Conf ] Armin Kühnemann Benefits of Tree Transducers for Optimizing Functional Programs. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1998, pp:146-157 [Conf ] Vijay K. Garg , J. Roger Mitchell Implementable Failure Detectors in Asynchronous Systems. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1998, pp:158-169 [Conf ] Erik Meineche Schmidt BRICS and Quantum Information Processing. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1998, pp:170-173 [Conf ] Devdatt P. Dubhashi Martingales and Locality in Distributed Computing. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1998, pp:174-185 [Conf ] J. Ian Munro , Venkatesh Raman , S. Srinivasa Rao Space Efficient Suffix Trees. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1998, pp:186-196 [Conf ] N. S. Pendharkar , K. Gopinath Formal Verification of an O. S. Submodule. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1998, pp:197-208 [Conf ] K. Narayan Kumar , Rance Cleaveland , Scott A. Smolka Infinite Probabilistic and Nonprobabilistic Testing. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1998, pp:209-220 [Conf ] N. Kalyana Rama Prasad , P. Sreenivasa Kumar On Generating Strong Elimination Orderings of Strongly Chordal Graphs. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1998, pp:221-232 [Conf ] Joachim Gudmundsson , Christos Levcopoulos A Parallel Approximation Algorithm for Minimum Weight Triangulation. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1998, pp:233-244 [Conf ] Luca Aceto , Patricia Bouyer , Augusto Burgueño , Kim Guldstrand Larsen The Power of Reachability Testing for Timed Automata. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1998, pp:245-256 [Conf ] Paritosh K. Pandya , Y. S. Ramakrishna Recursive Mean-Value Calculus. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1998, pp:257-268 [Conf ] Rajeev Alur Efficient Formal Verification of Hierarchical Descriptions. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1998, pp:269- [Conf ] Kenneth L. McMillan Proof Rules for Model Checking Systems with Data. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1998, pp:270- [Conf ] Michaela Huhn , Peter Niebert , Heike Wehrheim Partial Order Reductions for Bisimulation Checking. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1998, pp:271-282 [Conf ] Jürgen Bohn , Werner Damm , Orna Grumberg , Hardi Hungar , Karen Laster First-Order-CTL Model Checking. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1998, pp:283-294 [Conf ] Antoni Lozano , Vijay Raghavan On the Complexity of Counting the Number of Vertices Moved by Graph Automorphisms. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1998, pp:295-306 [Conf ] Satyanarayana V. Lokam Remarks on Graph Complexity. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1998, pp:307-318 [Conf ] Markus Lohrey On the Confluence of Trace Rewriting Systems. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1998, pp:319-330 [Conf ] Hugues Calbrix , Teodor Knapik A String-Rewriting Characterization of Muller and Schupp's Context-Free Graphs. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1998, pp:331-342 [Conf ] Petr Jancar , Frantisek Mráz , Martin Plátek , Jörg Vogel Different Types of Monotonicity for Restarting Automata. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1998, pp:343-354 [Conf ] Kamal Lodaya , Pascal Weil A Kleene Iteration for Parallelism. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1998, pp:355-366 [Conf ] Umesh V. Vazirani Quantum Computation and Information. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1998, pp:367- [Conf ]