JCSS
, Volume 37
Volume 37, Number 1, August 1988
Selected Papers of
FOCS 1985
Christos H. Papadimitriou
,
David Wolfe
: The Complexity of Facets Resolved. 2-13
BibTeX
Lefteris M. Kirousis
,
Christos H. Papadimitriou
: The Complexity of Recognizing Polyhedral Scenes. 14-38
BibTeX
Eugene M. Luks
,
Pierre McKenzie
: Parallel Algorithms for Solvable Permutation Groups. 39-62
BibTeX
Gad M. Landau
,
Uzi Vishkin
: Fast String Matching with k Differences. 63-78
BibTeX
David S. Johnson
,
Christos H. Papadimitriou
,
Mihalis Yannakakis
: How Easy is Local Search? 79-100
BibTeX
Ming Li
: Simulating Two Pushdown Stores by One Tape in O(n^1.5 sqrt(log n)) Time. 101-116
BibTeX
Volume 37, Number 2, October 1988
Selected Papers of
FOCS 1986
Noga Alon
,
Wolfgang Maass
: Meanders and Their Applications in Lower Bounds Arguments. 118-129
BibTeX
Prabhakar Raghavan
: Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs. 130-143
BibTeX
Marek Chrobak
,
Ming Li
: k+1 Heads Are Better than k for PDAs. 144-155
BibTeX
Gilles Brassard
,
David Chaum
,
Claude Crépeau
: Minimum Disclosure Proofs of Knowledge. 156-189
BibTeX
Philip N. Klein
,
John H. Reif
: An Efficient Parallel Algorithm for Planarity. 190-246
BibTeX
Stuart A. Kurtz
,
Stephen R. Mahaney
,
James S. Royer
: Collapsing Degrees. 247-268
BibTeX
Volume 37, Number 3, December 1988
Tat-hung Chan
: Pushdown Automata with Reversal-Bounded Counters. 269-291
BibTeX
Errol L. Lloyd
,
Mary Lou Soffa
: On Locating Minimum Feedback Vertex Sets. 292-311
BibTeX
Uwe Schöning
: Graph Isomorphism is in the Low Hierarchy. 312-323
BibTeX
Mary G. O'Connor
: An Unpredictability Approach to Finite-State Randomness. 324-336
BibTeX
Greg N. Frederickson
: Distributed Algorithms for Selection in Sets. 337-348
BibTeX
Rodney R. Howell
,
Louis E. Rosier
: Completeness Results for Conflict-Free Vector Replacement Systems. 349-366
BibTeX
Kai Salomaa
: Deterministic Tree Pushdown Automata and Monadic Tree Rewriting Systems. 367-394
BibTeX
Nicholas Pippenger
: Correction to "Computational Complexity of Algebraic Functions". 395-399
BibTeX
, ->
JCSS 22
(3): 454-470 (1981)
Copyright ©
Sun May 17 00:08:11 2009 by
Michael Ley
(
ley@uni-trier.de
)