default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM Journal on Computing, Volume 13
Volume 13, Number 1, February 1984
- Arie de Bruin:
On the Existence of Cook Semantics. 1-13 - Greg N. Frederickson, Donald B. Johnson:
Generalized Selection and Ranking: Sorted Matrices. 14-30 - Martin E. Dyer
:
Linear Time Algorithms for Two- and Three-Variable Linear Programs. 31-45 - John H. Reif:
On Synchronous Parallel Computations with Independent Probabilistic Choice. 46-56 - Norman J. Pullman:
Clique Covering of Graphs IV. Algorithms. 57-75 - Catriel Beeri, Moshe Y. Vardi:
Formal Systems for Tuple and Equality Generating Dependencies. 76-98 - Stavros S. Cosmadakis, Christos H. Papadimitriou:
The Traveling Salesman Problem with Many Visits to Few Cities. 99-108 - Udi Manber, Martin Tompa:
The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem. 109-115 - Dah-Ming W. Chiu, Philip A. Bernstein, Yu-Chi Ho:
Optimizing Chain Queries in a Distributed Database System. 116-134 - Richard E. Ladner, Richard J. Lipton, Larry J. Stockmeyer:
Alternating Pushdown and Stack Automata. 135-155 - Maria M. Klawe:
Limitations on Explicit Constructions of Expanding Graphs. 156-166 - Prakash V. Ramanan:
Pushdown Permuter Characterization Theorem. 167-169 - Donald K. Friesen:
Tighter Bounds for the Multifit Processor Scheduling Algorithm. 170-181 - Nimrod Megiddo, Kenneth J. Supowit:
On the Complexity of Some Common Geometric Location Problems. 182-196 - Thomas Ottmann, Douglas Stott Parker Jr., Arnold L. Rosenberg, Hans-Werner Six, Derick Wood:
Minimal-Cost Brother Trees. 197-217
Volume 13, Number 2, May 1984
- Pavol Duris, Zvi Galil:
Two Tapes are Better than One for Nondeterministic Machines. 219-227 - T. C. Hu, M. T. Shing:
Computation of Matrix Chain Products. Part II. 228-251 - J. M. Robson:
N by N Checkers is Exptime Complete. 252-267 - Dario Bini:
Parallel Solution of Certain Toeplitz Linear Systems. 268-276 - Greg N. Frederickson:
Self-Organizing Heuristics for Implicit Data Structures. 277-291 - Micha Sharir, Amir Pnueli, Sergiu Hart:
Verification of Probabilistic Programs. 292-314 - Sunita Agarwal, A. K. Mittal, Prabha Sharma:
Constrained Optimum Communication Trees and Sensitivity Analysis. 315-328 - Uwe Schöning, Ronald V. Book:
Immunity, Relativizations, and Nondeterminism. 329-337 - Dov Harel, Robert Endre Tarjan:
Fast Algorithms for Finding Nearest Common Ancestors. 338-355 - Etienne Grandjean:
The Spectra of First-Order Sentences and Computational Complexity. 356-373 - Robert Cartwright:
Recursive Programs as Definitions in First Order Logic. 374-408 - Larry J. Stockmeyer, Uzi Vishkin:
Simulation of Parallel Random Access Machines by Circuits. 409-422 - Ashok K. Chandra, Larry J. Stockmeyer, Uzi Vishkin:
Constant Depth Reducibility. 423-439
Volume 13, Number 3, August 1984
- Ernst W. Mayr:
An Algorithm for the General Petri Net Reachability Problem. 441-460 - Ronald V. Book, Timothy J. Long, Alan L. Selman:
Quantitative Relativizations of Complexity Classes. 461-487 - Bernard Chazelle:
Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm. 488-507 - Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis II:
Consistency and Serializability in Concurrent Database Systems. 508-530 - M. Keane, Alan G. Konheim, Isaac Meilijson:
The Organ Pipe Permutation. 531-540 - Rami G. Melhem, Werner C. Rheinboldt:
A Mathematical Model for the Verification of Systolic Networks. 541-565 - Robert Endre Tarjan, Mihalis Yannakakis:
Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs. 566-579 - Yung H. Tsin, Francis Y. L. Chin:
Efficient Parallel Algorithms for a Class of Graph Theoretic Problems. 580-599 - Brenda S. Baker, Edward G. Coffman Jr.:
Insertion and Compaction Algorithms in Sequentially Allocated Storage. 600-609 - John E. Hopcroft, Deborah Joseph, Sue Whitesides:
Movement Problems for 2-Dimensional Linkages. 610-629 - Sam Toueg, Özalp Babaoglu:
On the Optimum Checkpoint Selection Problem. 630-649 - Joseph Y.-T. Leung, Oliver Vornberger, James D. Witthoff:
On Some Variants of the Bandwidth Minimization Problem. 650-667
Volume 13, Number 4, November 1984
- Daniel P. Heyman, Shalom Tsur:
Disk Performance in a Transaction-Oriented System. 669-681 - Andreas Blass, Yuri Gurevich:
Equivalence Relations, Invariants, and Normal Forms. 682-689 - Ten-Hwang Lai, Sartaj Sahni:
Preemptive Scheduling of a Multiprocessor System with Memories to Minimize Maximum Lateness. 690-704 - Gregory Dobson:
Scheduling Independent Tasks on Uniform Processors. 705-716 - Hans Heller:
On Relativized Polynomial and Exponential Computations. 717-725 - Hans Wilhelm Barz:
The Power of Synchronization Mechanisms. 726-749 - Jean H. Gallier:
n-Rational Algebras I. Basic Properties and Free Algebras. 750-775 - Jean H. Gallier:
n-Rational Algebras II. Varieties and Logic of Inequalities. 776-794 - Nathan Linial:
The Information-Theoretic Bound is Good for Merging. 795-801 - Joachim von zur Gathen:
Parallel Algorithms for Algebraic Problems. 802-824 - Rivi Sherman, Amir Pnueli, David Harel:
Is the Interesting Part of Process Logic Uninteresting? A Translation from PL to PDL. 825-839 - Joseph F. JáJá, Viktor K. Prasanna, Janos Simon:
Information Transfer under Different Sets of Protocols. 840-849 - Manuel Blum, Silvio Micali:
How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits. 850-864 - Dennis S. Arnon, George E. Collins, Scott McCallum:
Cylindrical Algebraic Decomposition I: The Basic Algorithm. 865-877 - Dennis S. Arnon, George E. Collins, Scott McCallum:
Cylindrical Algebraic Decomposition II: An Adjacency Algorithm for the Plane. 878-889
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-01-16 00:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
