24. FOCS 1983:
Tucson, Arizona, USA
24th Annual Symposium on Foundations of Computer Science, Tucson, Arizona, USA, 7-9 November 1983.
IEEE Computer Society 1983
Session 1
Jeffrey Scott Vitter:
Optimum Algorithms for Two Random Sampling Problems (Extended Abstract).
65-75
Session 2
John H. Reif:
Logarithmic Depth Circuits for Algebraic Functions.
138-145
Session 3
Session 4
Brenda S. Baker:
Approximation Algorithms for NP-Complete Problems on Planar Graphs (Preliminary Version).
265-273
Mihalis Yannakakis:
A Polynomial Algorithm for the Min Cut Linear Arrangement of Trees (Extended Abstract).
274-281
George S. Lueker:
Bin Packing with Items Uniformly Distributed over Intervals [a,b].
289-297
Session 5
Piotr Berman,
Janos Simon:
Lower Bounds on Graph Threading by Probabilistic Machines (Preliminary Version).
304-311
Joseph JáJá:
On the Computational Complexity of the Permanent (Extended Abstract).
312-319
Helmut Alt:
Multiplication Is the Easiest Nontrivial Arithmetic Function.
320-322
Brenda S. Baker,
Ron Y. Pinter:
An Algorithm for the Optimal Placement and Routing of a Circuit within a Ring of Pads (Extended Abstract).
360-370
Alok Aggarwal:
Period-Time Tradeoffs for VLSI Models with Delay (Preliminary Version).
372-382
Session 6
Maria M. Klawe:
A Tight Bound for Black and White Pebbles on the Pyramid.
410-419
Juris Hartmanis:
Generalized Kolmogorov Complexity and the Structure of Feasible Computations (Preliminary Report).
439-445
Daniel Leivant:
Reasoning about Functional Programs and Complexity Classes Associated with Type Disciplines.
460-469