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
- J. C. Lagarias, Andrew M. Odlyzko:
Solving Low-Density Subset Sum Problems.
1-10

- Michael Luby, Silvio Micali, Charles Rackoff:
How to Simultaneously Exchange a Secret Bit by Flipping a Symmetrically-Biased Coin.
11-21

- Umesh V. Vazirani, Vijay V. Vazirani:
Trapdoor Pseudo-random Number Generators, with Applications to Protocol Design.
23-30

- Jeff Kahn, Michael E. Saks, Dean Sturtevant:
A Topological Approach to Evasiveness.
31-33

- Shimon Even, Oded Goldreich:
On the Security of Multi-Party Ping-Pong Protocols.
34-39

- Harry G. Mairson:
The Program Complexity of Searching a Table.
40-47

- Janet Incerpi, Robert Sedgewick:
Improved Upper Bounds on Shellsort.
48-55

- Richard M. Karp, Michael Luby:
Monte-Carlo Algorithms for Enumeration and Reliability Problems.
56-64

- Jeffrey Scott Vitter:
Optimum Algorithms for Two Random Sampling Problems (Extended Abstract).
65-75

- Philippe Flajolet, G. Nigel Martin:
Probabilistic Counting.
76-82

Session 2
Session 3
Session 4
Session 5
Session 6
Last update Sun May 26 01:52:59 2013
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page