Conferences in DBLP
Samson Abramsky Game Semantics for Programming Languages (Abstract). [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:3-4 [Conf ] László Babai Communication Complexity. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:5-18 [Conf ] Hans L. Bodlaender Treewidth: Algorithmoc Techniques and Results. [Citation Graph (1, 0)][DBLP ] MFCS, 1997, pp:19-36 [Conf ] Nachum Dershowitz When are Two Rewrite Systems More than None? [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:37-43 [Conf ] Cynthia Dwork Positive Applications of Lattices to Cryptography. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:44-51 [Conf ] Gian Luigi Ferrari , Ugo Montanari A Tile-Based Coordination View of Asynchronous pi-Calculus. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:52-70 [Conf ] Juraj Hromkovic , Georg Schnitger Communication Complexity and Sequential Compuation. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:71-84 [Conf ] Jan Krajícek Lower Bounds for a Proof System with an Expentential Speed-up over Constant-Depth Frege Systems and over Polynomial Calculus. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:85-90 [Conf ] Maciej Liskiewicz , Rüdiger Reischuk Computational Limitations of Stochastic Turing Machines and Arthur-Merlin Games with Small Space Bounds. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:91-107 [Conf ] Dan Roth Learning to Perform Knowledge-Intensive Inferences. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:108-109 [Conf ] Uwe Schöning Resolution Proofs, Exponential Bounds, and Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:110-116 [Conf ] Foto N. Afrati , Irène Guessarian , Michel de Rougemont The Expressiveness of Datalog Circuits (DAC). [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:119-128 [Conf ] Martin Mundhenk , Judy Goldsmith , Eric Allender The Complexity of Policy Evaluation for Finite-Horizon Partially-Observable Markov Decision Processes. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:129-138 [Conf ] Luca Bernardinello , Lucia Pomello A Category of Transition Systems and Its Relations with Orthomodular Posets. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:139-148 [Conf ] Béatrice Bérard , Claudine Picaronny Accepting Zeno Words Without Making Time Stand Still. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:149-158 [Conf ] Beate Bollig , Ingo Wegener Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:159-168 [Conf ] Marcello M. Bonsangue , Joost N. Kok Specifying Computations Using Hyper Transition Systems. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:169-178 [Conf ] Gianpiero Cattaneo , Enrico Formenti , Luciano Margara , Jacques Mazoyer A Shift-Invariant Metric on S^{zz} Inducing a Non-trivial Tolology. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:179-188 [Conf ] Gang Chen Subtyping Calculus of Construction (Extended Abstract). [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:189-198 [Conf ] Christian Choffrut , Giovanni Pighizzini Distances Between Languages and Reflexivity of Relations. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:199-208 [Conf ] Isabelle Ryl , Yves Roos , Mireille Clerbout Partial Characterization of Synchronization Languages. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:209-218 [Conf ] Reiko Heckel , Hartmut Ehrig , Uwe Wolter , Andrea Corradini Integrating the Specification Techniques of Graph Transformation and Temporal Logic. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:219-228 [Conf ] Frank Drewes On the Generation of Trees by Hyperedge Replacement. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:229-238 [Conf ] Henning Fernau , Ralf Stiebe Regulations by Valences. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:239-248 [Conf ] Wan Fokkink , Jaco van de Pol Simulation as a Correct Transformation of Rewrite Systems. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:249-258 [Conf ] Cyril Gavoille On the Dilation of Interval Routing. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:259-268 [Conf ] Zurab Khasidashvili , John R. W. Glauert Relating Conflict-Free Stable Transition and Event Models (Extended Abstract). [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:269-278 [Conf ] Andreas Goerdt The Giant Component Threshold for Random Regular Graphs with Edge Faults. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:279-288 [Conf ] Bernhard Heinemann A Topological Generalization of Propositional Linear Time Temporal Logic. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:289-297 [Conf ] Markus Holzer Multi-Head Finite Automata: Data-Independent Versus Data-Dependent Computations. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:299-308 [Conf ] Kazuo Iwama Complexity of Finding Short Resolution Proofs. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:309-318 [Conf ] Stasys Jukna , Alexander A. Razborov , Petr Savický , Ingo Wegener On O versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:319-326 [Conf ] Georg Karner , Werner Kuich A Characterization of Abstract Families of Algebraic Power Series. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:327-336 [Conf ] Yuji Kobayashi , Friedrich Otto Repetitiveness of D0L-Languages Is Decidable in Polynomial Time. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:337-346 [Conf ] Roman M. Kolpakov , Gregory Kucherov Minimal Letter Frequency in n-th Power-Free Binary Words. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:347-357 [Conf ] Ivan Korec Real-Time Generation of Primes by a One-Dimensional Cellular Automaton with 11 States. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:358-367 [Conf ] Drago Krznaric , Christos Levcopoulos Optimal Algorithms for Complete Linkage Clustering in d Dimensions. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:368-377 [Conf ] Giovanni Manzini , Luciano Margara Invertible Linear Cellular Automata over z_{m} : Algorithmic and Dynamical Aspects. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:378-387 [Conf ] Carlos Martín-Vide , Joan Miquel-Verges , Gheorghe Paun Two-Level Contextual Grammars: The Internal Case. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:388-397 [Conf ] Klaus Meer Counting Problems over the Reals. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:398-407 [Conf ] Christoph Meinel , Thorsten Theobald On the Influence of the State Encoding on OBDD-Representations of Finite State Machines. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:408-417 [Conf ] Raphaël Meyer , Antoine Petit Decomposition of TrPTL Formulas. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:418-427 [Conf ] Martin Mundhenk NP-Hard Sets Have Many Hard Instances. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:428-437 [Conf ] Arfst Nickelsen Deciding Verbose Languages with Linear Advice. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:438-447 [Conf ] Holger Petersen Homomorphic Images os Sentential Forms and Terminating Grammars (Extended Abstract). [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:448-457 [Conf ] Detlef Plump Simplification Orders for Term Graph Rewriting. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:458-467 [Conf ] Arend Rensink , Heike Wehrheim Dependency-Based Action Refinement. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:468-477 [Conf ] Petr Savický , Stanislav Zák A Hierarchy for (1, +k)-Branching Programs with Respect of k. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:478-487 [Conf ] Jop F. Sibeyn Routing with Finite Speeds of Memory and Network. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:488-497 [Conf ] Jerzy Tyszkiewicz Queries and Algorithms Computable by Polynomial Time Existential Reflective Machines (Extended Abstract). [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:498-507 [Conf ] Walter Vogler Partial Order Semantics and Read Arcs. [Citation Graph (0, 0)][DBLP ] MFCS, 1997, pp:508-517 [Conf ]