Conferences in DBLP
Herbert Edelsbrunner Key-Problems and Key-Methods in Computational Geormetry. [Citation Graph (0, 0)][DBLP ] Conf ] Jean Berstel Some Recent Results on Squarefree Words. [Citation Graph (0, 0)][DBLP ] Conf ] Krzysztof R. Apt , Ernst-Rüdiger Olderog Transformations Realizing Fairness Assumptions for Parallel Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Bernard Chazelle , Robert L. (Scot) Drysdale III , D. T. Lee Computing the Largest Empty Rectangle. [Citation Graph (0, 0)][DBLP ] Conf ] Dorit S. Hochbaum , Wolfgang Maass Approximation Schemes for Covering and Packing Problems in Robotics and VLSI. [Citation Graph (0, 0)][DBLP ] Conf ] Christos Levcopoulos , Andrzej Lingas Covering Polygons with Minimum Number of Rectangles. [Citation Graph (0, 0)][DBLP ] Conf ] Bernhard Josko On Expressive Interpretations of a Hoare-Logic for Clarke's Language L4. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Drosten Towards Executable Specifications Using Conditional Axioms. [Citation Graph (0, 0)][DBLP ] Conf ] H. Perdrix Proprietes Church-Rosser de systemes de reecriture equationnels ayant la propriete de terminaison faible. [Citation Graph (0, 0)][DBLP ] Conf ] Rainer Kemp On a General Weight of Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Eli Shamir From Expanders to Better Superconcentrators without Cascading. [Citation Graph (0, 0)][DBLP ] Conf ] Edward G. Belaga Locally Synchronous Complexity in the Light of the Trans-Box Method. [Citation Graph (0, 0)][DBLP ] Conf ] Glynn Winskel A New Definition of Morphism on Petri Nets. [Citation Graph (0, 0)][DBLP ] Conf ] Alain Finkel Blocage et vivacité dans les réseaux a pile-file. [Citation Graph (0, 0)][DBLP ] Conf ] Manfred Broy Denotational Semantics of Concurrent Programs with Shared Memory. [Citation Graph (0, 0)][DBLP ] Conf ] Axel Poigné Higher Order Data Structures: Cartesian Closure Versus Lambda-Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Giuseppe Longo , Simone Martini Computability in Higher Types and the Universal Domain P_omega. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Ambos-Spies On the Structure of Polynomial Time Degrees. [Citation Graph (0, 0)][DBLP ] Conf ] Ondrej Sýkora , Imrich Vrto Optimal Layouts of the Tree of Meshes with Vertices on the Perimeter of the Bounding Convex Region. [Citation Graph (0, 0)][DBLP ] Conf ] Friedhelm Meyer auf der Heide Efficient Simulations among Several Models of Parallel Computers. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Jacques Pansiot Bornes inferieures sur la complexite des facteurs des mots infinis engendres par morphimes iteres. [Citation Graph (0, 0)][DBLP ] Conf ] Tom Head Adherence Equivalence Is Decidable for DOL Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Joaquim Gabarró Pushdown Space Complexity and Related Full-AFLs. [Citation Graph (0, 0)][DBLP ] Conf ] Jeanne Idt Automates a pile sur des alphabets infinis. [Citation Graph (0, 0)][DBLP ] Conf ] Alan Mycroft Logic Programs and Many-Valued Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Max Michel Algebre de machines et logique temporelle. [Citation Graph (0, 0)][DBLP ] Conf ] John Rhodes Algebraic and Topological Theory of Languages and Computation, Part I: Theorems for Arbitrary Labguages Generalizing the Theorems of Eilenberg, Kleene, Schützenberger and Straubing. [Citation Graph (0, 0)][DBLP ] Conf ] Juhani Karhumäki A Property of Three-Element Codes. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus P. Jantke Polynomial Time Inference of General Pattern Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Choffrut , Karel Culik II On Extendibility of Unavoidable Sets. [Citation Graph (0, 0)][DBLP ] Conf ] 