Proceedings:
Gespeichert in:
| Körperschaft: | |
|---|---|
| Format: | Tagungsbericht Buch |
| Sprache: | English |
| Veröffentlicht: |
Los Alamitos, Calif. [u.a.]
IEEE Computer Soc. Pr.
1996
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XII, 638 S. Ill., graph. Darst. |
| ISBN: | 0818675942 078033762X 0818675969 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV011209327 | ||
| 003 | DE-604 | ||
| 005 | 20170112 | ||
| 007 | t| | ||
| 008 | 970218s1996 xx ad|| |||| 10||| eng d | ||
| 020 | |a 0818675942 |9 0-8186-7594-2 | ||
| 020 | |a 078033762X |9 0-7803-3762-X | ||
| 020 | |a 0818675969 |9 0-8186-7596-9 | ||
| 035 | |a (OCoLC)35987010 | ||
| 035 | |a (DE-599)BVBBV011209327 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-739 |a DE-29T |a DE-91G |a DE-20 |a DE-634 |a DE-83 |a DE-706 | ||
| 050 | 0 | |a TK7885.A1 | |
| 082 | 0 | |a 004 | |
| 084 | |a DAT 500f |2 stub | ||
| 111 | 2 | |a Symposium on Foundations of Computer Science |n 37 |d 1996 |c Burlington, Vt. |j Verfasser |0 (DE-588)5198680-2 |4 aut | |
| 245 | 1 | 0 | |a Proceedings |c 37th annual Symposium on Foundations of Computer Science, October 14 - 16, 1996, Burlington, Vermont |
| 264 | 1 | |a Los Alamitos, Calif. [u.a.] |b IEEE Computer Soc. Pr. |c 1996 | |
| 300 | |a XII, 638 S. |b Ill., graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 4 | |a Automates mathématiques, Théorie des - Congrès | |
| 650 | 7 | |a Automates mathématiques, Théorie des - Congrès |2 ram | |
| 650 | 4 | |a Informatique - Congrès | |
| 650 | 7 | |a Informatique - Congrès |2 ram | |
| 650 | 7 | |a informatique théorique |2 inriac | |
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Electronic data processing |v Congresses | |
| 650 | 4 | |a Machine theory |v Congresses | |
| 650 | 0 | 7 | |a Theoretische Informatik |0 (DE-588)4196735-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Informatik |0 (DE-588)4026894-9 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 1996 |z Burlington Vt. |2 gnd-content | |
| 689 | 0 | 0 | |a Theoretische Informatik |0 (DE-588)4196735-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Informatik |0 (DE-588)4026894-9 |D s |
| 689 | 1 | |8 1\p |5 DE-604 | |
| 856 | 4 | 2 | |m Digitalisierung TU Muenchen |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007518731&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-007518731 | |
Datensatz im Suchindex
| _version_ | 1820868195317186560 |
|---|---|
| adam_text |
Table
of
Contents
37th
IEEE Symposium
on Foundations of Computer
Science
Foreword
.
χ
Committees
.
ХІ
Reviewers,,
.xii
Session 1A:
Chair: Rajeev
Motivarti
Polynomial Time Approximation Schemes for Euclidean TSP and
other Geometric Problems
.2
S. Arora
The Regularity Lemma and Approximation Schemes for Dense Problems
.12
A. Frieze and R.
Kannan
A New Rounding Procedure for the Assignment Problem with Applications
to Dense Graph Arrangement Problems
.21
S. Arora, A. Frieze, and H. Kaplan
Approximate Strip Packing
.31
C. Kenyon and
E. Remila
Session IB:
Chair: Russell Impagliazzo
A Decision Procedure for Unitary Linear Quantum Cellular Automata
.38
С
Dürr
and
M. Santha
Polynomial Simulations of Decohered Quantum Computers
.46
D. Aharonov and
M. Ben-Or
Fault-Tolerant Quantum Computation
.56
P.W. Shor
Session 2A:
Chain
David Karger
Single-Source Unsplittable Flow
.68
J.M.
Kleinberg
The Optimal Path-Matching Problem
.78
W.H. Cunningham and J.F. Geelen
Short Paths in Expander Graphs
.86
J.
Kleinberg
and R.
Rubinfeld
Spectral Partitioning Works: Planar Graphs
and Finite Element Meshes
.96
DA. Spielman and S.-H.
Teng
Session
2В:
Chair: Chee Yap
Computing
Permanents
over Fields of Characteristic
3:
Where and Why it becomes Difficult
.108
G. Kogan
Solving Systems of Polynomial Congruences Modulo a Large Prime
.115
M.-D. Huang and Y.-C. Wong
Median Selection Requires
(2 + ε)η
Comparisons
.125
D. Dor and U. Zwick
Faster Deterministic Sorting and Searching in Linear Space
.135
A. Andersson
Session
ЗА:
Chair: Baruch
Schieber
An Efficient Algorithm for Constructing Minimal Trellises for
Codes over Finite Abelian Groups
.144
V.V. Vazirani, H. Saran, and B. Sundar
Rajan
Highly Fault-Tolerant Parallel Computation
.154
D
-А.
Spielman
Maximum Likelihood Decoding of Reed Solomon Codes
.164
M. Sudan
New Coding Techniques for Improved Bandwidth Utilization
.173
M.
Adler
| Session 3B: |
Chair: Sandy Irani
Probabilistic Approximation of Metric Spaces and its
Algorithmic Applications
.184
Y.
Bartol
Factoring Graphs to Bound Mixing Rates
.194
N.
Madras and D. Randall
Sampling According to the Multivariate Normal Density
.204
R.
Kannan
and G. Li
Load Balancing and Density Dependent Jump Markov Processes
.213
M. Mitzenmacher
I Session 4A:
_
|
Chair: Tandy Warnow
Tree Data Structures for N-Body Simulation
.224
R.J. Anderson
Efficient Information Gathering on the Internet
.234
O. Etzioni, S. Hanks, T. Jiang,
RM. Karp,
О.
Modani, and
O. Waarts
vi
Approximate Option Pricing
.244
P. Chalasani, S. Jha, and I. Saias
j
Session 4B;
_
|
Chair: Dexter
Kozen
Temporal Logic and Semidirect Products: An Effective
Characterization of the Until Hierarchy
.256
D.
Thérien
and T. Wilke
Equivalence in Finite-Variable Logics is Complete for Polynomial Time
.264
M. Grohe
Simplified and Improved Resolution Lower Bounds
.274
P.
Bearne
and T. Pitassi
\ Session
5:_
j
Chair: Martin
Tompa
Computationally Hard Algebraic Problems
.284
M.O. Rabin
I Session 6A:
_
I
Chair: Tandy Warnow
Approximating Minimum-Size ^-Connected Spanning
Subgraphs via Matching
.292
J. Cheriyan and R. Thurimella
A 3-Approximation for the Minimum Tree Spanning
k
Vertices
.302
N.
Garg
An 8-Approximation Algorithm for the Subset Feedback
Vertex Set Problem
.310
G. Even, J.S. Naor, and L. Zosin
Efficient Approximate and Dynamic Matching of Patterns
Using a Labeling Paradigm
.320
S.C. Sahinalp and U. Vishkin
| Session 6B; |
Chair: Russell Impagliazzo
A Polynomial-Time Algorithm for Learning Noisy
Linear Threshold Functions
.330
A. Blum, A. Frieze, R.
Kannan,
and S. Vempala
Property Testing and its Connection to Learning and Approximation
.339
O.
Goldreich,
S.
Goldwasser,
and
D.
Ron
On the Applications of Multiplicity Automata in Learning
.349
A. Beimel, F. Bergadano, N.H. Bshouty,
E. Kushilevitz, and S. Varricchio
Learning Linear Transformations
.359
A. Frieze, M. Jerrum, and R.
Kannan
vu
Session 7A:
Chair: S.
Rao
Kosaraju
Deterministic Routing with Bounded Buffers: Turning Offline
into Online Protocols
.370
F. Meyer
auf der Heide
and
С.
Scheideler
Universal Stability Results for Greedy Contention-Resolution Protocols
.380
M. Andrews, B. Awerbuch,
A. Fernández,
J.
Kleinberg,
T. Leighton, and Z. Liu
A General
Approach to Dynamic Packet Routing with Bounded Buffers
.390
A.Z.
Broder, A.M.
Frieze, and E. Upfal
Path Coloring on the Mesh
.400
Y.
Rąbani
Session 7B: |
Chair: Anne Condon
Discrepancy Sets and Pseudorandom Generators for
Combinatorial Rectangles
.412
R.
Armoni,
M.
Saks, A. Wigderson, and S. Zhou
The Boolean Isomorphism Problem
.422
M. Agrawal and T. Thierauf
Potential of the Approximation Method
.431
K.
Amano
and A. Maruoka
Static Dictionaries on AC0 RAMs: Query Time
©(лДо^п
/
log log
η)
is Necessary and Sufficient
.441
A Andersson,
P.B.
Miitersen,
S. Riis, and M.
Thorup
Session
8Aî
Chair: CheeYap
All Pairs Almost Shortest Paths
.452
D. Dor, S. Halperin, and U. Zwick
Computing Vertex Connectivity: New Bounds
from Old Techniques
.462
M.R. Henzinger, S. Rao, and H.N. Gabow
New Lower Bounds for
Halfspace
Emptiness
.472
J. Erickson
Binary Space Partitions for Fat Rectangles
.482
P.K. Agarwal, E.F. Grove, T.M.
Murali,
and J.S.
Vitter
1
Session 8B: |
Chain
Carsten
Lund
On the Knowledge Complexity of NP
.494
E.
Petránk
and G.
Tardos
vni
Incoercible
Multiparty Computation
.504
R. Canetti
and R.
Gennaro
Pseudorandom Functions Revisited: The Cascade
Construction and its Concrete Security
.514
M.
Bellore,
R.
Canetti,
and
H. Krawczyk
The Geometry
of Coin-Weighing Problems
.524
N.
Alon, D.N. Kozlov, and V.H.
Vu
| Session
9;_
|
Chair: Rajeev
Motivarti
Universal Data Compression and Portfolio Selection
.534
T.M. Cover
Session 10A:
Chair: Sandy Irani
Near-Optimal Parallel Prefetching and Caching
.540
T. Kimbrel and A.R.
Karlin
New Algorithms for the Disk Scheduling Problem
.550
M. Andrews, M.A. Bender, and L. Zhang
Optimal Dynamic Interval Management in External Memory
.560
L.
Arge
and J.S.
Vitter
Fast Fault-Tolerant Concurrent Access to Shared Objects
.570
C.G. Plaxton and R. Rajaraman
Fault-Tolerant Data Structures
.580
Y. Aumann and M.A. Bender
| Session 10B: |
Chair: Michael
Luby
Approximate Checking of Polynomials and Functional Equations
.592
F. Ergiin, S. Ravi Kumar, and R.
Rubinfeld
Efficient Self-Testing/Self-Correction of Linear Recurrences
.602
S. Ravi Kumar and D. Sivakumar
Verifying Identities
.612
S. Rajagopalan and L.J. Schulman
Gadgets, Approximation, and Linear Programming
.617
L. Trevisan, G.B. Sorkin, M. Sudan, and D.P. Williamson
Clique is Hard to Approximate within
ηι~ε
.627
J.
Hastad
Author Index
.637
IX |
| any_adam_object | 1 |
| author_corporate | Symposium on Foundations of Computer Science Burlington, Vt |
| author_corporate_role | aut |
| author_facet | Symposium on Foundations of Computer Science Burlington, Vt |
| author_sort | Symposium on Foundations of Computer Science Burlington, Vt |
| building | Verbundindex |
| bvnumber | BV011209327 |
| callnumber-first | T - Technology |
| callnumber-label | TK7885 |
| callnumber-raw | TK7885.A1 |
| callnumber-search | TK7885.A1 |
| callnumber-sort | TK 47885 A1 |
| callnumber-subject | TK - Electrical and Nuclear Engineering |
| classification_rvk | SS 1996 |
| classification_tum | DAT 500f |
| ctrlnum | (OCoLC)35987010 (DE-599)BVBBV011209327 |
| dewey-full | 004 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004 |
| dewey-search | 004 |
| dewey-sort | 14 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Conference Proceeding Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV011209327</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20170112</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">970218s1996 xx ad|| |||| 10||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0818675942</subfield><subfield code="9">0-8186-7594-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">078033762X</subfield><subfield code="9">0-7803-3762-X</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0818675969</subfield><subfield code="9">0-8186-7596-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)35987010</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011209327</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-739</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-706</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TK7885.A1</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 500f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="111" ind1="2" ind2=" "><subfield code="a">Symposium on Foundations of Computer Science</subfield><subfield code="n">37</subfield><subfield code="d">1996</subfield><subfield code="c">Burlington, Vt.</subfield><subfield code="j">Verfasser</subfield><subfield code="0">(DE-588)5198680-2</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Proceedings</subfield><subfield code="c">37th annual Symposium on Foundations of Computer Science, October 14 - 16, 1996, Burlington, Vermont</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Los Alamitos, Calif. [u.a.]</subfield><subfield code="b">IEEE Computer Soc. Pr.</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XII, 638 S.</subfield><subfield code="b">Ill., graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automates mathématiques, Théorie des - Congrès</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Automates mathématiques, Théorie des - Congrès</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatique - Congrès</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Informatique - Congrès</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">informatique théorique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Electronic data processing</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Machine theory</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">1996</subfield><subfield code="z">Burlington Vt.</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung TU Muenchen</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007518731&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007518731</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 1996 Burlington Vt. gnd-content |
| genre_facet | Konferenzschrift 1996 Burlington Vt. |
| id | DE-604.BV011209327 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T13:20:31Z |
| institution | BVB |
| institution_GND | (DE-588)5198680-2 |
| isbn | 0818675942 078033762X 0818675969 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007518731 |
| oclc_num | 35987010 |
| open_access_boolean | |
| owner | DE-739 DE-29T DE-91G DE-BY-TUM DE-20 DE-634 DE-83 DE-706 |
| owner_facet | DE-739 DE-29T DE-91G DE-BY-TUM DE-20 DE-634 DE-83 DE-706 |
| physical | XII, 638 S. Ill., graph. Darst. |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| publisher | IEEE Computer Soc. Pr. |
| record_format | marc |
| spelling | Symposium on Foundations of Computer Science 37 1996 Burlington, Vt. Verfasser (DE-588)5198680-2 aut Proceedings 37th annual Symposium on Foundations of Computer Science, October 14 - 16, 1996, Burlington, Vermont Los Alamitos, Calif. [u.a.] IEEE Computer Soc. Pr. 1996 XII, 638 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier Automates mathématiques, Théorie des - Congrès Automates mathématiques, Théorie des - Congrès ram Informatique - Congrès Informatique - Congrès ram informatique théorique inriac Datenverarbeitung Electronic data processing Congresses Machine theory Congresses Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf Informatik (DE-588)4026894-9 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 1996 Burlington Vt. gnd-content Theoretische Informatik (DE-588)4196735-5 s DE-604 Informatik (DE-588)4026894-9 s 1\p DE-604 Digitalisierung TU Muenchen application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007518731&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Proceedings Automates mathématiques, Théorie des - Congrès Automates mathématiques, Théorie des - Congrès ram Informatique - Congrès Informatique - Congrès ram informatique théorique inriac Datenverarbeitung Electronic data processing Congresses Machine theory Congresses Theoretische Informatik (DE-588)4196735-5 gnd Informatik (DE-588)4026894-9 gnd |
| subject_GND | (DE-588)4196735-5 (DE-588)4026894-9 (DE-588)1071861417 |
| title | Proceedings |
| title_auth | Proceedings |
| title_exact_search | Proceedings |
| title_full | Proceedings 37th annual Symposium on Foundations of Computer Science, October 14 - 16, 1996, Burlington, Vermont |
| title_fullStr | Proceedings 37th annual Symposium on Foundations of Computer Science, October 14 - 16, 1996, Burlington, Vermont |
| title_full_unstemmed | Proceedings 37th annual Symposium on Foundations of Computer Science, October 14 - 16, 1996, Burlington, Vermont |
| title_short | Proceedings |
| title_sort | proceedings |
| topic | Automates mathématiques, Théorie des - Congrès Automates mathématiques, Théorie des - Congrès ram Informatique - Congrès Informatique - Congrès ram informatique théorique inriac Datenverarbeitung Electronic data processing Congresses Machine theory Congresses Theoretische Informatik (DE-588)4196735-5 gnd Informatik (DE-588)4026894-9 gnd |
| topic_facet | Automates mathématiques, Théorie des - Congrès Informatique - Congrès informatique théorique Datenverarbeitung Electronic data processing Congresses Machine theory Congresses Theoretische Informatik Informatik Konferenzschrift 1996 Burlington Vt. |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007518731&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT symposiumonfoundationsofcomputerscienceburlingtonvt proceedings |