close
1.

図書

図書
sponsored by ACM SIGMOBILE ... [et al.] ; in cooperation with ACM SIGACT
出版情報: New York : Association for Computing Machinery, c2000  104 p. ; 28 cm
所蔵情報: loading…
2.

図書

図書
sponsored by ACM SIGACT, ACM SIGARCH ; in cooperation with EATCS
出版情報: New York : Association for Computing Machinery, c2002  viii, 294 p. ; 28 cm
所蔵情報: loading…
3.

図書

図書
Gene Myers ... [et al.], editors ; sponsored by Association for Computing Machinery, SIGACT ; with support from Celera ... [et al.]
出版情報: New York, N.Y. : Association for Computing Machinery, c2002  viii, 331 p. ; 28 cm
所蔵情報: loading…
4.

図書

図書
Thomas Lengauer ... [et al.], editors ; sponsored by Association for Computing Machinery, SIGACT ; with support from Celera Genomics ... [et al.]
出版情報: New York, N.Y. : Association for Computing Machinery, c2001  ix, 316 p. ; 28 cm
所蔵情報: loading…
5.

図書

図書
sponsored by IEEE Computer Society Technical Committee on Mathematical Foundations of Computing (TCMF) ; in cooperation with ACM SIGACT
出版情報: Los Alamitos, Calif. : IEEE Computer Society, c2005  x, 355 p. ; 28 cm
所蔵情報: loading…
6.

図書

図書
sponsored by IEEE Computer Society Technical Committee on Mathematical Foundations of Computing (TCMF) ; in cooperation with ACM SIGACT
出版情報: Los Alamitos, Calif. : IEEE Computer Society, c2004  xi, 333 p. ; 28 cm
所蔵情報: loading…
目次情報: 続きを見る
Preface
Committees
Awards
ECCC 10th Anniversary
Compression of Samplable Sources / L. Trevisan ; S. Vadhan ; D. ZuckermanSession 1:
Language Compression and Pseudorandom Generators / H. Buhrman ; T. Lee ; D. van Melkebeek
On Pseudoentropy versus Compressibility / H. Wee
Reductions between Disjoint NP-Pairs / C. Glasser ; A. Selman ; S. SenguptaSession 2:
Relativized NP Search Problems and Propositional Proof Systems / J. Buresh-Oppenheim ; T. Morioka
The Complexity of Treelike Systems over [lambda]-Local Formulae / N. Galesi ; N. Thapen
Lower Bounds for Testing Bipartiteness in Dense Graphs / A. BogdanovSession 3:
Polylogarithmic-round Interactive Proofs for coNP Collapse the Exponential Hierarchy
Solvable Group Isomorphism is (almost) in NP [intersection of] CoNP / V. Arvind ; J. Toran
Small Spans in Scaled Dimension / J. Hitchcock
Computing in Fault Tolerance Broadcast Networks / I. NewmanSession 4:
Some Results on Majority Quantifiers over Words / K.-J. Lange
Separating Complexity Classes Using Structural Properties / L. Torenvliet
Parameterized Complexity of Constraint Satisfaction Problems / D. MarxSession 5:
Tight Lower Bounds for Certain Parameterized NP-Hard Problems / J. Chen ; B. Chor ; M. Fellows ; X. Huang ; D. Juedes ; I. Kanj ; G. Xia
The Complexity of the Covering Radius Problem on Lattices and Codes / V. Guruswami ; D. Micciancio ; O. Regev
Dimension, Entropy Rates, and Compression / N. VinodchandranSession 6:
Properties of NP-Complete Sets / A. Pavan
Partial Bi-immunity and NP-Completeness
Abelian Permutation Group Problems and Logspace Counting Classes / T. VijayaraghavanSession 7:
Deterministic Polynomial Identity Testing in Non-commutative Models / R. Raz ; A. Shpilka
Polynomials That Sign Represent Parity and Descartes Rule of Signs / S. Basu ; N. Bhatnagar ; P. Gopalan ; R. Lipton
Consequences and Limits of Nonlocal Strategies / R. Cleve ; P. Hoyer ; B. Toner ; J. WatrousSession 8:
Multiparty Quantum Coin Flipping / A. Ambainis ; Y. Dodis ; H. Rohrig
On the Power of Quantum Proofs
Quantum Arthur-Merlin Games / C. Marriott
Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go? / X. Sun ; A. Yao ; S. ZhangSession 9:
Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments / S. Laplante ; F. Magniez
Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information / K. Yang
Limitations of Quantum Advice and One-Way Communication / S. Aaronson
Author Index
Preface
Committees
Awards
7.

図書

図書
sponsored by IEEE Computer Society Technical Society on Foundations of Computing
出版情報: Los Alamitos, Calif. ; Tokyo : IEEE Computer Society, c2004  xiv, 632 p. ; 28 cm
所蔵情報: loading…
目次情報: 続きを見る
Foreword
Conference Organization and Program Committee
Reviewers
Quantum Weak Coin-Flipping with Bias of 0.192 / C. MochonSession 1:
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs / H. Klauck ; R. Spalek ; R. de Wolf
Quantum Walk Algorithm for Element Distinctness / A. Ambainis
Quantum Speed-Up of Markov Chain Based Algorithms / M. Szegedy
Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation / D. Aharonov ; W. van Dam ; J. Kempe ; Z. Landau ; S. Lloyd ; O. Regev
Maximizing Quadratic Programs: Extending Grothendieck's Inequality / M. Charikar ; A. WirthSession 2:
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem / L. Lau
Edge-Disjoint Paths in Planar Graphs / C. Chekuri ; S. Khanna ; F. Shepherd
Machine Minimization for Scheduling Jobs with Interval Constraints / J. Chuzhoy ; S. Guha ; J. Naor
Random Edge Can Be Exponential on Abstract Cubes / J. Matousek ; T. SzaboSession 3:
On the Integrality Ratio for Asymmetric TSP / M. Goemans ; H. Karloff
The Hardness of Metric Labeling
Hardness of Buy-at-Bulk Network Design / M. Andrews
Hardness of Approximating the Shortest Vector Problem in Lattices / S. KhotSession 4:
Ruling Out PTAS for Graph Min-Bisection, Densest Subgraph and Bipartite Clique
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs? / G. Kindler ; E. Mossel ; R. O'Donnell
Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem / I. Dinur ; O. Reingold
Cryptography in NC[superscript 0] / B. Applebaum ; Y. Ishai ; E. KushilevitzSession 5:
An Unconditional Study of Computational Zero Knowledge / S. Vadhan
Universally Composable Protocols with Relaxed Set-Up Assumptions / B. Barak ; R. Canetti ; J. Nielsen ; R. Pass
On the (Im)possibility of Cryptography with Imperfect Randomness / Y. Dodis ; S. Ong ; M. Prabhakaran ; A. Sahai
Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity / B. Dean ; J. VondrakSession 6:
An Edge in Time Saves Nine: LP Rounding Approximation Algorithms for Stochastic Network Design / A. Gupta ; R. Ravi ; A. Sinha
Stochastic Optimization is (Almost) as easy as Deterministic Optimization / D. Shmoys ; C. Swamy
O([radical]log n) Approximation to SPARSEST CUT in O(n[superscript 2]) Time / S. Arora ; E. Hazan ; S. Kale
Maximum Matchings via Gaussian Elimination / M. Mucha ; P. Sankowski
Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game / R. Savani ; B. von StengelSession 7:
Edge Pricing of Multicommodity Networks for Heterogeneous Selfish Users / G. Karakostas ; S. Kolliopoulos
Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games / L. Fleischer ; K. Jain ; M. Mahdian
A Polynomial Time Algorithm for Computing the Arrow-Debreu Market Equilibrium for Linear Utilities
The Price of Stability for Network Design with Fair Cost Allocation / E. Anshelevich ; A. Dasgupta ; J. Kleinberg ; E. Tardos ; T. Wexler ; T. Roughgarden
Holographic Algorithms (Extende Abstract) / L. ValiantSession 8:
Hierarchy Theorems for Probabilistic Polynomial Time / L. Fortnow ; R. Santhanam
Private Codes or Succinct Random Codes That Are (Almost) Perfect / M. Langberg
On the List and Bounded Distance Decodibility of the Reed-Solomon Codes (Extended Abstract) / Q. Cheng ; D. Wan
Multilinear-NC[subscript 1 not equal]Multilinear-NC[subscript 2] / R. RazSession 9:
Algebras with Polynomial Identities and Computing the Determinant / S. Chien ; A. Sinclair
Lattice Problems in NP [intersection of]coNP
Worst-Case to Average-Case Reductions Based on Gaussian Measures / D. Micciancio
Extracting Randomness Using Few Independent Sources / R. Impagliazzo ; A. WigdersonSession 10:
Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed / A. Gabizon ; R. Shaltiel
Constructing Expander Graphs by 2-Lifts and Discrepancy vs. Spectral Gap / Y. Bilu ; N. Linial
Testing Polynomials over General Fields / T. Kaufman ; D. Ron
Testing Low-Degree Polynomials over Prime Fields / C. Jutla ; A. Patthak ; A. Rudra ; D. Zuckerman
Measured Descent: A New Embedding Method for Finite Metrics / R. Krauthgamer ; J. Lee ; M. Mendel ; A. NaorSession 11:
Triangulation and Embedding Using Small Sets of Beacons / A. Slivkins
A Simple Linear Time (1 + [varepsilon])-Approximation Algorithm for k-Means Clustering in Any Dimensions / A. Kumar ; Y. Sabharwal ; S. Sen
On the Power of Discrete and of Lexicographic Helly-Type Theorems / N. Halman
An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching / A. Chakrabarti
Dynamic Optimality--Almost / E. Demaine ; D. Harmon ; J. Iacono ; M. PatrascuSession 12:
No Sorting? Better Searching! / G. Franceschini ; R. Grossi
Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs / L. Roditty ; U. Zwick
Dynamic Transitive Closure via Dynamic Matrix Inverse (Extended Abstract)
Dynamic Speed Scaling to Manage Energy and Temperature / N. Bansal ; T. Kimbrel ; K. PruhsSession 13:
Optimal Power-Down Strategies / J. Augustine ; S. Irani
On the Streaming Model Augmented with a Sorting Primitive / G. Aggarwal ; M. Datar ; S. Rajagopalan ; M. Ruhl
Approximating Edit Distance Efficiently / Z. Bar-Yossef ; T. Jayram ; R. Kumar
Strong Spatial Mixing for Lattice Graphs with Fewer Colours / L. Goldberg ; R. Martin ; M. PatersonSession 14:
Shuffling by Semi-Random Transpositions / Y. Peres
Randomly Coloring Constant Degree Graphs / M. Dyer ; A. Frieze ; T. Hayes ; E. Vigoda
The Exact Satisfiability Threshold for a Potentially Intractible Random Constraint Satisfaction Problem / H. Connamacher ; M. Molloy
Spectral Analysis of Random Graphs with Skewed Degree Distributions / J. Hopcroft ; F. McSherrySession 15:
Learning with Errors in Answers to Membership Queries (Extended Abstract) / L. Bisht ; N. Bshouty ; L. Khoury
Learnability and Automatizability / M. Alekhnovich ; M. Braverman ; V. Feldman ; A. Klivans ; T. Pitassi
Author Index
Foreword
Conference Organization and Program Committee
Reviewers
8.

図書

図書
sponsored by ACM SIGACT, ACM SIGARCH ; in cooperation with European Association for Theoretical Computer Science & Intel corporation
出版情報: New York : Association for Computing Machinery, c2004  x, 322 p. ; 28 cm
所蔵情報: loading…
9.

図書

図書
sponsored by the ACM Special Interest Group for Automata and Computability Theory, and ACM Special Interest Group for Operating System Principles
出版情報: New York, N.Y. : Association for Computing Machinery, c1997  viii, 297 p. ; 28 cm
所蔵情報: loading…
10.

図書

図書
sponsored by the ACM Special Interest Group for Automata and Computability Theory, and ACM Special Interest Group for Operating System Principles
出版情報: New York, N.Y. : Association for Computing Machinery, c1998  x, 328 p. ; 28 cm
所蔵情報: loading…
11.

図書

図書
sponsored by ACM SIGACT, ACM SIGARCH ; in cooperation with EATCS
出版情報: New York : Association for Computing Machinery, c1998  viii, 310 p. ; 28 cm
所蔵情報: loading…
12.

図書

図書
sponsored by ACM SIGACT, ACM SIGARCH ; in cooperation with EATCS
出版情報: New York : Association for Computing Machinery, c2000  vii, 224 p. ; 28 cm
所蔵情報: loading…
13.

図書

図書
sponsored by IEEE Computer Society Technical Committee on Mathematical Foundations of Computing ; in cooperation with ACM-SIGACT, EATCS
出版情報: Los Alamitos, Calif. : IEEE Computer Society, c1999  x, 241 p. ; 28 cm
所蔵情報: loading…
14.

図書

図書
sponsored by IEEE Computer Society Technical Committee for Mathematical Foundations of Computing ; in cooperation with ACM-SIGACT, EATCS
出版情報: Los Alamitos, Calif. : IEEE Computer Society, c2000  x, 279 p. ; 28 cm
所蔵情報: loading…
目次情報: 続きを見る
Preface
Committees
Ron Book Prize for Best Student Paper
Time-Space Tradeoff Lower Bounds for Non-Uniform Computation / P. Beame
Time-Space Tradeoffs for Nondeterministic Computation / L. Fortnow ; D. van Melkebeek
A Lower Bound for the Shortest Path Problem / K. Mulmuley ; P. Shah
Time-Space Lower Bounds for SAT on Uniform and Non-Uniform Machines / I. Tourlakis
BP (f) = O (L (f)[superscript 1+varepsilon]) / O. Giel
The Communication Complexity of Enumeration, Elimination, and Selection / A. Ambainis ; H. Buhrman ; W. Gasarch ; B. Kalyanasundaram ; L. Torenvliet
The Query Complexity of Order-Finding / R. Cleve
On the Complexity of Some Problems on Groups Input as Multiplication Tables / D. Barrington ; P. Kadau ; K-J. Lange ; P. McKenzie
The Complexity of Tensor Calculus / C. Damm ; M. Holzer
The Complexity of Verifying the Characteristic Polynomial and Testing Similarity / T. Hoang ; T. Thierauf
A Dual Version of Reimer's Inequality and a Proof of Rudich's Conjecture / J. Kahn ; M. Saks ; C. Smyth
Computational Complexity and Phase Transitions / G. Istrate
An Application of Matroid Theory to the SAT Problem / O. Kullmann
New Bounds for the Language Compression Problem / S. Laplante ; P. Miltersen
Combinatorial Interpretation of Kolmogorov Complexity / A. Romashchenko ; A. Shen ; N. Vereshchagin
Independent Minimum Length Programs to Translate between Given Strings / N. Vereschagin ; M. Vyugin
A Survey of Optimal PCP Characterizations of NP / L. Trevisan
Easiness Assumptions and Hardness Tests: Trading Time for Zero Error / V. Kabanets
Dimension in Complexity Classes / J. Lutz
Average Case Complexity of Unbounded Fanin Circuits / A. Jakoby ; R. Reischuk
On the Hardness of 4-Coloring a 3-Colorable Graph / V. Guruswami ; S. Khanna
Deciding the K-Dimension is PSPACE-Complete / M. Schaefer
Integer Circuit Evaluation is PSPACE-Complete / K. Yang
A Separation of Determinism, Las Vegas and Nondeterminism for Picture Recognition / P. Duris ; J. Hromkovic ; K. Inoue
On the Complexity of Intersecting Finite State Automata / G. Karakostas ; R. Lipton ; A. Viglas
On the Complexity of the Monotonicity Verification / A. Voronenko
What Complexity and Cryptography Can Teach Each Other / R. Impagliazzo
Quantum Kolmogorov Complexity / A. Berthiaume ; W. van Dam
On the Complexity of Quantum ACC / F. Green ; S. Homer ; C. Pollett
Three Approaches to the Quantitative Definition of Information in an Individual Pure Quantum State / P. Vitanyi
Characterization of Non-Deterministic Quantum Query and Quantum Communication Complexity / R. de Wolf
Author Index
Preface
Committees
Ron Book Prize for Best Student Paper
15.

図書

図書
sponsored by ACM SIGACT, ACM SIGARCH ; in cooperation with EATCS
出版情報: New York : Association for Computing Machinery, c1999  x, 261 p. ; 28 cm
所蔵情報: loading…
16.

図書

図書
sponsored by the ACM Special Interest Group for Automata and Computability Theory, and Special Interest Group for Operating System Principles
出版情報: New York, N.Y. : Association for Computing Machinery , Baltimore, MD : Copies from ACM Order Dept., c1985  iv, 316 p. ; 28 cm
所蔵情報: loading…
17.

図書

図書
sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing ; in cooperation with ACM-SIGACT and EATCS ; with support from Ulmer Univeritäts-Gesellschaft ... [et al.]
出版情報: Los Alamitos, Calif. : IEEE Computer Society, c1997  x, 315 p. ; 28 cm
所蔵情報: loading…
18.

図書

図書
editors, Webb Miller ... [et al.] ; under the patronage of Edelgard Bulmahn ; sponsored by Association for Computing Machinery & SIGACT ; with support from the German Federal Ministry for Education and Research ... [et al.]
出版情報: New York, N.Y. : Association for Computing Machinery, c2003  x, 341 p. ; 28 cm
所蔵情報: loading…
19.

図書

図書
sponsored by IEEE Computer Society Technical society on Foundations of Computing
出版情報: Los Alamitos, Calif. ; Tokyo : IEEE Computer Society, c2003  xiii, 661 p. ; 28 cm
所蔵情報: loading…
目次情報: 続きを見る
Foreword
Conference Organization and Program Committee
Reviewers
Machine Learning: My Favorite Results, Directions, and Open Problems / A. BlumTutorial 1:
Mixing / D. RandallTutorial 2:
Performance Analysis of Dynamic Network Processes / E. UpfalTutorial 3:
A Polynomial Algorithm for Recognizing Perfect Graphs / G. Cornuejols ; X. Liu ; K. VuskovicSession 1:
On Certain Connectivity Properties of the Internet Topology / M. Mihail ; C. Papadimitriou ; A. Saberi
Paths, Trees, and Minimum Latency Tours / K. Chaudhuri ; B. Godfrey ; S. Rao ; K. Talwar
Approximation Algorithms for Orienteering and Discounted-Reward TSP / S. Chawla ; D. Karger ; T. Lane ; A. Meyerson ; M. Minkoff
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs / H. Kaplan ; M. Lewenstein ; N. Shafrir ; M. Sviridenko
On the Implementation of Huge Random Objects / O. Goldreich ; S. Goldwasser ; A. NussboimSession 2:
Zero-Knowledge Sets / S. Micali ; M. Rabin ; J. Kilian
Deterministic Extractors for Bit-Fixing Sources and Exposure-Resilient Cryptography / J. Kamp ; D. Zuckerman
On the (In)security of the Fiat-Shamir Paradigm / Y. Kalai
Locally Testable Cyclic Codes / L. Babai ; A. Shpilka ; D. StefankovicSession 3:
List Decoding Using the XOR Lemma / L. Trevisan
On [eta]-Biased Generators in NC[superscript 0] / E. Mossel
Proving Hard-Core Predicates Using List Decoding / A. Akavia ; S. Safra
Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model / R. Bhattacharjee ; A. GoelSession 4:
Proofs of the Parisi and Coppersmith-Sorkin Conjectures for the Finite Random Assignment Problem / C. Nair ; B. Prabhakar ; M. Sharma
Always Good Turing: Asymptotically Optimal Probability Estimation / A. Orlitsky ; N. Santhanam ; J. Zhang
Learning DNF from Random Walks / N. Bshouty ; R. O'Donnell ; R. Servedio
Quantum Search of Spatial Regions / S. Aaronson ; A. AmbainisSession 5:
A Lattice Problem in Quantum NP / D. Aharonov ; O. Regev
A Lower Bound for Bounded Round Quantum Communication Complexity of Set Disjointness / R. Jain ; J. Radhakrishnan ; P. Sen
Polynomial Degree vs. Quantum Query Complexity
An In-Place Sorting with O(n log n) Comparisons and O(n) Moves / G. Franceschini ; V. GeffertSession 6:
Breaking a Time-and-Space Barrier in Constructing Full-Text Indices / W.-K. Hon ; K. Sadakane ; W.-K. Sung
I/O-Efficient Strong Connectivity and Depth-First Search for Directed Planar Graphs / L. Arge ; N. Zeh
The Cost of Cache-Oblivious Searching / M. Bender ; G. Brodal ; R. Fagerberg ; D. Ge ; S. He ; H. Hu ; J. Iacono ; A. Lopez-Ortiz
Tight Lower Bounds for the Distinct Elements Problem / P. Indyk ; D. Woodruff
Hardness of Approximating the Shortest Vector Problem in High L[subscript p] Norms / S. KhotSession 7:
More on Average Case vs Approximation Complexity / M. Alekhnovich
On Worst-Case to Average-Case Reductions for NP Problems / A. Bogdanov
Rank Bounds and Integrality Gaps for Cutting Planes Procedures / J. Buresh-Oppenheim ; N. Galesi ; S. Hoory ; A. Magen ; T. Pitassi
The Resolution Complexity of Random Constraint Satisfaction Problems / M. Molloy ; M. SalavatipourSession 8:
Algorithms and Complexity Results for #SAT and Bayesian Inference / F. Bacchus ; S. Dalmao
Linear Upper Bounds for Random Walk on Small Density Random 3-CNFs / E. Ben-Sasson
On the Maximum Satisfiability of Random Formulas / D. Achlioptas ; A. Naor ; Y. Peres
Logics for Reasoning about Cryptographic Constructions / R. Impagliazzo ; B. KapronSession 9:
Lower Bounds for Non-Black-Box Zero Knowledge / B. Barak ; Y. Lindell ; S. Vadhan
General Composition and Universal Composability in Secure Multi-Party Computation
Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds / R. Pass ; A. Rosen
Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time O(m[superscript 1.31]) / D. Spielman ; S.-H. TengSession 10:
Separating the Power of Monotone Span Programs over Different Fields / A. Beimel ; E. Weinreb
A Group-Theoretic Approach to Fast Matrix Multiplication / H. Cohn ; C. Umans
Symmetric Polynomials over Z[subscript m] and Simultaneous Communication Protocols / N. Bhatnagar ; P. Gopalan ; R. Lipton
Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm / L. Becchetti ; S. Leonardi ; A. Marchetti-Spaccamela ; G. Schafer ; T. VredeveldSession 11:
Stability and Efficiency of a Random Local Load Balancing Protocol / A. Anagnostopoulos ; A. Kirsch
Gossip-Based Computation of Aggregate Information / D. Kempe ; A. Dobra ; J. Gehrke
Broadcasting Algorithms in Radio Networks with Unknown Topology / A. Czumaj ; W. Rytter
Switch Scheduling via Randomized Edge Coloring / G. Aggarwal ; R. Motwani ; D. Shah ; A. Zhu
On the Impossibility of Dimension Reduction in l1 / B. Brinkman ; M. CharikarSession 12:
Clustering with Qualitative Information / V. Guruswami ; A. Wirth
Bounded Geometries, Fractals, and Low-Distortion Embeddings / A. Gupta ; R. Krauthgamer ; J. Lee
On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences / T. Chan
The Complexity of Homomorphism and Constraint Satisfaction Problems Seen from the Other Side / M. GroheSession 13:
Towards a Dichotomy Theorem for the Counting Constraint Satisfaction Problem / A. Bulatov ; V. Dalmau
Towards a Characterization of Truthful Combinatorial Auctions / R. Lavi ; A. Mu'alem ; N. NisanSession 14:
Group Strategyproof Mechanisms via Primal-Dual Algorithms / M. Pal ; E. Tardos
The Value of Knowing a Demand Curve: Bounds on Regret for Online Posted-Price Auctions / R. Kleinberg ; T. Leighton
Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem / A. Kumar ; T. Roughgarden
A Non-Markovian Coupling for Randomly Sampling Colorings / T. Hayes ; E. VigodaSession 15:
The Ising Model on Trees: Boundary Conditions and Mixing Time / F. Martinelli ; A. Sinclair ; D. Weitz
Logconcave Functions: Geometry and Efficient Sampling Algorithms / L. Lovasz ; S. Vempala
Simulated Annealing in Convex Bodies and an O*(n[superscript 4]) Volume Algorithm
Author Index
Foreword
Conference Organization and Program Committee
Reviewers
20.

図書

図書
sponsored by ACM SIGACT
出版情報: New York : Association for Computing Machinery, c2002  vi, 106 p. ; 28 cm
所蔵情報: loading…
21.

図書

図書
sponsored by IEEE Computer Society Technical Committee on Mathematical Foundations of Computing (TCMF) ; in cooperation with ACM/SIGACT
出版情報: Los Alamitos, Calif. ; Tokyo : IEEE Computer Society, c2002  xvi, 813 p. ; 28 cm
所蔵情報: loading…
22.

図書

図書
sponsored by ACM SIGACT
出版情報: New York : Association for Computing Machinery, c2003  vi, 106 p. ; 28 cm
所蔵情報: loading…
23.

図書

図書
sponsored by ACM SIGACT ; edited by Sabrina Da Capitani di Vimercati and Pierangela Samarati
出版情報: New York : Association for Computing Machinery, c2003  vi, 110 p. ; 28 cm
所蔵情報: loading…
24.

図書

図書
sponsored by ACM SIGACT, ACM SIGARCH ; in cooperation with EATCS(European Association for Theoretical Computer Science)
出版情報: New York : Association for Computing Machinery, c2003  x, 366 p. ; 28 cm
所蔵情報: loading…
25.

図書

図書
sponsored by ACM SIGACT, ACM SIGARCH ; in cooperation with EATCS
出版情報: New York : Association for Computing Machinery, c1994  ix, 374 p. ; 28 cm
所蔵情報: loading…
26.

図書

図書
sponsored by ACM SIGACT, ACM SIGARCH ; in cooperation with EATCS
出版情報: New York : Association for Computing Machinery, c2001  xi, 340 p. ; 28 cm
所蔵情報: loading…
27.

図書

図書
sponsored by the ACM Special Interest Group for Automata and Computability Theory, and Special Interest Group for Operating System Principles
出版情報: New York, NY : Association for Computing Machinery , Baltimore, MD : Order from ACM Order Dept., c1984  iv, 301 p. ; 28 cm
所蔵情報: loading…
28.

図書

図書
sponsored by the Association for Computing Machinery, Special Interest Group on Automata and Computability Theory (SIGACT) [and] Special Interest Group on Programming Languages (SIGPLAN)
出版情報: New York, N.Y. : ACM , Baltimore, MD : May be ordered from ACM Order Dept., c1988  iv, 329 p. ; 28 cm
所蔵情報: loading…
29.

図書

図書
sponsored by the IEEE Computer Society's Technical Committee on Mathematical Foundations of Computing, in cooperation with the ACM Special Interest Group for Automata and Computability Theory, and Brown University
出版情報: New York, N.Y. : Institute of Electrical and Electronics Engineers, c1977  v, 269 p. ; 28 cm
所蔵情報: loading…
30.

図書

図書
sponsored by the ACM Special Interest Group for Automata and Computability Theory
出版情報: New York : ACM, c1987  viii, 471 p. ; 28 cm
所蔵情報: loading…
31.

図書

図書
sponsored by the Association for Computing Machinery, Special Interest Group on Automata and Computability Theory (SIGACT) [and] Special Interest Group on Programming Languages (SIGPLAN)
出版情報: New York, N.Y. : ACM , Baltimore, MD : May be ordered from ACM Order Dept., c1984  ii, 340 p. ; 28 cm
所蔵情報: loading…
32.

図書

図書
sponsored by the Association for Computing Machinery, Special Interest Group on Automata and Computability Theory, with the cooperation of the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing, and the Pennsylvania State University
出版情報: New York : Assciation for Computing Machinery, c1976  246 p. ; 28 cm
所蔵情報: loading…
33.

図書

図書
sponsored by the Association for Coomputing Machinery, Special Interest Group on Automata and Computability Theory, Special Interest Group on Programming Languages
出版情報: New York : ACM, 1984  vi, 302 p. ; 28 cm
所蔵情報: loading…
34.

図書

図書
sponsored by the ACM Special Interest Group for Automata and Computability Theory, and Special Interest Group for Operating System Principles
出版情報: New York, N.Y. : Association for Computing Machinery , Baltimore, MD : Copies from ACM Order Dept., c1986  iv, 293 p. ; 28 cm
所蔵情報: loading…
35.

図書

図書
Special Interest Group for Automata and Computability Theory (SIGACT), Special Interest Group for the Managemant of Data (SIGMOD), Special Interest Group for Artificial Intelligence (SIGART)
出版情報: New York, N.Y. : Association for Computing Machinery, c1987  vii, 363 p. ; 28 cm
所蔵情報: loading…
36.

図書

図書
sponsored by the ACM Special Interest Group for Automata and Computability Theory
出版情報: New York : ACM, c1985  vi, 484 p. ; 28 cm
所蔵情報: loading…
37.

図書

図書
sponsored by the Association for Computing Machinery Special Interest Group on Automata and Computability Theory [and] Special Interest Group on Programming Languages
出版情報: [New York] : The Association, c1973  iv, 242 p. ; 28 cm
所蔵情報: loading…
38.

雑誌

雑誌
ACM Special Interest Committee on Automata Theory and Computability
出版情報: New York : ACM Special Interest Group on Automa and Computability Theory
巻次年月次: No. 5 (May 1970)-no. 17 (Oct. 1972) ; V. 5, no. 1 (Jan. 1973)-
所蔵情報: loading…
39.

図書

図書
sponsored by ACM SIGACT, with support from SLOAN Foundation US Department of Energy
出版情報: New York, N.Y. : ACM Press, c1997  xvi, 354 p. ; 28 cm
所蔵情報: loading…
40.

図書

図書
sponsored by IEEE Computer Society, IEEE Computer Society Technical Committee on Mathematical Foundations of Computing ; in cooperation with ACM SIGACT, EATCS ; with support from State University of New York at Buffalo ; edited by Steve Homer and Jin-Yi Cai
出版情報: Los Alamitos : IEEE Computer Society Press, c1996  x, 307 p. ; 28 cm
所蔵情報: loading…
41.

図書

図書
sponsored by IEEE Computer Society Technical Committee on Mathematical Foundations of Computing ; in cooperation with ACM Special Interest Group on Automata and Computability Theory, The Association for Symbolic Logic, The European Association for Theoretical Computer Science ; with support from AT & T Research Bell Laboratories - Lucent Technologies DIMACS, IBM Almaden Research Center
出版情報: Los Alamitos, Calif. ; Tokyo : IEEE Computer Society Press, c1996  xv, 535 p. ; 28 cm
所蔵情報: loading…
42.

図書

図書
sponsored by the ACM Special Interest Group for Automata and Computability Theory, and ACM Special Interest Group for Operating System Principles
出版情報: New York, N.Y. : Association for Computing Machinery, c1996  xi, 344 p. ; 28 cm
所蔵情報: loading…
43.

図書

図書
sponsored by IEEE Computer Society Technical Committee on Mathematical Foundations of Computing ; in cooperation with ACM SIGACT, EATCS ; with support from DIMACS, University of Minnesota, Cornell University
出版情報: Los Alamitos : IEEE Computer Society Press, c1995  x, 331 p. ; 28 cm
所蔵情報: loading…
44.

図書

図書
sponsored by the ACM Special Interest Group for Automata and Computability Theory, and ACM Special Interest Group for Operating System Principles
出版情報: New York, N.Y. : Association for Computing Machinery, c1995  viii, 276 p. ; 28 cm
所蔵情報: loading…
45.

図書

図書
sponsored by ACM SIGACT, ACM SIGARCH ; in cooperation with EATCS
出版情報: New York : Association for Computing Machinery, c1995  viii, 308 p. ; 28 cm
所蔵情報: loading…
46.

図書

図書
sponsored by the Association for Computing Machinery. SIGACT, SIGPLAN
出版情報: New York, N.Y. : Association for Computing Machinery, c1994  viii, 492 p. ; 28 cm
所蔵情報: loading…
47.

雑誌

雑誌
ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems ; ACM Special Interest Group on Algorithms and Computation Theory ; ACM Special Interest Group for Automata and Computability Theory ; ACM Special Interest Group for the Management of Data ; SIGART
出版情報: New York, N.Y. : Association for Computing Machinery  v. ; 28 cm
所蔵情報: loading…
48.

雑誌

雑誌
Symposium on Computational Geometry ; SIGGRAPH ; ACM Special Interest Group for Automata and Computability Theory ; ACM Special Interest Group on Algorithms and Computation Theory
出版情報: New York, N.Y. : Association for Computing Machinery  v. ; 28 cm
所蔵情報: loading…
49.

図書

図書
sponsored by the Association for Computing Machinery, Special Interest Group on Automata and Computability Theory (SIGACT) [and] Special Interest Group on Programming Languages (SIGPLAN)
出版情報: New York, N.Y. : ACM , Baltimore, MD : May be ordered from ACM Order Dept., c1986  v, 326 p. ; 28 cm
所蔵情報: loading…
50.

図書

図書
sponsored by the ACM Special Interest Group for Automata and Computability Theory
出版情報: New York, N.Y. : Association for Computing Machinery , Baltimore, MD : Additional copies may be orderd from ACM Order Dept., c1986  v, 461 p. ; 28 cm
所蔵情報: loading…
51.

雑誌

雑誌
sponsored by the Association for Computing Machinery, Special Interest Group on Automata and Computability Theory [and] Special Interest Group on Programming Languages
出版情報: New York, N.Y. : Association for Computing Machinery, c1978-c1993  v. ; 28 cm
巻次年月次: 5th (Jan. 23/25, 1978)-20th (Jan. 10/13, 1993)
所蔵情報: loading…
52.

雑誌

雑誌
sponsored by the Association for Computing Machinery, Special Interest Group on Algorithms and Computability Theory [and] Special Interest Group on Programming Languages
出版情報: New York, N.Y. : Association for Computing Machinery, c1994-  v. ; 28 cm
巻次年月次: 21st (Jan. 17/21, 1994)-
所蔵情報: loading…
53.

雑誌

雑誌
Symposium on Logic in Computer Science
出版情報: Washington, D.C. : IEEE Computer Society Press, c1986-  v. ; 28 cm
巻次年月次: 1st (1986)-
所蔵情報: loading…
54.

雑誌

雑誌
sponsored by the Association for Computing Machinery, Special Interest Group on Automata and Computability Theory [and] Special Interest Group on Programming Languages
出版情報: New York, N.Y. : Association for Computing Machinery, c1973-c1977
巻次年月次: [1st] (Oct. 1/3, 1973)-4th (Jan. 17/19, 1977)
所蔵情報: loading…
55.

雑誌

雑誌
ACM Special Interest Group for Automata and Computability Theory
出版情報: New York : Association for Computing Machinery
巻次年月次: 1 (1969)-11th (1979)
所蔵情報: loading…
56.

図書

図書
ACM-SIAM Symposium on Discrete Algorithms ; ACM Special Interest Group for Automata and Computability Theory ; SIAM Activity Group on Discrete Mathematics
出版情報: New York : Association for Computing Machinery , Philadelphia : Society for Industrial and Applied Mathematics, c1995  654 p. ; 28 cm
所蔵情報: loading…
57.

図書

図書
sponsored by the Association for Computing Machinery. SIGACT, SIGPLAN
出版情報: New York, N.Y. : Association for Computing Machinery, c1995  vii, 408 p. ; 28 cm
所蔵情報: loading…
58.

図書

図書
sponsored by the Association for Computing Machinery, Special Interest Group on Automata and Computability Theory, Special Interest Group on Programming Languages
出版情報: New York : ACM, c1983  vii, 312 p. ; 28 cm
所蔵情報: loading…
59.

図書

図書
sponsored by the ACM Special Interest Group for Automata and Computability Theory, and Special Interest Group for Operating System Principles
出版情報: New York, N.Y. : Association for Computing Machinery, c1994  ix, 406 p. ; 28 cm
所蔵情報: loading…
60.

図書

図書
sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing ; in cooperation with ACM SIGACT, EATCS ; with support from CWI ... [et al.]
出版情報: Los Alamitos : IEEE Computer Society Press, c1994  x, 397 p. ; 28 cm
所蔵情報: loading…
61.

図書

図書
sponsored by the Association for Computing Machinery, SIGPLAN, SIGACT, SIGART
出版情報: New York, N.Y. : Association for Computing Machinery, c1984  x, 362 p. ; 28 cm
所蔵情報: loading…
62.

図書

図書
sponsored by the ACM Special Interest Group for Algorithms and Computation Theory
出版情報: New York, N.Y. : ACM, c1993  ix, 812 p. ; 28 cm
所蔵情報: loading…
63.

図書

図書
sponsored by ACM SIGACT, ACM SIGARCH ; in cooperation with EATCS
出版情報: New York : Association for Computing Machinery, c1993  vi, 399 p. ; 28 cm
所蔵情報: loading…
64.

図書

図書
sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing, Boston University ; in cooperation with ACM-SIGACT, EATCS
出版情報: Los Alamitos : IEEE Computer Society Press, c1993  viii, 326 p. ; 28 cm
所蔵情報: loading…
65.

図書

図書
sponsored by the Association for Computing Machinery, Special Interest Group on Automata and Computability Theory (SIGACT) ; Special Interest Group on Programming Languages (SIGPLAN)
出版情報: New York, N.Y. : ACM, c1993  viii, 510 p. ; 28 cm
所蔵情報: loading…
66.

図書

図書
sponsored by the Association for Computing Machinery, Special Interest Group on Automata and Computability Theory, Special Interest Group on Programming Languages
出版情報: New York : The Association, c1977  iv, 280 p. ; 28 cm
所蔵情報: loading…
67.

図書

図書
sponsored by the Association for Computing Machinery, Special Interest Group on Automata and Computability Theory, Special Interest Group on Programming Languages
出版情報: New York : ACM, c1979  iv, 290 p. ; 28 cm
所蔵情報: loading…
68.

図書

図書
sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing in cooperation with ACM SIGACT, Association for Symbolic Logic, European Association for Theoretical Computer Science
出版情報: Washington, D.C. : IEEE Computer Society Press , Los Angeles, CA : Order from IEEE Computer Society, c1986  xi, 383 p. ; 28 cm
所蔵情報: loading…
69.

図書

図書
sponsored by the ACM Special Interest Group for Automata and Computability Theory
出版情報: New York : Association for Computing Machinery, 1988  viii, 553 p. ; 28 cm
所蔵情報: loading…
70.

図書

図書
sponsored by the ACM Special Interest Group for Automata and Computability Theory
出版情報: New York : Association for Computing Machinery, c1989  viii, 600 p. ; 28 cm
所蔵情報: loading…
71.

図書

図書
sponsored by the Association for Computing Machinery, Special Interest Group on Automata and Computability Theory, Special Interest Group on Programming Languages
出版情報: New York, N.Y. : ACM , Baltimore, MD : May be ordered from ACM Order Dept., c1980  vii, 261 p. ; 28 cm
所蔵情報: loading…
72.

図書

図書
Special Interest Group for Automata and Computability Theory (SIGACT), Special Interest Group for the Management of Data (SIGMOD), Special Interest Group for Artificial Intelligence (SIGART)
出版情報: New York, N.Y. : Association for Computing Machinery, c1988  vi, 352 p. ; 28 cm
所蔵情報: loading…
73.

図書

図書
sponsored by the Association for Computing Machinery, Special Interest Group on Automata and Computability Theory (SIGACT), Special Interest Group on Programming Languages (SIGPLAN)
出版情報: New York, N.Y. : Association for Computing Machinery , Baltimore, MD : May be ordered from ACM Order Dept., c1989  vi, 352 p. ; 28 cm
所蔵情報: loading…
74.

図書

図書
sponsored by the ACM Special Interest Groups for Graphics and Automata and Computability Theory
出版情報: New York, N.Y. : ACM Press, c1989  viii, 401 p. ; 28 cm
所蔵情報: loading…
75.

図書

図書
sponsored by the Association for Computing Machinery, Special Interest Group on Automata and Computability Theory, with the cooperation of the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing and Department of Electrical Engineering and Computer Science, University of Wisconsin, Milwaukee, Wisconsin
出版情報: New York, N.Y. : ACM, c1981  v, 391 p. ; 28 cm
所蔵情報: loading…
76.

図書

図書
sponsored by the ACM Special Interest Group for Automata and Computability Theory
出版情報: New York : Association for Computing Machinery, 1982  v, 408 p. ; 28 cm
所蔵情報: loading…
77.

図書

図書
sponsored by the ACM Special Interest Group for Automata and Computability Theory
出版情報: New York : Association for Computing Machinery, 1983  487 p. ; 28 cm
所蔵情報: loading…
78.

図書

図書
sponsored by the Association for Computing Machinery Special Interest Group on Automata and Computability Theory, with the cooperation of the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing and the University of New Mexico
出版情報: New York : ACM, c1975  265 p. ; 28 cm
所蔵情報: loading…
79.

図書

図書
sponsored by the Association for Computing Machinery Special Interest Group on Automata and Computing Theory, with the cooperation of the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing, and the University of Colorado
出版情報: New York : ACM, 1977  314 p. ; 28 cm
所蔵情報: loading…
80.

図書

図書
sponsored by the Association for Computing Machinery Special Interest Group on Automata and Computability Theory [and] Special Interest Group on Programming Languages
出版情報: New York : ACM, c1975  iv, 242 p. ; 28 cm
所蔵情報: loading…
81.

図書

図書
sponsored by the Association for Computing Machinery, Special Interest Group on Automata and Computability Theory, Special Interest Group on Programming Languages
出版情報: New York : ACM, c1976  iv, 218 p. ; 28 cm
所蔵情報: loading…
82.

図書

図書
sponsored by the Association for Computing Machinery, Special Interest Group on Automata and Computability Theory, Special Interest Group on Programming Languages
出版情報: New York : ACM, c1978  iv, 264 p. ; 28 cm
所蔵情報: loading…
83.

図書

図書
sponsored by the Association for Computing Machinery, Special Interest Group on Automata and Computability Theory [and] Special Interest Group on Programming Languages
出版情報: Baltimore : ACM, c1981  230 p. ; 28 cm
所蔵情報: loading…
84.

図書

図書
sponsored by the Association for Computing Machinery, Special Interest Group on Automata and Computability Theory [and] Special Interest Group on Programming Languages
出版情報: New York, N.Y. : ACM , Baltimore, MD : May be ordered from ACM Order Dept., c1982  vi, 378 p. ; 28 cm
所蔵情報: loading…
85.

図書

図書
sponsored by the Association for Computing Machinery, Special Interest Group on Automata and Computability Theory (SIGACT) ; Special Interest Group on Programming Languages (SIGPLAN)
出版情報: New York, N.Y. : ACM, c1992  viii, 366 p. ; 28 cm
所蔵情報: loading…
86.

図書

図書
sponsored by the ACM Special Interest Group for Automata and Computability Theory, and Special Interest Group for Operating System Principles
出版情報: New York, N.Y. : Association for Computing Machinery , Baltimore, MD. : Copies from ACM Order Dept., c1983  v, 305 p. ; 28 cm
所蔵情報: loading…
87.

図書

図書
sponsored by IEEE Computer Society Technical Committee on Mathematical Foundations of Computing ; in cooperation with ACM SIGACT, Association for Symbolic Logic, Europe Association for Theoretical Computer Science
出版情報: Los Alamitos, Calif. ; Tokyo : IEEE Computer Society Press, c1992  xiii, 471 p. ; 28 cm
所蔵情報: loading…
88.

図書

図書
sponsored by the ACM Special Interest Group for Automata and Computability Theory
出版情報: New York, N.Y. : ACM, c1992  ix, 784 p. ; 28 cm
所蔵情報: loading…
89.

図書

図書
sponsored by the ACM Special Interest Groups for Graphics and Automata and Computability Theory
出版情報: Baltimore, MD : Additional copies may be ordered prepaid from: ACM Order Dept., c1992  vi, 368 p. ; 28 cm
所蔵情報: loading…
90.

図書

図書
Special Interest Group for Automata and Computability Theory(SIGACT), Special Interest Group for the Management of Data(SIGMOD), Special Interest Group for Artificial Intelligence(SIGART)
出版情報: New York : Association for Computing Machinery, c1992  viii, 392 p. ; 28 cm
所蔵情報: loading…
91.

図書

図書
sponsored by ACM SIGACT, ACM SIGARCH ; in cooperation with EATCS
出版情報: New York : Association for Computing Machinery , Baltimore : Additional copies may be ordered from ACM Order Department, c1992  x, 441 p. ; 28 cm
所蔵情報: loading…
92.

図書

図書
sponsored by the ACM Special Interest Group for Automata and Computability Theory, and Special Interest Group for Operating System Principles
出版情報: New York, N.Y. : Association for Computing Machinery, c1992  vii, 287 p. ; 28 cm
所蔵情報: loading…
93.

図書

図書
sponsored by the ACM Special Interest Group for Automata and Computability Theory
出版情報: New York, N.Y. : ACM, c1991  vii, 573 p. ; 28 cm
所蔵情報: loading…
94.

図書

図書
sponsored by IEEE Computer Society Technical Committee on Mathematical Foundations of Computing in cooperation with ACM SIGACT, EATCS
出版情報: Los Alamitos : IEEE Computer Society Press, c1991  viii, 393 p. ; 28 cm
所蔵情報: loading…
95.

図書

図書
sponsored by the Association for Computing Machinery, Special Interest Group on Automata and Computability Theory (SIGACT) ; Special Interest Group on Programming Languages (SIGPLAN)
出版情報: New York, N.Y. : ACM, c1990  vii, 366 p. ; 28 cm
所蔵情報: loading…
96.

図書

図書
sponsored by the ACM Special Interest Groups for Graphics and Automata and Computability Theory
出版情報: Baltimore, MD : Additional copies may be ordered prepaid from: ACM Order Dept., c1991  vi, 373 p. ; 28 cm
所蔵情報: loading…
97.

図書

図書
sponsored by the ACM Special Interest Group for Automata and Computability Theory, and Special Interest Group for Operating System Principles
出版情報: New York, N.Y. : Association for Computing Machinery, c1991  viii, 355 p. ; 28 cm
所蔵情報: loading…
98.

図書

図書
Special Interest Group for Automata and Computability Theory(SIGACT), Special Interest Group for the Management of Data(SIGMOD), Special Interest Group for Artificial Intelligence(SIGART)
出版情報: New York : Association for Computing Machinery, c1991  vii, 341 p. ; 28 cm
所蔵情報: loading…
99.

図書

図書
sponsored by the ACM Special Interest Group for Automata and Computability Theory, and Special Interest Group for Operating System Principles
出版情報: New York, N.Y. : Association for Computing Machinery, c1990  vii, 411 p. ; 28 cm
所蔵情報: loading…
100.

図書

図書
sponsored by the Association for Computing Machinery, Special Interest Group on Automata and Computability Theory (SIGACT) [and] Special Interest Group on Programming Languages (SIGPLAN)
出版情報: New York, N.Y. : ACM , Baltimore, MD : May be ordered from ACM Order Dept., c1990  vi, 401 p. ; 28 cm
所蔵情報: loading…
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼