Expanders, randomness, or time versus space

Journal of Computer and System Sciences

Volumn 36, Issue 3, 1988, Pages 379-383

  Sipser, Michael ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING--ALGORITHMS; MATHEMATICAL TECHNIQUES--GRAPH THEORY;

EXPANDER GRAPHS; RANDOMIZED ALGORITHMS;

COMPUTER METATHEORY;

EID: 0024019629     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/0022-0000(88)90035-9     Document Type: Article

References (9)

1. Non-existence of one dimensional expanding graphs
2. On the complexity of a concentrator
3. Explicit constructions of linear size superconcentrators
4. Explicit constructions of concentrators
5. On time versus space
6. How to generate cryptographically strong sequences of pseudo-random bits
7. Theory and application of trapdoor functions
8. Explicit expanders and the Ramanujan conjectures