Proceedings: November 3 - 5, 1993, Palo Alto, California
Gespeichert in:
Körperschaft: | |
---|---|
Format: | Tagungsbericht Buch |
Sprache: | English |
Veröffentlicht: |
Los Alamitos, Calif. [u.a.]
IEEE Computer Soc. Press
1993
|
Schlagworte: | |
Online-Zugang: | Inhaltsverzeichnis |
Beschreibung: | XIII, 745 S. Ill., graph. Darst. |
ISBN: | 0818643706 0818643722 0818643714 |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV008883361 | ||
003 | DE-604 | ||
005 | 20170112 | ||
007 | t| | ||
008 | 940211s1993 xx ad|| |||| 10||| eng d | ||
020 | |a 0818643706 |9 0-8186-4370-6 | ||
020 | |a 0818643722 |9 0-8186-4372-2 | ||
020 | |a 0818643714 |9 0-8186-4371-4 | ||
035 | |a (OCoLC)180482997 | ||
035 | |a (DE-599)BVBBV008883361 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-739 |a DE-91G |a DE-20 |a DE-83 |a DE-188 |a DE-706 | ||
084 | |a DAT 500f |2 stub | ||
111 | 2 | |a Symposium on Foundations of Computer Science |n 34 |d 1993 |c Palo Alto, Calif. |j Verfasser |0 (DE-588)5105435-8 |4 aut | |
245 | 1 | 0 | |a Proceedings |b November 3 - 5, 1993, Palo Alto, California |c 34th annual Symposium on Foundations of Computer Science |
264 | 1 | |a Los Alamitos, Calif. [u.a.] |b IEEE Computer Soc. Press |c 1993 | |
300 | |a XIII, 745 S. |b Ill., graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
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 1993 |z Palo Alto Calif. |2 gnd-content | |
689 | 0 | 0 | |a Informatik |0 (DE-588)4026894-9 |D s |
689 | 0 | |5 DE-604 | |
689 | 1 | 0 | |a Theoretische Informatik |0 (DE-588)4196735-5 |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=005876479&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-005876479 |
Datensatz im Suchindex
_version_ | 1820868056646156288 |
---|---|
adam_text |
Table
of Contents
Preface
.
v
Referees
.vi
Committees
.
vii
Wednesday
Session la:
Chair: D. Eppstein
An On-Line Algorithm for Improving Performance in Navigation
.2
A. Blum and P. Chalasani
On the Value of Information in Coordination Games
.12
S. Irani and Y.
Rąbani
Heat
&
Dump: Competitive Distributed Paging
.22
B. Awerbuch, Y. Bartal, and A. Fiat
Throughput-Competitive On-Line Routing
.32
B. Awerbuch,
Y. Azar,
and S. Plotkin
Session lb:
Chair: R.Fagin
NP Trees and Carnap's Modal Logic
.42
G.
Gottlob
Logical Reducibility and Monadic NP
.52
S.S.
Cosmadakis
Gates Accept Concurrent Behavior
.62
V. Gupta and V. Pratt
Parallel Computable Higher Type Functionals
.72
P. Clote, A. Ignjatovic, and B.
Kapron
Session 2a:
Chair: R. Kosaraju
Random Sampling in Matroids, with Applications to
Graph Connectivity and Minimum Spanning Trees
.84
B.R.
Karger
Simulated Annealing for Graph Bisection
.94
M. Jerrum and G.B. Sorkin
Using Difficulty of Prediction to Decrease Computation:
Fast Sort, Priority Queue and Convex Hull on Entropy Bounded Inputs
.104
S. Chen and J.H.
Reif
Vlil
Session 2b:
Chair: S. Mahaney
The Shrinkage Exponent is
2.114
J.
Hastad
Тор
-Down
Lower Bounds for Depth
3
Circuits
.124
J.
Hastad,
S.
Jukna, and P.
Pudlák
On Representations by Low-Degree Polynominals
.130
R. Smolensky
Session 3a:
Chair: R. Kosaraju
A Polynomial-Time Algorithm for the Perfect Phylogeny Problem
When the Number of Character States is Fixed
.140
R. Agarwala and
D. Fernández-Baca
Genome Rearrangements and Sorting by Reversals
.148
V. Bafna and
P.A.
Pevzner
Approximating Shortest Superstrings
.158
S.-H.
Teng
and F. Yao
Session 3b:
Chair: S.
Safra
On the "log rank"
—
Conjecture in Communication Complexity
.168
R. Raz
and B.
Spieker
The Complexity and Distribution of Hard Problems
.177
D.W.
Juedes and J.H.
Lutz
Sensitive Functions and Approximate Problems
.186
S. Chaudhuri
Session 4a:
Chair: O. Waarts
Synchronization Power Depends on the Register Size
.196
Y. Afek and G. Stupp
A Tight Lower Bound for
Å-Set
Agreement
.206
S. Chaudhuri, M. Herlihy, N.A. Lynch, and M.R. Tuttle
Session 4b:
Chair: P. Raghavan
Space Bounds for Graph Connectivity Problems on Node-Named
JAGs and Node-Ordered JAGs
.218
C.K.
Poon
Time-Space Lower Bounds for Directed s-t Connectivity on JAG Models
.228
G. Barnes and J.A. Edmonds
A Randomized Time-Space Tradeoff of
Õ(mR)
for USTCON
.238
U.
Feige
їх
Thursday
Session la:
Chair:
N.
Megiddo
Optimally Fast Parallel Algorithms for Preprocessing and Pattern
Matching in One and Two Dimensions
.248
R. Cole, M. Crochemore,
Z. Galii,
L. Gasieniec, R. Hariharan,
S. Muthukrishnan, K. Park, and W. Rytter
Breaking the
Θ(η
log2 n) Barrier for Sorting with Faults
.734
T. Leighton and
Y. Ma
A Linear-Processor Poiylog-Time Algorithm for Shortest Paths in Planar Graphs
.259
P.N. Klein and S. Subramanian
Highly Efficient Asynchronous Execution of Large-Grained Parallel Programs
.271
У.
Aumann, Z.M. Kedem, K.V.
Palem,
and
М.О.
Rabin
Session lb:
Chair: M. Kearns
General Bounds on Statistical Query Learning and
PAC
Learning with
Noise via Hypothesis Boosting
.282
J.A. Aslam and S.E. Decatur
Scale-Sensitive Dimensions, Uniform Convergence, and Learnability
.292
N.
Alon, S. Ben-David,
N.
Cesa-Bianchi, and D.
Haussler
Exact Learning via the Monotone Theory
.302
N.
H. Bshouty
Learning an Intersection of
k
Halfspaces
Over a Uniform Distribution
.312
A. Blum and R.
Kannan
Session 2a:
Chair: M. Karchmer
Primal-Dual RNC Approximation Algorithms for (Multi)-Set
(Multi )-Cover
and Covering Integer Programs
.322
S. Rajagopalan and V.V. Vazirani
Optimal Parallel All-Nearest-Neighbors Using the
Well-Separated Pair Decomposition
.332
P.B. Callahan
Universal Emulations with Sublogarithmic Slowdown
.341
C. Kaklamanis, D.
Križane,
and S. Rao
Session 2b:
Chair: U. Vazirani
Quantum Circuit Complexity
.352
A. C.-C Yao
A Quantum Bit Commitment Scheme
Provably
Unbreakable by Both Parties
.362
G. Brassard,
C. Crépeau,
R. Jozsa, and D.
Langlois
Solving Systems of Set Constraints with Negated Subset Relationships
.372
R.
Gilleron,
S. Tison,
and
M.
Tommast
Session
За:
Chair:
E. Welzl
Near-Quadratic Bounds for the Motion Planning Problem for a
Polygon in a Polygonal Environment
.382
D. Halperin and M. Sharir
Geometric Discrepancy Revisited
.392
B. Chazelle
Product Range Spaces, Sensitive Sampling, and Derandomization
.400
H.
Brönnimann,
В.
Chazelle, and J.
Matoušek
Session 3b:
Chair: D.
Kozen
The Complexity of the Theory ofp-adic Numbers
.412
L. Egidi
Testing Equalities of Multiplicative Representations in Polynomial Time
.422
G. Ge
Las Vegas Algorithms for Matrix Groups
.427
R. Beals and L.
Babai
Session 4a:
Chair:
N.
Megiddo
Faster Algorithms for the Generalized Network Flow Problem
.438
T. Radzik
A Framework for Cost-Scaling Algorithms for
Submodular
Flow Problems
.449
H.N. Gabow
A Simple Local-Control Approximation Algorithm for Multicommodity Flow
.459
B. Awerbuch and T. Leighton
Session 4b:
Chair: M. Karchmer
Dynamic Word Problems
.470
G.S. Frandsen, P.B. Miltersen, and S. Skyum
Optimal Bi-Weighted Binary Trees and the Complexity of
Maintaining Partial Sums
.480
H. Hampapuram and M.L.
Fredman
t
A Weak Version of the Blum, Shub and
Smale
Model
.486
P. Koiran
Friday
Session la:
Chair: E. Welzl
Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions
.498
M. Sharir
xi
Efficient
Computation of Euclidean Shortest Paths in the Plane
.508
J. Hershberger and S.
Suri
The Union of Convex Polyhedra in Three Dimensions
.518
B. Aronov and M. Sharir
Better Lower Bounds on Detecting
Affine
and Spherical Degeneracies
.528
J. Erickson and R.
Seidel
Session lb:
Chair: S.
Safra
The Hardness of Approximate Optima in Lattices, Codes, and
Systems of Linear Equations
.724
S. Arora, L.
Babai,
J. Stern, and Z. Sweedyk
When Can We Sort In o{n log n) Time?
.538
A.M. Ben-Amram and
Z. Galii
On Bounded Queries and Approximation
.547
R. Chang and W.I. Gasarch
The NC Equivalence of Planar Integer Linear Programming and Euclidean GCD
.557
D. Shallcross, V. Pan, and Y. Lin-Kriz
Session 2a:
Chair: D.Eppetein
A Polynomial Time Algorithm for Counting Integral
Points in Polyhedra When the Dimension is Fixed
.566
A.I. Barvinok
A Compact Piecewise-Linear Voronoi Diagram for Convex Sites in the Plane
.573
M. McAllister, D. Kirkpatrick, and J. Snoeyink
Refining
a
Triangulation
of a Planar Straight-Line Graph
to Eliminate Large Angles
.583
S.A.
Mitchell
Session 2b:
Chair: U. Vazirani
Signal Propagation, with Application to a Lower Bound
on the Depth of Noisy Formulas
.594
W. Evans and L.J. Schulman
Directed vs. Undirected Monotone Contact Networks for Threshold Functions
.604
M.M.
Halldórsson,
J. Radhakrishnan, andK.V. Subrahmanyam
Session 3a:
Chair: D.
Kozen
Counting Rational Points on Curves Over Finite Fields
.616
M. -D. Huang and D. Ierardi
An O(n log 3 n) Algorithm for the Real Root Problem
.626
J.H.
Reif
xa
Session 3b:
Chair:
O. Waarłs
Near-Linear Cost Sequential and Distributed Constructions of
Sparse Neighborhood Covers
.638
B. Awerbuch, B.
Berger,
L.
Cowen, and
D.
Peleg
Fast Algorithms for Constructing
ŕ-Spanners
and Paths with Stretch
í
.648
E.
Cohen
A Sub-Linear Time Distributed Algorithm for
Minimum-Weight Spanning Trees
.659
J.A. Garay, S.
Kutten,
and D. Peleg
Session 4a:
Chair: M. Kearns
Eavesdropping Games: A Graph-Theoretic
Approach to Privacy in Distributed Systems
.670
M. Franklin,
Z. Galii,
and M. Yung
A Chernoff Bound for Random Walks on Expander Graphs
.680
D. Gillman
On Choosing a Dense Subgraph
.692
G. Kortsarz and D. Peleg
Session 4b:
Chair: R.
Motivarti
Efficient Out-of-Core Algorithms for Linear Relaxation
Using Blocking Covers
.704
C.E. Leiserson, S. Rao, and S. Toledo
External-Memory Computational Geometry
.714
M.T. Goodrich, J.-J. Tsay,
D.E.
Vengroff, andJ.S.
Vitter
Author Index
.744
t
Winner of the Machtey Award for the best student-authored paper.
xiii |
any_adam_object | 1 |
author_corporate | Symposium on Foundations of Computer Science Palo Alto, Calif |
author_corporate_role | aut |
author_facet | Symposium on Foundations of Computer Science Palo Alto, Calif |
author_sort | Symposium on Foundations of Computer Science Palo Alto, Calif |
building | Verbundindex |
bvnumber | BV008883361 |
classification_rvk | SS 1993 |
classification_tum | DAT 500f |
ctrlnum | (OCoLC)180482997 (DE-599)BVBBV008883361 |
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">BV008883361</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20170112</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">940211s1993 xx ad|| |||| 10||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0818643706</subfield><subfield code="9">0-8186-4370-6</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0818643722</subfield><subfield code="9">0-8186-4372-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0818643714</subfield><subfield code="9">0-8186-4371-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)180482997</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008883361</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-91G</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-706</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">34</subfield><subfield code="d">1993</subfield><subfield code="c">Palo Alto, Calif.</subfield><subfield code="j">Verfasser</subfield><subfield code="0">(DE-588)5105435-8</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Proceedings</subfield><subfield code="b">November 3 - 5, 1993, Palo Alto, California</subfield><subfield code="c">34th annual Symposium on Foundations of Computer Science</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Los Alamitos, Calif. [u.a.]</subfield><subfield code="b">IEEE Computer Soc. Press</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIII, 745 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="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">1993</subfield><subfield code="z">Palo Alto Calif.</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" 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="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" 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="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=005876479&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-005876479</subfield></datafield></record></collection> |
genre | (DE-588)1071861417 Konferenzschrift 1993 Palo Alto Calif. gnd-content |
genre_facet | Konferenzschrift 1993 Palo Alto Calif. |
id | DE-604.BV008883361 |
illustrated | Illustrated |
indexdate | 2025-01-10T13:18:18Z |
institution | BVB |
institution_GND | (DE-588)5105435-8 |
isbn | 0818643706 0818643722 0818643714 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005876479 |
oclc_num | 180482997 |
open_access_boolean | |
owner | DE-739 DE-91G DE-BY-TUM DE-20 DE-83 DE-188 DE-706 |
owner_facet | DE-739 DE-91G DE-BY-TUM DE-20 DE-83 DE-188 DE-706 |
physical | XIII, 745 S. Ill., graph. Darst. |
publishDate | 1993 |
publishDateSearch | 1993 |
publishDateSort | 1993 |
publisher | IEEE Computer Soc. Press |
record_format | marc |
spelling | Symposium on Foundations of Computer Science 34 1993 Palo Alto, Calif. Verfasser (DE-588)5105435-8 aut Proceedings November 3 - 5, 1993, Palo Alto, California 34th annual Symposium on Foundations of Computer Science Los Alamitos, Calif. [u.a.] IEEE Computer Soc. Press 1993 XIII, 745 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf Informatik (DE-588)4026894-9 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 1993 Palo Alto Calif. gnd-content Informatik (DE-588)4026894-9 s DE-604 Theoretische Informatik (DE-588)4196735-5 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=005876479&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 November 3 - 5, 1993, Palo Alto, California 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 November 3 - 5, 1993, Palo Alto, California |
title_auth | Proceedings November 3 - 5, 1993, Palo Alto, California |
title_exact_search | Proceedings November 3 - 5, 1993, Palo Alto, California |
title_full | Proceedings November 3 - 5, 1993, Palo Alto, California 34th annual Symposium on Foundations of Computer Science |
title_fullStr | Proceedings November 3 - 5, 1993, Palo Alto, California 34th annual Symposium on Foundations of Computer Science |
title_full_unstemmed | Proceedings November 3 - 5, 1993, Palo Alto, California 34th annual Symposium on Foundations of Computer Science |
title_short | Proceedings |
title_sort | proceedings november 3 5 1993 palo alto california |
title_sub | November 3 - 5, 1993, Palo Alto, California |
topic | Theoretische Informatik (DE-588)4196735-5 gnd Informatik (DE-588)4026894-9 gnd |
topic_facet | Theoretische Informatik Informatik Konferenzschrift 1993 Palo Alto Calif. |
url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=005876479&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
work_keys_str_mv | AT symposiumonfoundationsofcomputersciencepaloaltocalif proceedingsnovember351993paloaltocalifornia |