Conferences in DBLP
Christiane Frougny On-Line Addition in Real Base. [Citation Graph (0, 0)][DBLP ] MFCS, 1999, pp:1-11 [Conf ] Klaus Meer Query Languages for Real Number Databases Based on Descriptive Complexity over R. [Citation Graph (0, 0)][DBLP ] MFCS, 1999, pp:12-22 [Conf ] Xizhong Zheng , Klaus Weihrauch The Arithmetical Hierarchy of Real Numbers. [Citation Graph (0, 0)][DBLP ] MFCS, 1999, pp:23-33 [Conf ] Giovanni Manzini Invited Lecture: The Burrows-Wheeler Transform: Theory and Practice. [Citation Graph (0, 0)][DBLP ] MFCS, 1999, pp:34-47 [Conf ] Leszek Gasieniec , Alan Gibbons , Wojciech Rytter Efficiency of Fast Parallel Pattern Searching in Highly Compressed Texts. [Citation Graph (0, 0)][DBLP ] MFCS, 1999, pp:48-58 [Conf ] Yann Loyer , Nicolas Spyratos , Daniel Stamate Computing and Comparing Semantics of Programs in Four-Valued Logics. [Citation Graph (0, 0)][DBLP ] MFCS, 1999, pp:59-69 [Conf ] Peter D. Mosses Foundations of Modular SOS. [Citation Graph (0, 0)][DBLP ] MFCS, 1999, pp:70-80 [Conf ] Anca Muscholl , Doron Peled Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces. [Citation Graph (0, 0)][DBLP ] MFCS, 1999, pp:81-91 [Conf ] Arnaud Durand , Miki Hermann , Laurent Juban On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System. [Citation Graph (0, 0)][DBLP ] MFCS, 1999, pp:92-102 [Conf ] George Havas , Jean-Pierre Seifert The Complexity of the Extended GCD Problem. [Citation Graph (0, 0)][DBLP ] MFCS, 1999, pp:103-113 [Conf ] Markus Lohrey Complexity Results for Confluence Problems. [Citation Graph (0, 0)][DBLP ] MFCS, 1999, pp:114-124 [Conf ] Luca Aceto , François Laroussinie Is Your Model Checker on Time? On the Complexity of Model Checking for Timed Modal Logics. [Citation Graph (0, 0)][DBLP ] MFCS, 1999, pp:125-136 [Conf ] Alexander Bolotov , Clare Dixon , Michael Fisher Clausal Resolution for CTL^{*} . [Citation Graph (0, 0)][DBLP ] MFCS, 1999, pp:137-148 [Conf ] Hardi Hungar Model Checking and Higher-Order Recursion. [Citation Graph (0, 0)][DBLP ] MFCS, 1999, pp:149-159 [Conf ] Ján Manuch Multiparty Communication Complexity: Very Hard Functions. [Citation Graph (0, 0)][DBLP ] MFCS, 1999, pp:160-169 [Conf ] Maurice Herlihy , Sergio Rajsbaum New Perspectives in Distributed Computing. [Citation Graph (0, 0)][DBLP ] MFCS, 1999, pp:170-186 [Conf ] Grzegorz Grudzinski An Improved Disjunctive Strictness Analysis for Lazy Functional Languages. [Citation Graph (0, 0)][DBLP ] MFCS, 1999, pp:187-197 [Conf ] Søren B. Lassen , Andrew Moran Unique Fixed Point Induction for McCarthy's Amb. [Citation Graph (0, 0)][DBLP ] MFCS, 1999, pp:198-208 [Conf ] Luciano Margara On Some Topological Properties of Linear Cellular Automata. [Citation Graph (0, 0)][DBLP ] MFCS, 1999, pp:209-219 [Conf ] Katsuhiko Nakamura Real-Time Language Recognition by One-Way and Two-Way Cellular Automata. [Citation Graph (0, 0)][DBLP ] MFCS, 1999, pp:220-230 [Conf ] Cyril Nicaud Average State Complexity of Operations on Unary Automata. [Citation Graph (0, 0)][DBLP ] MFCS, 1999, pp:231-240 [Conf ] Holger Petersen Fooling Rebound Automata. [Citation Graph (0, 0)][DBLP ] MFCS, 1999, pp:241-250 [Conf ] Detlef Sieling The Complexity of Minimizing FBDDs. [Citation Graph (0, 0)][DBLP ] MFCS, 1999, pp:251-261 [Conf ] Philipp Woelfel Efficient Strongly Universal and Optimally Universal Hashing. [Citation Graph (0, 0)][DBLP ] MFCS, 1999, pp:262-272 [Conf ] Wlodzimierz Glazek Lower and Upper Bounds for the Problem of Page Replication in Ring Networks. [Citation Graph (0, 0)][DBLP ] MFCS, 1999, pp:273-283 [Conf ] Dexter Kozen Language-Based Security. [Citation Graph (0, 0)][DBLP ] MFCS, 1999, pp:284-298 [Conf ] Janis Cirulis An Algebraic Approach to Knowledge Representation. [Citation Graph (0, 0)][DBLP ] MFCS, 1999, pp:299-309 [Conf ] David Janin , Giacomo Lenzi On the Structure of the Monadic Logic of the Binary Tree. [Citation Graph (0, 0)][DBLP ] MFCS, 1999, pp:310-320 [Conf ] Linh Anh Nguyen A New Space Bound for the Modal Logics K4, KD4 and S4. [Citation Graph (0, 0)][DBLP ] MFCS, 1999, pp:321-331 [Conf ] Anna Gambin On Approximating the Number of Bases of Exchange Preserving Matroids. [Citation Graph (0, 0)][DBLP ] MFCS, 1999, pp:332-342 [Conf ] Frank S. de Boer , Willem P. de Roever , Ulrich Hannemann The Semantic Foundations of a Compositional Proof Method for Synchronously Communicating Processes. [Citation Graph (0, 0)][DBLP ] MFCS, 1999, pp:343-353 [Conf ] Sibylle B. Fröschle , Thomas T. Hildebrandt On Plain and Hereditary History-Preserving Bisimulation. [Citation Graph (0, 0)][DBLP ] MFCS, 1999, pp:354-365 [Conf ] Jitka Stríbrná Approximating Weak Bisimulation on Basic Process Algebras. [Citation Graph (0, 0)][DBLP ] MFCS, 1999, pp:366-375 [Conf ] Ioannis Caragiannis , Christos Kaklamanis , Pino Persiano Edge Coloring of Bipartite Graphs with Constraints. [Citation Graph (0, 0)][DBLP ] MFCS, 1999, pp:376-386 [Conf ] Henning Fernau , Rolf Niedermeier An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover. [Citation Graph (0, 0)][DBLP ] MFCS, 1999, pp:387-397 [Conf ] Kazuhisa Makino , Yushi Uno , Toshihide Ibaraki On Minimum Edge Ranking Spanning Trees. [Citation Graph (0, 0)][DBLP ] MFCS, 1999, pp:398-409 [Conf ] Thorsten Bernholt , Alexander Gülich , Thomas Hofmeister , Niels Schmitt Football Elimination Is Hard to Decide Under the 3-Point-Rule. [Citation Graph (0, 0)][DBLP ] MFCS, 1999, pp:410-418 [Conf ] Ulrich Hertrampf Generalized Regular Counting Classes. [Citation Graph (0, 0)][DBLP ] MFCS, 1999, pp:419-429 [Conf ] Tomoyuki Yamakami A Foundation of Programming a Multi-tape Quantum Turing Machine. [Citation Graph (0, 0)][DBLP ] MFCS, 1999, pp:430-441 [Conf ] Mads Tofte A Type Discipline for Solving Year 2000 Problems in COBOL Programs. [Citation Graph (0, 0)][DBLP ] MFCS, 1999, pp:442- [Conf ] Jerzy Tiuryn Type Reconstruction for Functional Programs with Subtyping over a Lattice of Atomic Types. [Citation Graph (0, 0)][DBLP ] MFCS, 1999, pp:443-453 [Conf ]