22. FOCS 1981:
Nashville, Tennessee, USA
22nd Annual Symposium on Foundations of Computer Science, Nashville, Tennessee, USA, 28-30 October 1981.
IEEE Computer Society 1981
Session 1a
Session 1b
Session 2
- Don Coppersmith, Shmuel Winograd:
On the Asymptotic Complexity of Matrix Multiplication (Extended Summary).
82-90

- Ephraim Feig, Shmuel Winograd:
On the Direct Sum Conjecture (Extended Summary).
91-94

- Joseph JáJá:
Computation of Algebraic Functions with Root Extractions.
95-100

- Norbert Blum:
An Omega(n^4/3) Lower Bound on the Monotone Network Complexity of n-th Degree Convolution.
101-108

- Maria M. Klawe:
Non-Existence of One-Dimensional Expanding Graphs.
109-114

- Mark J. Post:
A Minimum Spanning Ellipse Algorithm.
115-122

- Z. Aviad, E. Shamir:
A Direct Dynamic Solution to Range Search and Related Problems for Product Regions.
123-126

- Jeffrey Scott Vitter:
Deletion Algorithms for Hashing that Preserve Randomness (detailed abstract).
127-132

- Greg N. Frederickson:
Implicit Data Structures for the Weighted Dictionary Problem (preliminary version).
133-139

Session 3a
Session 3b
Session 4
Session 5
- Richard Statman:
Number Theoretic Functions Computable by Polymorphic Programs (Extended Abstract).
279-282

- Carl H. Smith:
The Power of Parallelism for Automatic Program Synthesis.
283-295

- Péter Gács:
On the Relation between Descriptional Complexity and Algorithmic Probability.
296-303

- Ravi Kannan:
A Circuit-Size Lower Bound.
304-309

- David Harel, Amir Pnueli, Jonathan Stavi:
Propositional Dynamic Logic of Context-Free Programs.
310-321

- Joseph Y. Halpern, John H. Reif:
The Propositional Dynamic Logic of Deterministic, Well-Structured Programs (Extended Abstract).
322-334

- Jerzy Tiuryn:
Unbounded Program Memory Adds to the Expressive Power of First-Order Dynamic Logic (Extended Abstract).
335-339

- Pierre Wolper:
Temporal Logic Can Be More Expressive.
340-348

Session 6
Late Paper
Last update Sat May 25 02:54:09 2013
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page