46th Annual IEEE Symposium on Foundations of Computer Science: FOCS 2005 ; 23 - 25 October 2005, Pittsburgh, Pennsylvania, USA
Gespeichert in:
| Körperschaft: | |
|---|---|
| Format: | Tagungsbericht Buch |
| Sprache: | English |
| Veröffentlicht: |
Los Alamitos, Calif. [u.a.]
IEEE Computer Soc.
2005
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XIII, 668 S. Ill. |
| ISBN: | 0769523625 0769524680 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV020854253 | ||
| 003 | DE-604 | ||
| 005 | 20060503 | ||
| 007 | t| | ||
| 008 | 051103s2005 xx a||| |||| 10||| eng d | ||
| 020 | |a 0769523625 |9 0-7695-2362-5 | ||
| 020 | |a 0769524680 |9 0-7695-2468-0 | ||
| 035 | |a (OCoLC)62771432 | ||
| 035 | |a (DE-599)BVBBV020854253 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-384 |a DE-29T | ||
| 050 | 0 | |a QA76 | |
| 111 | 2 | |a Symposium on Foundations of Computer Science |n 46 |d 2005 |c Pittsburgh, Pa. |j Verfasser |0 (DE-588)6048198-5 |4 aut | |
| 245 | 1 | 0 | |a 46th Annual IEEE Symposium on Foundations of Computer Science |b FOCS 2005 ; 23 - 25 October 2005, Pittsburgh, Pennsylvania, USA |
| 246 | 1 | 3 | |a FOCS 2005 |
| 246 | 1 | 3 | |a Foundations of computer science |
| 246 | 1 | 3 | |a 46th Annual Symposium on Foundations of Computer Science |
| 264 | 1 | |a Los Alamitos, Calif. [u.a.] |b IEEE Computer Soc. |c 2005 | |
| 300 | |a XIII, 668 S. |b Ill. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 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 |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 2005 |z Pittsburgh Pa. |2 gnd-content | |
| 689 | 0 | 0 | |a Theoretische Informatik |0 (DE-588)4196735-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=014175938&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-014175938 | |
Datensatz im Suchindex
| _version_ | 1820868084249919488 |
|---|---|
| adam_text |
Titel: 46th Annual IEEE Symposium on Foundations of Computer Science
Autor: Symposium on Foundations of Computer Science, 46, 2005, Pittsburgh, Pa
Jahr: 2005
Table of Contents
46th Annual IEEE Symposium on Foundations of Computer Science
, (FOCS2005)
Foreword.x
Committees.xi
Best Paper Awards.xi
Machtey Award.xi
Knuth Prize.xi
Reviewers.xii
Corporate Sponsors.xiii
Tutorial 1
Chair: I. Dinur
On the Unique Games Conjecture.3
S. KJhot
Tutorial 2
Chair: S. Har-Peled
Algorithmic Techniques and Tools from Computational Geometry.7
B. Chazelle
Session 1
Chair: M. Kearns
Agnostically Learning Halfspaces.11
A. Kalai, A. Klivans, Y. Mansour, and R. Servedio
Noise Stability of Functions with Low Influences: Invariance and Optimality.21
E. Mossel, R. O'Donnell, and K. Oleszkiewicz
Every Decision Tree Has an Influential Variable.31
R. O'Donnell, M. Saks, O. Schramm, andR. Servedio
Lower Bounds for the Noisy Broadcast Problem.40
N. Goyal, G. Kindler, and M. Saks
Session 2
Chair: S. Rao
Best Paper Award:
The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of
Negative Type Metrics into tj .53
S. Khot and N. Vishnoi
The Closest Substring Problem with Small Distances.63
D. Marx
Fitting Tree Metrics: Hierarchical Clustering and Phylogeny.73
N. Ailon and M. Charikar
v
Metric Embeddings with Relaxed Guarantees.83
I. Abraham, Y. Bartal, T.-H. Chan, K. Dhamdhere, A. Gupta, J. Kleinberg,
0. Neiman, and A. Slivkins
Nonembeddability Theorems via Fourier Analysis.101
S. Khot and A. Naor
Session 3
Chair: A. Goel
Machtey Award:
On the Complexity of Two-Player Win-Lose Games.113
T. Abbott, D. Kane, and P. Valiant
Nash Equilibria in Random Games.123
1. Barany, S. Vempala, and A. Vetta
Query Incentive Networks.132
J. Kleinberg and P. Raghavan
Sink Equilibria and Convergence.142
M Goemans, V. Mirrokni, and A. Vetta
Session 4
Chair: P. Beame
Machtey Award Paper
On the Complexity of Real Functions.155
M Braverman
Linear Lower Bounds on Real-world Implementations of Concurrent Objects.165
F. Fich, D. Hendler, and N. Shavit
Towards a Final Analysis of Pairing Heaps.174
S. Pettie
Structuring Labeled Trees for Optimal Succinctness, and beyond.184
P. Ferragina, F. Luccio, G. Manzini, and S. Muthukrishnan
Session 5
Chair: I. Dinur
Approximation Algorithms for Unique Games.197
L. Trevisan
On Non-approximability for Quadratic Programs.206
S. Arora, E. Berger, E. Hazan, G. Kindler, and M. Safra
Hardness of Approximating the Closest Vector Problem with Pre-Processing. 216
M. Alekhnovich, S. Khot, G. Kindler, andN. Vishnoi
Hardness of the Undirected Edge-disjoint Paths Problem with Congestion.226
M. Andrews, J. Chuzhoy, S. Khanna, andL. Zhang
Session 6
Chair: E. Tardos
A Recursive Greedy Algorithm for Walks in Directed Graphs.
C. Chekuri and M. Pal
vi
Approximation Algorithms for Scheduling on Multiple Machines. 254
V Kumar, M. Marathe, S. Parthasarathy, and A. Srinivasan
AdWords and Generalized On-line Matching.264
A. Mehta, A. Saberi, U. Vazirani, and V. Vazirani
The Parking Permit Problem.274
A. Meyerson
Session 7
Chair: V. Guruswami
Best Paper Award:
Correcting Errors beyond the Guruswami-Sudan Radius in Polynomial Time.285
F. Parvaresh and A. Vardy
Error Correction via Linear Programming.295
E. Candes, M. Rudelson, T. Tao, and R. Vershynin
Error-Correcting Codes for Automatic Control.309
R. Ostrovsky, Y. Rabani, and L. Schulman
Almost Orthogonal Linear Codes are Locally Testable.317
T. Kaufman and S. Litsyn
On Delsarte's Linear Programming Bounds for Binary Codes.327
M. Navon and A. Samorodnitsky
Session 8
Chair: A. Goel
Fast Algorithms for Approximate Semidefinite Programming Using the Multiplicative
Weights Update Method.339
S. Arora, E. Hazan, and S. Kale
Improved Smoothed Analysis of the Shadow Vertex Simplex Method.349
A. Deshpande andD. Spielman
Sampling-based Approximation Algorithms for Multi-stage Stochastic Optimization.357
C. Swamy and D. Shmoys
How to Pay, Come What May: Approximation Algorithms for Demand-Robust
Covering Problems.367
K. Dhamdhere, V. Goyal, R. Ravi, and M. Singh
Session 9
Chair: D. Zuckerman
Group-theoretic Algorithms for Matrix Multiplication.379
H. Cohn, R. Kleinberg, B. Szegedy, and C. Umans
Answering Distance Queries in Directed Graphs Using Fast Matrix Multiplication.389
R. Yuster and U. Zwick
A Randomness-Efficient Sampler for Matrix-valued Functions and Applications.397
A. Wigderson and D. Xiao
Deterministic Extractors for Affine Sources over Large Fields.407
A. Gabizon and R. Raz
vii
Session 10 ,,,, V\ .p
Chair: Z. Bar-Yossef . . ., .
Additive Approximation for Edge-deletion Problems.419
N. Alon, A. Shapira, andB. Sudakov
A Characterization of the (Natural) Graph Properties Testable with One-sided Error.429
N. Alon and A. Shapira
An Algorithmic Version of the Hypergraph Regularity Method.439
P. Haxell, B. Nagle, and V Rod!
Session 11
Chair: J. Watrous
Cryptography in the Bounded Quantum-storage Model.449
I. Damgard, S. Fehr, L. Salvail, and C. Schaffner
Quantum Information and the PCP Theorem.459
R. Raz
From Optimal Measurement to Efficient Quantum Algorithms for the Hidden
Subgroup Problem over Semidirect Product Groups.469
D. Bacon, A. Childs, and W van Dam
The Symmetric Group Defies Strong Fourier Sampling.479
C. Moore, A. Russell, and L. Schulman
Session 12
Chair: F. McSherry
On Learning Mixtures of Heavy-Tailed Distributions.491
A. Dasgupta, J. Hopcroft, J. Kleinberg, and M Sandler
Learning Mixtures of Product Distributions over Discrete Domains.501
J. Feldman, R. O'Donnell, andR. Servedio
A General Lower Bound for Mixing of Single-site Dynamics on Graphs.511
T. Hayes and A. Sinclair
Analysis and Prediction of the Long-run Behavior of Probabilistic Sequential
Programs with Recursion.521
T. Brdzdil, J. Esparza, and A. Kucera
Safraless Decision Procedures. 53 j
O. Kupferman and M. Vardi
Session 13
Chair: R. Canetti
How to Play Almost Any Mental Game over the Net — Concurrent Composition via
Super-polynomial Simulation.
B. Barak and A. Sahai
On the Impossibility of Obfuscation with Auxiliary Input.
S. Goldwasser and Y. Kalai .
Concurrent Non-malleable Commitments.
R. Pass and A. Rosen .
Vlll
The Complexity of Online Memory Checking.573
M. Naor and G. Rothblum
Session 14
Chair: R. Lipton
Rational Secure Computation and Ideal Mechanism Design.585
S. Izmalkov, S. Micali, and M. Lepinski
Truthful and Near-optimal Mechanism Design via Linear Programming.595
R, Lavi and C. Swamy
Mechanism Design via Machine Learning.605
M.-F. Balcan, A. Blum, J. Hartline, and 7. Mansour
Beyond VCG: Frugality of Truthful Mechanisms.615
A. Karlin, D. Kempe, and T. Tamir
Session 15
Chair: M. Yannakakis
An Approximation Algorithm for the Disjoint Paths Problem in Even-degree Planar Graphs.627
J. Kleinberg
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring.637
E. Demaine, M. Hajiaghayi, and K.-I. Kawarabayashi
A Linear-time Approximation Scheme for Planar Weighted TSP.647
P. Klein
A Tale of Two Dimensional Bin Packing.657
N. Bansal, A. Lodi, and M. Sviridenko
Author Index.667
ix |
| adam_txt |
Titel: 46th Annual IEEE Symposium on Foundations of Computer Science
Autor: Symposium on Foundations of Computer Science, 46, 2005, Pittsburgh, Pa
Jahr: 2005
Table of Contents
46th Annual IEEE Symposium on Foundations of Computer Science
, (FOCS2005)
Foreword.x
Committees.xi
Best Paper Awards.xi
Machtey Award.xi
Knuth Prize.xi
Reviewers.xii
Corporate Sponsors.xiii
Tutorial 1
Chair: I. Dinur
On the Unique Games Conjecture.3
S. KJhot
Tutorial 2
Chair: S. Har-Peled
Algorithmic Techniques and Tools from Computational Geometry.7
B. Chazelle
Session 1
Chair: M. Kearns
Agnostically Learning Halfspaces.11
A. Kalai, A. Klivans, Y. Mansour, and R. Servedio
Noise Stability of Functions with Low Influences: Invariance and Optimality.21
E. Mossel, R. O'Donnell, and K. Oleszkiewicz
Every Decision Tree Has an Influential Variable.31
R. O'Donnell, M. Saks, O. Schramm, andR. Servedio
Lower Bounds for the Noisy Broadcast Problem.40
N. Goyal, G. Kindler, and M. Saks
Session 2
Chair: S. Rao
Best Paper Award:
The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of
Negative Type Metrics into tj .53
S. Khot and N. Vishnoi
The Closest Substring Problem with Small Distances.63
D. Marx
Fitting Tree Metrics: Hierarchical Clustering and Phylogeny.73
N. Ailon and M. Charikar
v
Metric Embeddings with Relaxed Guarantees.83
I. Abraham, Y. Bartal, T.-H. Chan, K. Dhamdhere, A. Gupta, J. Kleinberg,
0. Neiman, and A. Slivkins
Nonembeddability Theorems via Fourier Analysis.101
S. Khot and A. Naor
Session 3
Chair: A. Goel
Machtey Award:
On the Complexity of Two-Player Win-Lose Games.113
T. Abbott, D. Kane, and P. Valiant
Nash Equilibria in Random Games.123
1. Barany, S. Vempala, and A. Vetta
Query Incentive Networks.132
J. Kleinberg and P. Raghavan
Sink Equilibria and Convergence.142
M Goemans, V. Mirrokni, and A. Vetta
Session 4
Chair: P. Beame
Machtey Award Paper
On the Complexity of Real Functions.155
M Braverman
Linear Lower Bounds on Real-world Implementations of Concurrent Objects.165
F. Fich, D. Hendler, and N. Shavit
Towards a Final Analysis of Pairing Heaps.174
S. Pettie
Structuring Labeled Trees for Optimal Succinctness, and beyond.184
P. Ferragina, F. Luccio, G. Manzini, and S. Muthukrishnan
Session 5
Chair: I. Dinur
Approximation Algorithms for Unique Games.197
L. Trevisan
On Non-approximability for Quadratic Programs.206
S. Arora, E. Berger, E. Hazan, G. Kindler, and M. Safra
Hardness of Approximating the Closest Vector Problem with Pre-Processing. 216
M. Alekhnovich, S. Khot, G. Kindler, andN. Vishnoi
Hardness of the Undirected Edge-disjoint Paths Problem with Congestion.226
M. Andrews, J. Chuzhoy, S. Khanna, andL. Zhang
Session 6
Chair: E. Tardos
A Recursive Greedy Algorithm for Walks in Directed Graphs.
C. Chekuri and M. Pal
vi
Approximation Algorithms for Scheduling on Multiple Machines. 254
V Kumar, M. Marathe, S. Parthasarathy, and A. Srinivasan
AdWords and Generalized On-line Matching.264
A. Mehta, A. Saberi, U. Vazirani, and V. Vazirani
The Parking Permit Problem.274
A. Meyerson
Session 7
Chair: V. Guruswami
Best Paper Award:
Correcting Errors beyond the Guruswami-Sudan Radius in Polynomial Time.285
F. Parvaresh and A. Vardy
Error Correction via Linear Programming.295
E. Candes, M. Rudelson, T. Tao, and R. Vershynin
Error-Correcting Codes for Automatic Control.309
R. Ostrovsky, Y. Rabani, and L. Schulman
Almost Orthogonal Linear Codes are Locally Testable.317
T. Kaufman and S. Litsyn
On Delsarte's Linear Programming Bounds for Binary Codes.327
M. Navon and A. Samorodnitsky
Session 8
Chair: A. Goel
Fast Algorithms for Approximate Semidefinite Programming Using the Multiplicative
Weights Update Method.339
S. Arora, E. Hazan, and S. Kale
Improved Smoothed Analysis of the Shadow Vertex Simplex Method.349
A. Deshpande andD. Spielman
Sampling-based Approximation Algorithms for Multi-stage Stochastic Optimization.357
C. Swamy and D. Shmoys
How to Pay, Come What May: Approximation Algorithms for Demand-Robust
Covering Problems.367
K. Dhamdhere, V. Goyal, R. Ravi, and M. Singh
Session 9
Chair: D. Zuckerman
Group-theoretic Algorithms for Matrix Multiplication.379
H. Cohn, R. Kleinberg, B. Szegedy, and C. Umans
Answering Distance Queries in Directed Graphs Using Fast Matrix Multiplication.389
R. Yuster and U. Zwick
A Randomness-Efficient Sampler for Matrix-valued Functions and Applications.397
A. Wigderson and D. Xiao
Deterministic Extractors for Affine Sources over Large Fields.407
A. Gabizon and R. Raz
vii
Session 10 ,,,, V\ .p
Chair: Z. Bar-Yossef . . ., .
Additive Approximation for Edge-deletion Problems.419
N. Alon, A. Shapira, andB. Sudakov
A Characterization of the (Natural) Graph Properties Testable with One-sided Error.429
N. Alon and A. Shapira
An Algorithmic Version of the Hypergraph Regularity Method.439
P. Haxell, B. Nagle, and V Rod!
Session 11
Chair: J. Watrous
Cryptography in the Bounded Quantum-storage Model.449
I. Damgard, S. Fehr, L. Salvail, and C. Schaffner
Quantum Information and the PCP Theorem.459
R. Raz
From Optimal Measurement to Efficient Quantum Algorithms for the Hidden
Subgroup Problem over Semidirect Product Groups.469
D. Bacon, A. Childs, and W van Dam
The Symmetric Group Defies Strong Fourier Sampling.479
C. Moore, A. Russell, and L. Schulman
Session 12
Chair: F. McSherry
On Learning Mixtures of Heavy-Tailed Distributions.491
A. Dasgupta, J. Hopcroft, J. Kleinberg, and M Sandler
Learning Mixtures of Product Distributions over Discrete Domains.501
J. Feldman, R. O'Donnell, andR. Servedio
A General Lower Bound for Mixing of Single-site Dynamics on Graphs.511
T. Hayes and A. Sinclair
Analysis and Prediction of the Long-run Behavior of Probabilistic Sequential
Programs with Recursion.521
T. Brdzdil, J. Esparza, and A. Kucera
Safraless Decision Procedures. 53 j
O. Kupferman and M. Vardi
Session 13
Chair: R. Canetti
How to Play Almost Any Mental Game over the Net — Concurrent Composition via
Super-polynomial Simulation.
B. Barak and A. Sahai
On the Impossibility of Obfuscation with Auxiliary Input.
S. Goldwasser and Y. Kalai .
Concurrent Non-malleable Commitments.
R. Pass and A. Rosen .
Vlll
The Complexity of Online Memory Checking.573
M. Naor and G. Rothblum
Session 14
Chair: R. Lipton
Rational Secure Computation and Ideal Mechanism Design.585
S. Izmalkov, S. Micali, and M. Lepinski
Truthful and Near-optimal Mechanism Design via Linear Programming.595
R, Lavi and C. Swamy
Mechanism Design via Machine Learning.605
M.-F. Balcan, A. Blum, J. Hartline, and 7. Mansour
Beyond VCG: Frugality of Truthful Mechanisms.615
A. Karlin, D. Kempe, and T. Tamir
Session 15
Chair: M. Yannakakis
An Approximation Algorithm for the Disjoint Paths Problem in Even-degree Planar Graphs.627
J. Kleinberg
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring.637
E. Demaine, M. Hajiaghayi, and K.-I. Kawarabayashi
A Linear-time Approximation Scheme for Planar Weighted TSP.647
P. Klein
A Tale of Two Dimensional Bin Packing.657
N. Bansal, A. Lodi, and M. Sviridenko
Author Index.667
ix |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author_corporate | Symposium on Foundations of Computer Science Pittsburgh, Pa |
| author_corporate_role | aut |
| author_facet | Symposium on Foundations of Computer Science Pittsburgh, Pa |
| author_sort | Symposium on Foundations of Computer Science Pittsburgh, Pa |
| building | Verbundindex |
| bvnumber | BV020854253 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76 |
| callnumber-search | QA76 |
| callnumber-sort | QA 276 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SS 2005 |
| ctrlnum | (OCoLC)62771432 (DE-599)BVBBV020854253 |
| discipline | Informatik |
| discipline_str_mv | 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">BV020854253</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20060503</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">051103s2005 xx a||| |||| 10||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0769523625</subfield><subfield code="9">0-7695-2362-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0769524680</subfield><subfield code="9">0-7695-2468-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)62771432</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV020854253</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-29T</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76</subfield></datafield><datafield tag="111" ind1="2" ind2=" "><subfield code="a">Symposium on Foundations of Computer Science</subfield><subfield code="n">46</subfield><subfield code="d">2005</subfield><subfield code="c">Pittsburgh, Pa.</subfield><subfield code="j">Verfasser</subfield><subfield code="0">(DE-588)6048198-5</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">46th Annual IEEE Symposium on Foundations of Computer Science</subfield><subfield code="b">FOCS 2005 ; 23 - 25 October 2005, Pittsburgh, Pennsylvania, USA</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">FOCS 2005</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Foundations of computer science</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">46th 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.</subfield><subfield code="c">2005</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIII, 668 S.</subfield><subfield code="b">Ill.</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">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="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">2005</subfield><subfield code="z">Pittsburgh Pa.</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="856" ind1="4" ind2="2"><subfield code="m">HBZ Datenaustausch</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=014175938&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-014175938</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 2005 Pittsburgh Pa. gnd-content |
| genre_facet | Konferenzschrift 2005 Pittsburgh Pa. |
| id | DE-604.BV020854253 |
| illustrated | Illustrated |
| index_date | 2024-07-02T13:20:45Z |
| indexdate | 2025-01-10T13:18:44Z |
| institution | BVB |
| institution_GND | (DE-588)6048198-5 |
| isbn | 0769523625 0769524680 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-014175938 |
| oclc_num | 62771432 |
| open_access_boolean | |
| owner | DE-384 DE-29T |
| owner_facet | DE-384 DE-29T |
| physical | XIII, 668 S. Ill. |
| publishDate | 2005 |
| publishDateSearch | 2005 |
| publishDateSort | 2005 |
| publisher | IEEE Computer Soc. |
| record_format | marc |
| spelling | Symposium on Foundations of Computer Science 46 2005 Pittsburgh, Pa. Verfasser (DE-588)6048198-5 aut 46th Annual IEEE Symposium on Foundations of Computer Science FOCS 2005 ; 23 - 25 October 2005, Pittsburgh, Pennsylvania, USA FOCS 2005 Foundations of computer science 46th Annual Symposium on Foundations of Computer Science Los Alamitos, Calif. [u.a.] IEEE Computer Soc. 2005 XIII, 668 S. Ill. txt rdacontent n rdamedia nc rdacarrier Datenverarbeitung Electronic data processing Congresses Machine theory Congresses Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 2005 Pittsburgh Pa. gnd-content Theoretische Informatik (DE-588)4196735-5 s DE-604 HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=014175938&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | 46th Annual IEEE Symposium on Foundations of Computer Science FOCS 2005 ; 23 - 25 October 2005, Pittsburgh, Pennsylvania, USA Datenverarbeitung Electronic data processing Congresses Machine theory Congresses Theoretische Informatik (DE-588)4196735-5 gnd |
| subject_GND | (DE-588)4196735-5 (DE-588)1071861417 |
| title | 46th Annual IEEE Symposium on Foundations of Computer Science FOCS 2005 ; 23 - 25 October 2005, Pittsburgh, Pennsylvania, USA |
| title_alt | FOCS 2005 Foundations of computer science 46th Annual Symposium on Foundations of Computer Science |
| title_auth | 46th Annual IEEE Symposium on Foundations of Computer Science FOCS 2005 ; 23 - 25 October 2005, Pittsburgh, Pennsylvania, USA |
| title_exact_search | 46th Annual IEEE Symposium on Foundations of Computer Science FOCS 2005 ; 23 - 25 October 2005, Pittsburgh, Pennsylvania, USA |
| title_exact_search_txtP | 46th Annual IEEE Symposium on Foundations of Computer Science FOCS 2005 ; 23 - 25 October 2005, Pittsburgh, Pennsylvania, USA |
| title_full | 46th Annual IEEE Symposium on Foundations of Computer Science FOCS 2005 ; 23 - 25 October 2005, Pittsburgh, Pennsylvania, USA |
| title_fullStr | 46th Annual IEEE Symposium on Foundations of Computer Science FOCS 2005 ; 23 - 25 October 2005, Pittsburgh, Pennsylvania, USA |
| title_full_unstemmed | 46th Annual IEEE Symposium on Foundations of Computer Science FOCS 2005 ; 23 - 25 October 2005, Pittsburgh, Pennsylvania, USA |
| title_short | 46th Annual IEEE Symposium on Foundations of Computer Science |
| title_sort | 46th annual ieee symposium on foundations of computer science focs 2005 23 25 october 2005 pittsburgh pennsylvania usa |
| title_sub | FOCS 2005 ; 23 - 25 October 2005, Pittsburgh, Pennsylvania, USA |
| topic | Datenverarbeitung Electronic data processing Congresses Machine theory Congresses Theoretische Informatik (DE-588)4196735-5 gnd |
| topic_facet | Datenverarbeitung Electronic data processing Congresses Machine theory Congresses Theoretische Informatik Konferenzschrift 2005 Pittsburgh Pa. |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=014175938&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT symposiumonfoundationsofcomputersciencepittsburghpa 46thannualieeesymposiumonfoundationsofcomputersciencefocs20052325october2005pittsburghpennsylvaniausa AT symposiumonfoundationsofcomputersciencepittsburghpa focs2005 AT symposiumonfoundationsofcomputersciencepittsburghpa foundationsofcomputerscience AT symposiumonfoundationsofcomputersciencepittsburghpa 46thannualsymposiumonfoundationsofcomputerscience |