Conferences in DBLP
Andrzej Ehrenfeucht , Grzegorz Rozenberg On the Subword Complexity and Square-Freeness of Formal Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Werner Kuich Cycle-Free N-Algebraic Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Franz-Josef Brandenburg On the Height of Syntactical Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Ingo Wegener Boolean Functions Whose Monotone Complexity is of Size n2 /log n. [Citation Graph (0, 0)][DBLP ] Conf ] Jürgen Sattler Netzwerke zur simultanen Berechnung Boolescher Funktionen. [Citation Graph (0, 0)][DBLP ] Conf ] Jürgen Avenhaus , Klaus Madlener P-Complete Problems in Free Groups. [Citation Graph (0, 0)][DBLP ] Conf ] Michel Latteux Quelques propriétés des langages à un Comptuer. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Michel Autebert Un resultat de discontinuité dans les familles de langages. [Citation Graph (0, 0)][DBLP ] Conf ] Ioannis Keklikoglou Verallgemeinerte kommutative Sprachen. [Citation Graph (0, 0)][DBLP ] Conf ] Günter Hotz Ein rein automatentheoretischer Aufbau der Theorie der kontext-freien Sprachen. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Eric Pin Un analogue du théorème des variétés pour les cones et les cylindres. [Citation Graph (0, 0)][DBLP ] Conf ] Georg Schnitger A Family of Graphs with Expensive Depth-Reduction. [Citation Graph (0, 0)][DBLP ] Conf ] Henk J. Olivié On alpha-balanced Binary Search Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Reiner Güttler Erzeugung optimalen Codes für Series - Parallel Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] John E. Hopcroft Recent Directions in Algorithmic Research. [Citation Graph (0, 0)][DBLP ] Conf ] Ralf Hartmut Güting , Hans-Peter Kriegel Dynamic k-Dimensional Multiway Search under Time-Varying Access Frequencies. [Citation Graph (0, 0)][DBLP ] Conf ] Luc Boasson Some Applications of CFL's over Infinte Alphabets. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Jacques Pansiot A Decidable Property of Iterated Morphisms. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Choffrut Prefix-Preservation fo Rational Partial Functions Is Decidable. [Citation Graph (0, 0)][DBLP ] Conf ] David Park Concurrency and Automata on Infinite Sequences. [Citation Graph (0, 0)][DBLP ] Conf ] Bernhard Josko An Effective Retract Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Weihrauch Recursion and Complexity Theory on CPO-S. [Citation Graph (0, 0)][DBLP ] Conf ] Herbert Klaeren , Martin Schulz Computable Algebras, Word Problems and Canonical Term Algebras. [Citation Graph (0, 0)][DBLP ] Conf ] Horst Müller Reachability Analysis with Assertion Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Mark H. Overmars , Jan van Leeuwen Dynamization of Decomposable Searching Problems Yielding Good Worsts-Case Bounds. [Citation Graph (0, 0)][DBLP ] Conf ] Scott Huddleston , Kurt Mehlhorn Robust Balancing in B-Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Luc Boasson , Maurice Nivat Centers of Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Ronald V. Book , Matthias Jantzen , Celia Wrathall (Erasing)* Strings. [Citation Graph (0, 0)][DBLP ] Conf ] 