COMMENT ⊗   VALID 00003 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	.device xgp
C00003 00003	.begin nofill
C00006 ENDMK
C⊗;
.device xgp;
.singlescript
.spacing 10*5 mills;
.page frame 48 high 80 wide
.area text lines 1 to 48
.
.turn on "↔" for "→"
.turn on "%,π,α,#,&,∂,↑,↓,[,]"
.turn on "∩" for "↑"
.turn on "∪" for "↓"
.font 1 "ngr40l";
.font 3 "math30";
.font 4 "grkl40";
.font 5 "ngr30"; <<for title pages>>
.at "|cd" ⊂"%3α*%*"⊃
.
.select 1
.
.place text;
.
.next page
.begin nofill
↔   
.skip 5
.begin center
UPPER AND LOWER BOUNDS ON TIME-SPACE TRADEOFFS
IN A PEBBLE GAME
.skip
by
.skip
Thomas Lengauer
.skip 5
STAN-CS-79-745
July 1979
.skip 4
D E P A R T M E N T   O F   C O M P U T E R   S C I E N C E
School of Humanities and Sciences
STANFORD UNIVERSITY
.end
.next page
.skip 5
.begin center;
%5UPPER AND LOWER BOUNDS ON TIME-SPACE TRADEOFFS IN A PEBBLE GAME

Thomas Lengauer

Department of Computer Science
Stanford University
Stanford, California 94305

July 1979
.end
.skip 5
%5KEYWORDS:  pebbles, directed acyclic graphs, time-space, superconcentrators.
.skip 5
This work was supported by the German Academic Exchange Service (DAAD).  Printing
and distribution was supported by the Office of Naval Research under contract
NOOO14-76-C-O688.
.next page