Conferences in DBLP
Claus-Peter Schnorr Refined Analysis and Improvements on Some Factoring Algorithms. [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:1-15 [Conf ] Joos Heintz , Malte Sieveking Absolute Primality of Polynomials is Decidable in Random Polynomial Time in the Number of Variables. [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:16-28 [Conf ] Franco P. Preparata , Jean Vuillemin Area-Time Optimal VLSI Networks for Computing Integer Multiplications and Discrete Fourier Transform. [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:29-40 [Conf ] Jia-Wei Hong , Kurt Mehlhorn , Arnold L. Rosenberg Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version). [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:41-55 [Conf ] John H. Reif Minimum S-T Cut of a Planar Undirected Network in O(n log²(n)) Time. [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:56-67 [Conf ] Emo Welzl On the Density of Color-Families. [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:68-72 [Conf ] Catriel Beeri , Moshe Y. Vardi The Implication Problem for Data Dependencies. [Citation Graph (9, 0)][DBLP ] ICALP, 1981, pp:73-85 [Conf ] Johann A. Makowsky Characterizing Data Base Dependencies. [Citation Graph (4, 0)][DBLP ] ICALP, 1981, pp:86-97 [Conf ] Micha Sharir Data Flow Analysis of Applicative Programs. [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:98-113 [Conf ] Neil D. Jones Flow Analysis of Lambda Expressions (Preliminary Version). [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:114-128 [Conf ] Jacques Loeckx Algorithmic Specifications of Abstract Data Types. [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:129-147 [Conf ] P. A. Subrahmanyam Nondeterminism in Abstract Data Types. [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:148-164 [Conf ] Jeffrey D. Ullman A View of Directions in Relational Database Theory. [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:165-176 [Conf ] Christophe Reutenauer A New Characterization of the Regular Languages. [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:177-183 [Conf ] Jean-Eric Pin Languages reconnaissables et codage prefixe pur. [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:184-192 [Conf ] Joost Engelfriet , Gilberto Filé Passes, Sweeps and Visits. [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:193-207 [Conf ] Seppo Sippu , Eljas Soisalon-Soininen On LALR(1) Testing. [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:208-217 [Conf ] Esko Ukkonen On Size Bounds for Deterministic Parsers. [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:218-228 [Conf ] Yair Itzhaik , Amiram Yehudai A Decision Procedure for the Equivalence of Two DPDAs, One of Which is Linear (Extended Abstract). [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:229-237 [Conf ] Albert R. Meyer , Robert S. Streett , Grazyna Mirkowska The Deducibility Problem in Propositional Dynamic Logic. [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:238-248 [Conf ] Mordechai Ben-Ari , Joseph Y. Halpern , Amir Pnueli Finite Models for Deterministic Propositional Dynamic Logic. [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:249-263 [Conf ] Daniel J. Lehmann , Amir Pnueli , Jonathan Stavi Impartiality, Justice and Fairness: The Ethics of Concurrent Termination. [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:264-277 [Conf ] Aviezri S. Fraenkel , David Lichtenstein Computing a Perfect Strategy for n*n Chess Requires Time Exponential in N. [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:278-293 [Conf ] Oscar H. Ibarra , Brian S. Leininger , Shlomo Moran On the Complexity of Simple Arithmetic Expressions. [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:294-304 [Conf ] Marc Snir Proving Lower Bounds for Linar Decision Trees. [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:305-315 [Conf ] Meera Blattner , Michel Latteux Parikh-Bounded Languages. [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:316-323 [Conf ] Juhani Karhumäki Generalized Parikh Mappings and Homomorphisms. [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:324-332 [Conf ] Sorin Istrail Chomsky-Schützenberger Representations for Families of Languages and Grammatical Types. [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:333-347 [Conf ] Jan A. Bergstra , J. V. Tucker Algebraically Specified Programming Systems and Hoare's Logic. [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:348-362 [Conf ] Mark Moriconi , Richard L. Schwartz Automatic Construction of Verification Condition Generators From Hoare Logics. [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:363-377 [Conf ] Ravi Sethi Circular Expressions: Elimination of Static Environments. [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:378-392 [Conf ] Bruno Courcelle An Axiomatic Approach to the Korenjak-Hopcroft Algorithms. [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:393-407 [Conf ] Andrzej Ehrenfeucht , Grzegorz Rozenberg On the (Generalized) Post Correspondence Problem with Lists of Length 2. [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:408-416 [Conf ] Alon Itai , Alan G. Konheim , Michael Rodeh A Sparse Table Implementation of Priority Queues. [Citation Graph (1, 0)][DBLP ] ICALP, 1981, pp:417-431 [Conf ] Alberto Pettorossi Comparing and Putting Together Recursive Path Ordering, Simplification Orderings and Non-Ascending Property for Termination Proofs of Term Rewriting Systems. [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:432-447 [Conf ] Nachum Dershowitz Termination of Linear Rewriting Systems (Preliminary Version). [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:448-458 [Conf ] Amir Pnueli , R. Zarhi Realizing an Equational Specification. [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:459-478 [Conf ] Krzysztof R. Apt , Gordon D. Plotkin A Cook's Tour of Countable Nondeterminism. [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:479-494 [Conf ] Eitan M. Gurari , Oscar H. Ibarra The Complexity of Decision Problems for Finite-Turn Multicounter Machines. [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:495-505 [Conf ] K. N. King Alternating Multihead Finite Automata (Extended Abstract). [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:506-520 [Conf ] Judea Pearl The Solution for the Branching Factor of the Alpha-Beta Pruning Algorithm. [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:521-529 [Conf ] Karl J. Lieberherr Uniform Complexity and Digital Signatures. [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:530-543 [Conf ] Adi Shamir On the Generation of Cryptographically Strong Pseudo-Random Sequences. [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:544-550 [Conf ] Johann A. Makowsky Errata: Measuring the Expressive Power of Dynamic Logics: An Application of Abstract Model Theory. [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:551- [Conf ]