Journals in DBLP
Acta Inf. Edsger W. Dijkstra Some Beautiful Arguments Using Mathematical Induction. [Citation Graph (0, 0)][DBLP ] Journal ] Christoph M. Hoffmann Semantic Properties of Lucid's Compute Clause and its Compilation. [Citation Graph (0, 0)][DBLP ] Journal ] Philip Heidelberger Variance Reduction Techniques for the Simulation of Markov Process. [Citation Graph (0, 0)][DBLP ] Journal ] Gaston H. Gonnet , Lawrence D. Rogers , J. Alan George An Algorithmic and Complexity Analysis of Interpolation Search. [Citation Graph (3, 0)][DBLP ] Journal ] Zvi Galil Applications of Efficient Mergeable Heaps for Optimization Problems on Trees. [Citation Graph (0, 0)][DBLP ] Journal ] Stefan Reisch Gobang ist PSPACE-vollständig. [Citation Graph (0, 0)][DBLP ] Journal ] Jörg H. Siekmann , Graham Wrightson Paramodulated Connection Graphs. [Citation Graph (0, 0)][DBLP ] Journal ] Hermann A. Maurer , Arto Salomaa , Derick Wood On Generators and Generative Capacity of EOL Forms. [Citation Graph (0, 0)][DBLP ] Journal ] Ingo Wegener A new Lower Bound on the Monotone Network Complexity of Boolean Sums. [Citation Graph (0, 0)][DBLP ] Journal ] Johannes Röhrich Methods for the Automatic Construction of Error Correcting Parsers. [Citation Graph (0, 0)][DBLP ] Journal ] Charles N. Fischer , D. R. Milton , S. B. Quiring Efficient LL(1) Error Correction and Recovery Using Only Insertions. [Citation Graph (0, 0)][DBLP ] Journal ] Jon Louis Bentley , Hermann A. Maurer Efficient Worst-Case Data Structures for Range Searching. [Citation Graph (5, 0)][DBLP ] Journal ] Edmund M. Clarke Proving Correctness of Coroutines Without History Variables. [Citation Graph (0, 0)][DBLP ] Journal ] Christophe Reutenauer An Ogden-Like Iteration Lemma for Rational Power Series. [Citation Graph (0, 0)][DBLP ] Journal ] Chandra M. R. Kintala , Detlef Wotschke Amounts of Nondeterminism in Finite Automata. [Citation Graph (0, 0)][DBLP ] Journal ] Frank Wm. Tompa A Practical Example of the Specification of Abstract Data Types. [Citation Graph (1, 0)][DBLP ] Journal ] David R. Barstow Remarks on "A Synthesis of Several Sorting Algorithms" by John Darlington. [Citation Graph (0, 0)][DBLP ] Journal ] Uwe Kastens Ordered Attributed Grammars. [Citation Graph (0, 0)][DBLP ] Journal ] Grzegorz Rozenberg , Derick Wood Context-Free Grammars With Selective Rewriting. [Citation Graph (0, 0)][DBLP ] Journal ] Hans Kleine Büning , Lutz Priese Universal Asynchronous Iterative Arrays of Mealy Automata. [Citation Graph (0, 0)][DBLP ] Journal ] Hans-Anton Rollik Automaten in planaren Graphen. [Citation Graph (0, 0)][DBLP ] Journal ] William R. Franta , Mark Benedict Bilodeau Analysis of a Prioritized CSMA Protocol Based on Staggered Delays. [Citation Graph (0, 0)][DBLP ] Journal ] Alfs T. Berztiss Depth-First K-Trees and Critical Path Analysis. [Citation Graph (0, 0)][DBLP ] Journal ] Michel Latteux Sur les générateurs algébriques et linéaires. [Citation Graph (0, 0)][DBLP ] Journal ] Hermann A. Maurer , Maurice Nivat Rational Bijection of Rational Sets. [Citation Graph (0, 0)][DBLP ] Journal ] Susumu Morito , Harvey M. Salkin Using the Blankinship Algorithm to Find the General Solution of a Linear Diophantine Equation. [Citation Graph (0, 0)][DBLP ] Journal ] Bernhard Mescheder On the Number of Active-Operations Needed to Compute the Discrete Fourier Transform. [Citation Graph (0, 0)][DBLP ] Journal ] 