Conferences in DBLP
Jon Louis Bentley , Thomas Ottmann The Complexity of Manipulating Hierarchically Defined Sets of Rectangles. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:1-15 [Conf ] Andrei P. Ershov The Transformational Machine: Theme and Variations. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:16-32 [Conf ] Rusins Freivalds Probabilistic Two-Way Machines. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:33-45 [Conf ] Deborah Joseph , Paul Young A Survey of Some Recent Results on Computational Complexity in Weak Theories of Arithmetic. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:46-60 [Conf ] Bernhard Korte , Rainer Schrader A Survey on Oracle Techniques. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:61-77 [Conf ] Burkhard Monien , Ivan Hal Sudborough Time and Space Bounded Complexity Classes and Bandwidth Constrained Problems (A Survey). [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:78-93 [Conf ] Jaroslav Nesetril Representations of Graphs by Means of Products and Their Complexity. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:94-102 [Conf ] Anton Nijholt Parsing Strategies: A Concise Survey (Preliminary Report). [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:103-120 [Conf ] Jan van Leeuwen , Mark H. Overmars The Art of Dynamizing. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:121-131 [Conf ] Leslie G. Valiant , Sven Skyum Fast Parallel Computation of Polynomials Using Few Processes. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:132-139 [Conf ] Rüdiger Valk Generalizations of Petri Nets. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:140-155 [Conf ] Helmut Alt , Kurt Mehlhorn , J. Ian Munro Partial Match Retrieval in Implicit Data Structures. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:156-161 [Conf ] Hajnal Andréka , István Németi , Ildikó Sain A Characterization of Floyd-Provable Programs. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:162-171 [Conf ] Egidio Astesiano , Elena Zucca Semantics of CSP via Translation into CCS. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:172-182 [Conf ] Joffroy Beauquier , Jean Berstel More about the ``Geography'' of Context-Free Languages. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:183-192 [Conf ] Jan A. Bergstra , Manfred Broy , J. V. Tucker , Martin Wirsing On the Power of Algebraic Specifications. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:193-204 [Conf ] Alberto Bertoni , M. Brambilla , Giancarlo Mauri , Nicoletta Sabadini An Application of the Theory of Free Partially Commutative Monoids: Asymptotic Densities of Trace Languages. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:205-215 [Conf ] Ronald V. Book , Matthias Jantzen , Burkhard Monien , Colm Ó'Dúnlaing , Celia Wrathall On the Complexity of Word Problems in Certain Thue Systems (Preliminary Report). [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:216-223 [Conf ] Franz-Josef Brandenburg On the Tranformation of Derivation Graphs to Derivation Trees (Preliminary Report). [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:224-233 [Conf ] Andreas Brandstädt Pushdown Automata with Restricted Use of Storage Symbols. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:234-241 [Conf ] Ludmila Cherkasova , Vadim E. Kotov Structured Nets. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:242-251 [Conf ] Robert P. Daley Retraceability, Repleteness and Busy Beaver Sets. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:252-261 [Conf ] Werner Damm , Irène Guessarian Combining T and level-N. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:262-270 [Conf ] Hans-Dieter Ehrich On Realization and Implementation. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:271-280 [Conf ] Dima Grigoriev Multiplicative Complexity of a Bilinear Form over a Commutative Ring. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:281-286 [Conf ] Petr Hájek Making Dynamic Logic First-Order. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:287-295 [Conf ] J. Horejs Partial Interpretations of Program Schemata. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:296-303 [Conf ] Juraj Hromkovic Closure Properties of the Family of Languages Recognized by One-Way Two-Head Deterministic Finite State Automata. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:304-313 [Conf ] Ladislav Janiga Another Hierarchy Defined by Multihead Finite Automata. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:314-320 [Conf ] Jerzy W. Jaromczyk An Extension of Rabin's Complete Proof Concept. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:321-326 [Conf ] Kurt Jensen How to Find Invariants for Coloured Petri Nets. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:327-338 [Conf ] H. Jung Relationships between Probabilistic and Deterministic Tape Complexity. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:339-346 [Conf ] Alica Kelemenová Grammatical Levels of the Position Restricted Grammars. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:347-359 [Conf ] H. C. M. Kleijn , Grzegorz Rozenberg A General Framework for Comparing Sequential and Parallel Rewriting. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:360-368 [Conf ] Walter Knödel A Bin Packing Algorithm with Complexity O(n log n) and Performance 1 in the Stochastic Limit. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:369-378 [Conf ] Ivan Korec Codings of Nonnegative Integers. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:379-388 [Conf ] Václav Koubek , Antonín Ríha The Maximum k-Flow in a Network. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:389-397 [Conf ] Hans-Jörg Kreowski , Grzegorz Rozenberg On the Constructive Description of Graph Languages Accepted by Finite Automata. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:398-409 [Conf ] Hans-Peter Kriegel , Vijay K. Vaishnavi Weighted Multidimensional B-trees Used as Nearly Optimal Dynamic Dictionaries. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:410-417 [Conf ] Ludek Kucera Maximum Flow in Planar Networks. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:418-422 [Conf ] Karl J. Lieberherr Probabilistic Combinatorial Optimization. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:423-432 [Conf ] Friedhelm Meyer auf der Heide Time-Processor Trade-offs for Universal Parallel Computers. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:433-441 [Conf ] Jan Pittl Negative Results on the Size of Deterministic Right Parsers. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:442-451 [Conf ] Jaroslav Pokorný Key-Equivalence of Functional Dependency Statements Systems. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:452-462 [Conf ] Jan Reiterman , Vera Trnková On Representations of Dynamic Algebras with Reversion. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:463-472 [Conf ] Branislav Rovan A Framework for Studying Grammars. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:473-482 [Conf ] Vladimir Yu. Sazonov On Existence of Complete Predicate Calculus in Metamathematics without Exponentiation. [Citation Graph (1, 0)][DBLP ] MFCS, 1981, pp:483-490 [Conf ] Eljas Soisalon-Soininen , Derick Wood On Structural Similarity of Context-Free Grammars. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:491-498 [Conf ] Stefan Sokolowski Axioms for the Term-Wise Correctness of Programs. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:499-507 [Conf ] Ludwig Staiger Complexity and Entropy. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:508-514 [Conf ] Juraj Steiner Axiomatic Semantics of Indirect Addressing. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:515-523 [Conf ] Katsumi Tanaka , Yahiko Kambayashi Testing of Join Dependency Preserving by a Modified Chase Method. [Citation Graph (1, 0)][DBLP ] MFCS, 1981, pp:524-533 [Conf ] Horst Wedde A Starvation-Free Solution of the Dining Philosopher's Problem by Use of Interaction Systems. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:534-543 [Conf ] Klaus Weihrauch , Gisela Schäfer Admissible Representations of Effective CPO's. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:544-553 [Conf ] Juraj Wiedermann Preserving Total Order in Constant Expected Time. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:554-562 [Conf ] Akira Kanda Constructive Category Theory (No. 1). [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:563-577 [Conf ] Lothar Budach Two Pebbles Don't Suffice. [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:578-589 [Conf ]