close
1.

図書

図書
sponsored by IEEE Computer Society Technical Committee on Mathematical Foundations of Computing (TCMF) ; in cooperation with SIGACT and EATCS
出版情報: Los Alamitos, Calif. : IEEE Computer Society, c2002  xii, 205 p. ; 28 cm
所蔵情報: loading…
目次情報: 続きを見る
Preface
Committees
Ron Book Prize for Best Student Paper
2002 Best Paper Award
Joint Session with STOC 2002 / Session 1:
Resolution Lower Bounds for the Weak Pigeonhole Principle / R. Raz
Hard Examples for Bounded Depth Frege / E. Ben-Sasson
Relations between Average Case Complexity and Approximation Complexity / U. Feige
Vertex Cover on 4-Regular Hyper-graphs Is Hard to Approximate within 2-[epsilon] / J. Holmerin
Improved Cryptographic Hash Functions with Worst-Case/Average-Case Connection / D. MicciancioSession 2:
Algorithmic Derandomization via Complexity Theory / D. Sivakumar
Pseudo-random Generators for All Hardnesses / C. Umans
Randomness Conductors and Constant-Degree Lossless Expanders / M. Capalbo ; O. Reingold ; S. Vadhan ; A. WigdersonSession 3:
Expanders from Symmetric Codes / R. Meshulam
The Complexity of Approximating the Entropy / T. Batu ; S. Dasgupta ; R. Kumar ; R. Rubinfeld
Time-Space Tradeoffs, Multiparty Communication Complexity, and Nearest-Neighbor Problems / P. Beame ; E. Vee
On Communication over an Entanglement-Assisted Quantum Channel / A. Nayak ; J. Salzman
Hardness Amplification within NP / R. O'DonnellSession 4:
3-Manifold Knot Genus Is NP-Complete / I. Agol ; J. Hass ; W. Thurston
On the Power of Unique 2-Prover 1-Round Games / S. Khot
Learnability beyond AC[superscript 0] / J. Jackson ; A. Klivans ; R. Servedio
Resolution Lower Bounds for Perfect Matching Principles / A. RazborovSession 5:
Resolution Width-Size Trade-Offs for the Pigeon-Hole Principle / S. Dantchev
The Inapproximability of Lattice and Coding Problems with Preprocessing
Sampling Short Lattice Vectors and the Closest Lattice Vector Problem / M. Ajtai
Invited Address 1
The History of Complexity / Lance Fortnow
The Correlation between Parity and Quadratic Polynomials Mod 3 / F. GreenSession 6:
Functions That Have Read-Twice Constant Width Branching Programs Are Not Necessarily Testable / E. Fischer ; I. Newman
On the Complexity of Integer Multiplication in Branching Programs with Multiple Tests and in Read-Once Branching Programs with Limited Nondeterminism / P. Woelfel
Information Theory Methods in Communication Complexity / Z. Bar-Yossef ; T. JayramSession 7:
Extracting Quantum Entanglement (General Entanglement Purification Protocols) / A. Ambainis ; A. Smith ; K. Yang
Algebras of Minimal Rank over Perfect Fields / M. Blaser
Invited Address 2
Rapid Mixing / Peter Winkler
Pseudorandomness and Average-Case Complexity via Uniform Reductions / L. TrevisanSession 8:
Pseudo-random Generators and Structure of Complete Degrees / M. Agrawal
Decoding Concatenated Codes Using Soft Information / V. Guruswami ; M. Sudan
Survey Talk 1
Arthur and Merlin in a Quantum World / John Watrous
Streaming Computation of Combinatorial Objects / R. ShaltielSession 9:
Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval / O. Goldreich ; H. Karloff ; L. Schulman
Better Lower Bounds for Locally Decodable Codes / A. Deshpande ; R. Jain ; T. Kavitha ; S. Lokam ; J. Radhakrishnan
Universal Arguments and Their Applications / B. Barak
Author Index
Preface
Committees
Ron Book Prize for Best Student Paper
2.

図書

図書
sponsored by IEEE Computer Society Technical Committee on Mathematical Foundations of Computing ; in cooperation with Association of Symbolic Logic, European Association for Theoretical Computer Science ; with support from US Office of Naval Research International Field Office, European Office of Aerospace Research and Development of the US Air Force Office of Scientific Research
出版情報: Los Alamitos, Calif. : IEEE Computer Society, c2002  xiii, 461 p. ; 28 cm
所蔵情報: loading…
目次情報: 続きを見る
Foreword
Conference Organisers
Programme Committee
Additional Reviewers
FLoC Joint Invited Lecture
Little Engines of Proof / N. Shankar
Automatic Decidability / C. Lynch ; B. MorawskaSession 1:
Tree-Like Counterexamples in Model Checking / E. Clarke ; S. Jha ; Y. Lu ; H. VeithSession 2:
Probabilistic Abstraction for Model Checking: An Approach Based on Property Testing / S. Laplante ; R. Lassaigne ; F. Magniez ; S. Peyronnet ; M. de Rougemont
Semantic Minimization of 3-Valued Propositional Formulae / T. Reps ; A. Loginov ; M. Sagiv
Invited Lecture: Separation Logic: A Logic for Shared Mutable Data Structures / J. C. ReynoldsSession 3:
A Stratified Semantics of General References Embeddable in Higher-Order Logic / A. J. Ahmed ; A. W. Appel ; R. Virga
A Syntactic Approach to Foundational Proof-Carrying Code / N. A. Hamid ; Z. Shao ; V. Trifonov ; S. Monnier ; Z. NiSession 4:
A Fully Abstract May Testing Semantics for Concurrent Objects / A. Jeffrey ; J. Rathke
Semantics and Logic of Object Calculi / B. Reus ; T. Streicher
Efficient Type Inference for Record Concatenation and Subtyping / J. Palsberg ; T. ZhaoSession 5:
Semantic Subtyping / A. Frisch ; G. Castagna ; V. Benzaken
Remarks on Isomorphisms in Typed Lambda Calculi with Empty and Sum Types / M. Fiore ; R. Di Cosmo ; V. Balat
On the Lambda Y Calculus / R. StatmanSession 6:
Dense Real-Time Games / M. Faella ; S. La Torre ; A. Murano
Computing Reachability Relations in Timed Automata / C. Dima
Invited Lecture: Monadic Queries over Tree-Structured Data / G. Gottlob ; C. KochSession 7:
Tree Extension Algebras: Logics, Automata, and Query Languages / M. Benedikt ; L. Libkin
The Complexity of First-Order and Monadic Second-Order Logic Revisited / M. Frick ; M. GroheSession 8:
The 0-1 Law Fails for Frame Satisfiability of Propositional Modal Logic / J.-M. Le Bars
Some Results on Automatic Structures / H. Ishihara ; B. Khoussainov ; S. Rubin
Observational Equivalence of 3rd-Order Idealized Algol is Decidable / C.-H. L. OngSession 9:
Games on Graphs and Sequentially Realizable Functionals / M. Hyland ; A. Schalk
Polarized Games / O. Laurent
Domain Theory and Differential Calculus (Functions of One Variable) / A. Edalat ; A. LieutierSession 10:
Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory / A. Simpson
The Powerdomain of Indexed Valuations / D. Varacca
Invited Lecture: Complexity Classes, Propositional Proof Systems, and Formal Theories / S. A. CookSession 11:
Complete Problems for Dynamic Complexity Classes / W. Hesse ; N. Immerman
Unsatisfiable Random Formulas Are Hard to Certify / A. AtseriasSession 12:
The Proof Complexity of Linear Algebra / M. Soltys ; S. Cook
Calibrating Computational Feasibility by Abstraction Rank / D. Leivant
Short Presentations / Session 13:
Lessons Learned from Formal Developments in PVS / J. Ford ; I. A. Mason
CLP Implementation of a Phase Model Checker / S. Soliman
An Overview of MR, a Calculus of Mobile Resources / J. C. Godskesen ; T. Hildebrandt ; V. Sassone
Ludics Dynamics: Designs and Interactive Observability / C. Faggian
Invited Tutorial: Description Logics: Foundations for Class-Based Knowledge Representation / D. Calvanese ; G. De Giacomo ; M. LenzeriniSession 14:
Modal and Guarded Characterisation Theorems over Finite Transition Systems / M. Otto
Temporal Logic with Forgettable Past / F. Laroussinie ; N. Markey ; P. SchnoebelenSession 15:
Decidable and Undecidable Fragments of First-Order Branching Temporal Logics / I. Hodkinson ; F. Wolter ; M. Zakharyaschev
Expressive Equivalence of Least and Inflationary Fixed-Point Logic / S. Kreutzer
The Metric Analogue of Weak Bisimulation for Probabilistic Processes / J. Desharnais ; R. Jagadeesan ; V. Gupta ; P. PanangadenSession 16:
Separability, Expressiveness, and Decidability in the Ambient Logic / D. Hirschkoff ; E. Lozes ; D. Sangiorgi
Linearity in Process Languages / M. Nygaard ; G. Winskel
Deciding Confluence of Certain Term Rewriting Systems in Polynomial Time / A. TiwariSession 17:
Two Adversary Lower Bounds for Parity Games / H. Bjorklund ; S. Vorobyov
Is Randomized Gurvich-Karzanov-Khachiyan's Algorithm for Parity Games Polynomial? / E. Beffara
Time-Space Computational Complexity of Imperative Programming Languages / E. Covino ; G. Pani
Author Index
Foreword
Conference Organisers
Programme Committee
3.

図書

図書
sponsored by IEEE Computer Society Technical Committee on Mathematical Foundations of Computing
出版情報: Los Alamitos, Calif. ; Tokyo : IEEE Computer Society, c2001  xiii, 670 p. ; 28 cm
所蔵情報: loading…
4.

図書

図書
sponsored by IEEE Computer Society Technical Committee for Mathematical Foundations of Computing ; in cooperation with ACM-SIGACT, EATCS
出版情報: Los Alamitos, Calif. : IEEE Computer Society, c2001  xiii, 303 p. ; 28 cm
所蔵情報: loading…
目次情報: 続きを見る
Dedication
Preface
Conference Organization
Best Paper Award
Ron Book Prize for Best Student Paper
In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time / R. Impagliazzo ; V. Kabanets ; A. WigdersonSession 1:
Towards Uniform AC[superscript 0]-Ismorphisms / M. Agrawal
Universal Traversal Sequences with Backtracking / M. Koucky
Comparing Notions of Full Derandomization / L. Fortnow
Monotone Simulations of Nonmonotone Proofs / A. Atserias ; N. Galesi ; P. PudlakSession 2:
Space Complexity of Random Formulae in Resolution / E. Ben-Sasson
Resolution Complexity of Independent Sets in Random Graphs / P. Beame ; A. Sabharwal
Tree Resolution Proofs of the Weak Pigeon-Hole Principle / S. Dantchev ; S. Riis
Separation of NP-Completeness Notions / A. Pavan ; A. SelmanSession 3:
Bounded Query Functions with Limited Output Bits / R. Chang ; J. Squire
A Linear Lower Bound on the Unbounded Error Probabilistic Communication Complexity / J. ForsterSession 4:
Towards Proving Strong Direct Product Theorems / R. Shaltiel
Communication Complexity Lower Bounds by Polynomials / H. Buhrman ; R. de WolfSession 5:
Quantum Algorithms for Element Distinctness / C. Durr ; M. Heiligman ; P. Hoyer ; F. Magniez ; M. Santha
Quantum versus Classical Learnability / R. Servedio ; S. Gortler
Uniform Circuits for Division: Consequences and Problems / E. Allender ; D. Barrington ; W. HesseSession 6:
Affine Projections of Symmetric Polynomials / A. Shpilka
On the Non-Approximability of Boolean Functions by OBDDs and Read-K-Times Branching Programs / B. Bollig ; M. Sauerhoff ; I. Wegener
Lower Bounds for Approximations by Low Degree Polynomials Over Zm / N. Alon ; R. Beigel
On the Power of Nonlinear Secret-Sharing / A. Beimel ; Y. Ishai
A Stronger Kolmogorov Zero-One Law for Resource-Bounded Measure / J. DaiSession 7:
Hausdorff Dimension in Exponential Time / K. Ambos-Spies ; W. Merkle ; J. Reimann ; F. Stephan
On the Complexity of Approximating the VC Dimension / E. Mossel ; C. UmansSession 8:
Links Between Complexity Theory and Constrained Block Coding / L. Stockmeyer ; D. Modha
Simple Analysis of Graph Tests for Linearity and PCP / J. Hastad
Logical Operations and Kolmogorov Complexity II / A. Muchnik ; N. VereshchaginSession 9:
Computational Depth / L. Antunes ; D. van Melkebeek
Quantum Algorithmic Entropy / P. Gacs
On Separators, Segregators and Time versus Space / R. SanthanamSession 10:
Time-Space Tradeoffs in the Counting Hierarchy / D. Ronneburger ; S. Roy ; V. Vinay
Author Index
Dedication
Preface
Conference Organization
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 ; with support from Forall Systems IBM
出版情報: Los Alamitos, Calif. ; Tokyo : IEEE Computer Society, c2005  xiii, 477 p. ; 28 cm
所蔵情報: loading…
7.

図書

図書
sponsored by IEEE Computer Society Technical Committee on Mathematical Foundations of Computing
出版情報: Los Alamitos, Calif. ; Tokyo : IEEE Computer Society, c2005  xiii, 668 p. ; 28 cm
所蔵情報: loading…
8.

図書

図書
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
9.

図書

図書
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
10.

図書

図書
sponsored by IEEE Technical Committee on Mathematical Foundations of Computing ; with support from Academy of Finland ... [et al.]
出版情報: Los Alamitos, Calif. ; Tokyo : IEEE Computer Society, c2004  xiii, 467 p. ; 28 cm
所蔵情報: loading…
11.

図書

図書
sponsored by IEEE Computer Society Technical Committee on Mathematical Foundations of Computing
出版情報: Los Alamitos, Calif. : IEEE Computer Society Press, c1999  xiv, 668 p. ; 28 cm
所蔵情報: loading…
目次情報: 続きを見る
Foreword
Committees
Machtey Award
Reviewers
Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems / K. Jain ; V. V. Vazirani
Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Labeling and Markov Random Fields / J. Kleinberg ; E. Tardos
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities / L. K. Fleischer
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates / F. Afrati ; E. Bampis ; C. Chekuri ; D. Karger ; C. Kenyon ; S. Khanna ; I. Milis ; M. Queyranne ; M. Skutella ; C. Stein ; M. Sviridenko
A 5/2n[superscript 2]-Lower Bound for the Rank of nxn-Matrix Multiplication over Arbitrary Fields / M. Blaser
Improved Bounds for Sampling Colorings / E. Vigoda
A Non-linear Time Lower Bound for Boolean Branching Programs / M. Ajtai
Derandomizing Arthur-Merlin Games Using Hitting Sets / P. Bro Miltersen ; N. V. Vinodchandran
Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs / V. King
Knuth Prize Lecture / Laszlo Lovasz
Dynamic Planar Convex Hull Operations in Near-Logarithmic Amortized Time / T. M. Chan
Taking a Walk in a Planar Arrangement / S. Har-Peled
PSPACE Has Constant-round Quantum Interactive Proof Systems / J. Watrous
Verifiable Random Functions / S. Micali ; M. Rabin ; S. Vadhan
How Asymmetry Helps Load Balancing / B. Vocking
Noncryptographic Selection Protocols / U. Feige
A Sublinear Time Approximation Scheme for Clustering in Metric Spaces / P. Indyk
Efficient Regular Data Structures and Algorithms for Location and Proximity Problems / A. Amir ; A. Efrat ; H. Samet
Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings / M. Farach-Colton
Near-Optimal Conversion of Hardness into Pseudo-Randomness / R. Impagliazzo ; R. Shaltiel ; A. Wigderson
Error Reduction for Extractors / R. Raz ; O. Reingold
Primality and Identity Testing Via Chinese Remaindering / M. Agrawal ; S. Biswas
On Counting Independent Sets in Sparse Graphs / M. Dyer ; A. Frieze ; M. Jerrum
Torpid Mixing of Some Monte Carlo Markov Chain Algorithms in Statistical Physics / C. Borgs ; J. Chayes ; J. H. Kim ; P. Tetali ; V. H. Vu
Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions / B. Morris ; A. Sinclair
Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain / V.S. Anil Kumar ; H. Ramesh
A Near-Tight Lower Bound on the Time Complexity of Distributed MST Construction / D. Peleg ; V. Rubinovich
Long-lived Adaptive Collect with Applications / Y. Afek ; G. Stupp ; D. Touitou
A Theoretical Framework for Memory-Adaptive Algorithms / R. D. Barve ; J. S. Vitter
Cache-Oblivious Algorithms / M. Frigo ; C. E. Leiserson ; H. Prokop ; S. Ramachandran
The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals / J. Feldman ; M. Ruhl
Setting Parameters by Example / D. Eppstein
Finding Double Euler Trails of Planar Graphs in Linear Time / Z.-Z. Chen ; X. He ; C.-H. Huang
Edge-Disjoint Routing in Plane Switch Graphs in Linear Time / K. Weihe
On Quantum and Classical Space-bounded Processes with Algebraic Transition Amplitudes
A Better Lower Bound for Quantum Algorithms Searching an Ordered List / A. Ambainis
Bounds for Small-Error and Zero-Error Quantum Algorithms / H. Buhrman ; R. Cleve ; R. de Wolf ; C. Zalka
Optimal Lower Bounds for Quantum Automata and Random Access Codes / A. Nayak
Improved Combinatorial Algorithms for the Facility Location and k-Median Problems / M. Charikar ; S. Guha
Lovasz's Lemma for the Three-Dimensional K-Level of Concave Surfaces and its Applications / N. Katoh ; T. Tokuyama
Cuts, Trees and l[subscript 1]-Embeddings of Graphs / A. Gupta ; I. Newman ; Y. Rabinovich
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems / U. Schoning
Random CNF's are Hard for the Polynomial Calculus / E. Ben-Sasson
A Study of Proof Search Algorithms for Resolution and Polynomial Calculus / M. L. Bonet ; N. Galesi
Online Scheduling to Minimize Average Stretch / S. Muthukrishnan ; R. Rajaraman ; A. Shaheen ; J. E. Gehrke
Weak Adversaries for the k-Server Problem / E. Koutsoupias
Finely-Competitive Paging / A. Blum ; C. Burch ; A. Kalai
On the Complexity of SAT / R. J. Lipton ; A. Viglas
Hardness of Approximating [characters not reproducible] Minimization Problems / C. Umans
Hardness of Approximating the Minimum Distance of a Linear Code / I. Dumer ; D. Micciancio ; M. Sudan
On Universal and Fault-Tolerant Quantum Computing: A Novel Basis and a New Constructive Proof of Universality for Shor's Basis / P. O. Boykin ; T. Mor ; M. Pulver ; V. Roychowdhury ; F. Vatan
Satisfiability of Word Equations with Constants is in PSPACE / W. Plandowski
An Approximate L[superscript 1]-Difference Algorithm for Massive Data Streams / J. Feigenbaum ; S. Kannan ; M. Strauss ; M. Viswanathan
Algorithmic Aspects of Protein Structure Similarity / D. Goldman ; S. Istrail ; C. H. Papadimitriou
Magic Functions / C. Dwork ; M. Naor ; L. Stockmeyer
Limits on the Efficiency of One-Way Permutation-Based Hash Functions / D. R. Simon
Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security / A. Sahai
Non-Interactive CryptoComputing For NC[superscript 1] / T. Sander ; A. Young ; M. Yung
Fairness in Routing and Load Balancing / Y. Rabani
Stochastic Load Balancing and Related Problems / A. Goel
Reducing Network Congestion and Blocking Probability Through Balanced Allocation / M. J. Luczak ; E. Upfal
Finding Maximal Repetitions in a Word in Linear Time / R. Kolpakov ; G. Kucherov
All Pairs Shortest Paths in Undirected Graphs with Integer Weights / A. Shoshan ; U. Zwick
An Algorithmic Theory of Learning: Robust Concepts and Random Projection / R. I. Arriaga ; S. Vempala
Boosting and Hard-Core Sets / A. R. Klivans ; R. A. Servedio
Learning Mixtures of Gaussians / S. Dasgupta
Regular Languages Are Testable with a Constant Number of Queries / N. Alon ; M. Krivelevich ; M. Szegedy
Efficient Testing of Large Graphs / E. Fischer
Author Index
Foreword
Committees
Machtey Award
12.

図書

図書
sponsored by IEEE Computer Society, IEEE Computer Society Technical Committee on Mathematical Foundations of Computing
出版情報: Los Alamitos, Calif. : IEEE Computer Society Press, c1997  xiii, 606 p. ; 28 cm
所蔵情報: loading…
13.

図書

図書
sponsored by IEEE Computer Society Technical Committee on Mathematical Foundations of Computing
出版情報: Los Alamitos, Calif. : IEEE Computer Society Press, c1998  xiv, 745 p. ; 28 cm
所蔵情報: loading…
目次情報: 続きを見る
Foreword
Committees
Reviewers
Geometric Computation and the Art of Sampling / Emo Welzl ; J. MatousekTutorial I:
Theoretical Issues in Probabilistic Artificial Intelligence / Sally Goldman ; M. KearnsTutorial II:
Information Retrieval on the Web / David Karger ; A. Broder ; M.R. HenzingerTutorial III:
A Tight Characterization of NP with 3 Query PCPs / Mihir Bellare ; V. Guruswami ; D. Lewin ; M. Sudan ; L. TrevisanSession 1A:
Probabilistically Checkable Proofs with Low Amortized Query Complexity
Improved Decoding of Reed-Solomon and Algebraic-Geometric Codes
The Access Network Design Problem / Jon Kleinberg ; M. Andrews ; L. ZhangSession 1B:
Jitter Control in QoS Networks / Y. Mansour ; B. Patt-Shamir
Stability of Adversarial Queues via Fluid Models / D. Gamarnik
Delayed Information and Action in On-line Algorithms / S. Albers ; M. Charikar ; M. Mitzenmacher
The Complexity of the Approximation of the Bandwidth Problem / Miklos Ajtai ; W. UngerSession 2A:
The Shortest Vector in a Lattice is Hard to Approximate to Within Some Constant / D. Micciancio
Approximating-CVP to Within Almost-Polynomial Factors is NP-Hard / I. Dinur ; G. Kindler ; S. Safra
Satisfiability of Word Equations with Constants is in Exponential Space / Christos Papadimitriou ; C. GutierrezSession 2B:
Decidability of Bisimulation Equivalence for Equational Graphs of Finite Out-Degree / G. Senizergues
A Primitive Recursive Algorithm for the General Petri Net Reachability Problem / Z. Bouziane
Algorithms to Tile the Infinite Grid with Finite Clusters / M. Szegedy
On Approximate Nearest Neighbors in Non-Euclidean Spaces / Frances Yao ; P. IndykSession 3A:
Pattern Matching for Spatial Point Sets / D.E. Cardoze ; L.J. Schulman
Faster Algorithms for String Matching Problems: Matching the Convolution Bound
Overcoming the Memory Bottleneck in Suffix Tree Construction / M. Farach ; P. Ferragina ; S. Muthukrishnan
Bivariate Polynomial Multiplication / Dan Spielman ; M. BlaserSession 3B:
A Unified Superfast Algorithm for Boundary Rational Tangential Interpolation Problems and for Inversion and Factorization of Dense Structured Matrices / V. Olshevsky ; V. Pan
Unsatisfiable Systems of Equations, Over a Finite Field / A.R. Woods
Multiplicative Complexity of Taylor Shifts and a New Twist of the Substitution Method / A. Schonhage
Local Search in Smooth Convex Sets / David Williamson ; R. Kannan ; A. NolteSession 4A:
A TDI System and its Application to Approximation Algorithms / M.-c. Cai ; X. Deng ; W. Zang
Geometric Separator Theorems and Applications / W.D. Smith ; N.C. Wormald
Approximation of Diameters: Randomization Doesn't Help / A. Brieden ; P. Gritzmann ; V. Klee ; L. Lovasz ; M. Simonovits
Time-Space Tradeoffs for Branching Programs / Allan Borodin ; P. Beame ; M. Saks ; J.S. ThathacharSession 4B:
Optimal Time-Space Trade-Offs for Sorting / J. Pagter ; T. Rauhe
Exponential Complexity Lower Bounds for Depth 3 Arithmetic Circuits in Algebras of Functions Over Finite Fields / D. Grigoriev ; A.A. Razborov
Lower Bounds for (MOD p-MOD m) Circuits / V. Grolmusz ; G. Tardos
On the Single-Source Unsplittable Flow Problem / Y. Dinitz ; N. Garg ; M.X. GoemansSession 5A:
Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems / J. Konemann
All Pairs Shortest Paths in Weighted Directed Graphs--Exact and Almost Exact Algorithms / U. Zwick
A Divide-and-Conquer Algorithm for Min-Cost Perfect Matching in the Plane / K.R. Varadarajan
1-Way Quantum Finite Automata: Strengths, Weaknesses and Generalizations / Edith Cohen ; A. Ambainis ; R. FreivaldsSession 5B:
The Quantum Communication Complexity of Sampling / A. Ta-Shma ; U. Vazirani ; A. Wigderson
Quantum Lower Bounds by Polynomials / R. Beals ; H. Buhrman ; R. Cleve ; M. Mosca ; R. de Wolf
Quantum Oracle Interrogation: Getting All Information for Almost Half the Price / W. van Dam
Fast Monte-Carlo Algorithms for Finding Low-Rank Approximations / A. Frieze ; S. VempalaSession 6A:
Approximating a Finite Metric by a Small Number of Tree Metrics / C. Chekuri ; A. Goel ; S. Guha ; S Plotkin
Random Projection: A New Approach to VLSI Layout
Map Graphs in Polynomial Time / M. Thorup
On Learning Monotone Boolean Functions / A. Blum ; C. Burch ; J. LangfordSession 6B:
Orchestrating Quartets: Approximation and Data Correction / T. Jiang ; P. Kearney ; M. Li
Testing Monotonicity / O. Goldreich ; S. Goldwasser ; E. Lehman ; D. Ron
Evolutionary Trees can be Learned in Polynomial Time in the Two-State General Markov Model / M. Cryan ; L.A. Goldberg ; P.W. Goldberg
A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem / Joseph Naor ; K. JainSession 7A:
The Finite Capacity Dial-A-Ride Problem / B. Raghavachari
A Randomized Approximation Scheme for Metric MAX-CUT / W.F. de la Vega ; C. Kenyon
Semidefinite Relaxations for Parallel Machine Scheduling / M. Skutella
Lower Bounds for Zero Knowledge on the Internet / J. Kilian ; E. Petrank ; C. RackoffSession 7B:
Oblivious Transfer with a Memory-Bounded Receiver / C. Cachin ; C. Crepeau ; J. Marcil
Quantum Cryptography with Imperfect Apparatus / D. Mayers ; A. Yao
The Security of Individual RSA Bits / J. Hastad ; M. Naslund
Protocols for Asymmetric Communication Channels / M. Adler ; B.M. MaggsSession 8A:
Marked Ancestor Problems / S. Alstrup ; T. Husfeldt
Towards an Optimal Bit-Reversal Permutation Program / L. Carter ; K.S. Gatlin
The Minimum Equivalent DNF Problem and Shortest Implicants / C. UmansSession 8B:
Concurrent Reachability Games / L. de Alfaro ; T.A. Henzinger ; O. Kupferman
Perfect Information Leader Election in log* n + O (1) Rounds / A. Russell ; D. Zuckerman
Random Sampling, Halfspace Range Reporting, and Construction of ([less than or equal] k)-Levels in Three Dimensions / T.M. ChanSession 9A:
Parametric and Kinetic Minimum Spanning Trees / P.K. Agarwal ; D. Eppstein ; L.J. Guibas
On the Combinatorial and Topological Complexity of a Single Cell / S. Basu
Which Crossing Number is it, Anyway? / J. Pach ; G. Toth
An Improved Exponential-Time Algorithm for k-SAT / Toni Pitassi ; R. Paturi ; P. Pudlak ; M.E. Saks ; F. ZaneSession 9B:
Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems / M.L. Bonet ; J.L. Esteban ; N. Galesi ; J. Johannsen
Tseitin's Tautologies and Lower Bounds for Nullstellensatz Proofs
Which Problems Have Strongly Exponential Complexity? / R. Impagliazzo
Recommendation Systems: A Probabilistic Analysis / R. Kumar ; P. Raghavan ; S. Rajagopalan ; A. TomkinsSession 10A:
Heuristics for Finding Large Independent Sets, with Applications to Coloring Semi-Random Graphs / U. Feige
Improved Bounds and Algorithms for Hypergraph Two-Coloring / J. Radhakrishnan ; A. Srinivasan
Local Divergence of Markov Chains and the Analysis of Iterative Load-Balancing Schemes / Y. Rabani ; A. Sinclair ; R. Wanka
The Complexity of Acyclic Conjunctive Queries / G. Gottlob ; N. Leone ; F. ScarcelloSession 10B:
A Characterization of NC by Tree Recurrence / D. Leivant
A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial Time / J. Mitchell ; M. Mitchell ; A. Scedrov
Randomness vs. Time: De-Randomization under a Uniform Assumption
Author Index
Foreword
Committees
Reviewers
14.

図書

図書
sponsored by IEEE Computer Society Technical Committee on the Mathematical Foundations of Computing ; in cooperation with Association for Symbolic Logic and European Association for Theoretical Computer Science
出版情報: Los Alamitos, Calif. ; Tokyo : IEEE Computer Society, c2000  xiii, 425 p. ; 28 cm
所蔵情報: loading…
目次情報: 続きを見る
Conference Organizers
Program Committee
Additional Reviewers
Kleene Award for Best Student Paper
Author Index
Logic, Complexity, and Games / R. Fagin
A General Notion of Realizability / L. Birkedal
A Model for Impredicative Type Systems, Universes, Intersection Types and Subtyping / A. Miquel
Complete Axioms for Categorical Fixed-Point Operators / A. Simpson ; G. Plotkin
The Role of Decidability in First Order Separations over Classes of Finite Structures / S. Lindell ; S. Weinstein
Automatic Structures / A. Blumensath ; E. Gradel
Definability and Compression / F. Afrati ; H. Leiss ; M. de Rougemont
Resource-Bounded Continuity and Sequentiality for Type-Two Functionals / S. Buss ; B. Kapron
A Syntactical Analysis of Non-Size-Increasing Polynomial Time Computation / K. Aehlig ; H. Schwichtenberg
Approximating Labeled Markov Processes / J. Desharnais ; R. Jagadeesan ; V. Gupta ; P. Panangaden
Precongruence Formats for Decorated Trace Preorders / B. Bloom ; W. Fokkink ; R. van Glabbeek
Virtual Symmetry Reduction / E. Emerson ; J. Havlicek ; R. Trefler
Better is Better than Well: On Efficient Verification of Infinite-State Systems / P. Abdulla ; A. Nylen
Concurrent Omega-Regular Games / L. de Alfaro ; T. Henzinger
Approximate Pattern Matching is Expressible in Transitive Closure Logic / K. Lemstrom ; L. Hella
Computational Complexity of Some Problems Involving Congruences on Algebras / C. Bergman ; G. Slutzki
From the Church-Turing Thesis to the First-Order Algorithm Theorem / S. Kripke
Satisfiability Testing: Recent Developments and Challenge Problems / B. Selman
Dominator Trees and Fast Verification of Proof Nets / A. Murawski ; C.-H. Ong
Game Semantics and Subtyping / J. Chroboczek
Probabilistic Game Semantics / V. Danos ; R. Harmer
Back and Forth between Guarded and Modal Logics / C. Hirsch ; M. Otto
More Past Glories / M. Reynolds
A Complete Axiomatization of Interval Temporal Logic with Infinite Time / B. Moszkowski
A Modality for Recurison / H. Nakano
A Static Calculus of Dependencies for the [lambda]-Cube / F. Prost
A Decision Procedure for Term Algebras with Queues / T. Rybina ; A. Voronkov
A Decision Procedure for the Existential Theory of Term Algebras with the Knuth-Bendix Ordering / K. Korovin
Some Strategies for Proving Theorems with a Model Checker / K. McMillan
The Curry-Howard Correspondence in Set Theory / J.-L. Krivine
A Theory of Bisimulation for a Fragment of Concurrent ML with Local Names / A. Jeffrey ; J. Rathke
Models for Name-Passing Processes: Interleaving and Causal / G. Cattani ; P. Sewell
Assigning Types to Processes / N. Yoshida ; M. Hennessy
On First-Order Topological Queries / M. Grohe ; L. Segoufin
View-Based Query Processing and Constraint Satisfaction / D. Calvanese ; G. De Giacomo ; M. Lenzerini ; M. Vardi
Imperative Programming with Dependent Types / H. Xi
Efficient and Flexible Matching of Recursive Types / J. Palsberg ; T. Zhao
How to Optimize Proof-Search in Modal Logics: A New Way of Proving Redundancy Criteria for Sequent Calculi
Paramodulation with Built-in Abelian Groups / G. Godoy ; R. Nieuwenhuis
Conference Organizers
Program Committee
Additional Reviewers
15.

図書

図書
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…
16.

図書

図書
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
17.

図書

図書
sponsored by IEEE Computer Society Technical Committee on Mathematical Foundations of Computing
出版情報: Los Alamitos, Calif. ; Tokyo : IEEE Computer Society, c1999  xii, 478 p. ; 28 cm
所蔵情報: loading…
18.

図書

図書
sponsored by IEEE Computer Society Technical Committee on Mathematical Foundations of Computing
出版情報: Los Alamitos, Calif. : IEEE Computer Society Press, c2000  xiv, 688 p. ; 28 cm
所蔵情報: loading…
目次情報: 続きを見る
Foreword
Committees
Reviewers
Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors / David Zuckerman ; O. Reingold ; S. Vadhan ; A. WigdersonSession 1:
Universality and Tolerance / N. Alon ; M. Capalbo ; Y. Kohayakawa ; V. Rodl ; A. Rucinski ; E. Szemeredi
Extracting Randomness via Repeated Condensing / R. Shaltiel
Extracting Randomness from Samplable Distributions / L. Trevisan
Pseudorandom Generators in Propositional Proof Complexity / M. Alekhnovich ; E. Ben-Sasson ; A. Razborov
Stochastic Models for the Web Graph / David Williamson ; R. Kumar ; P. Raghavan ; S. Rajagopalan ; D. Sivakumar ; A. Tomkins ; E. UpfalSession 2:
Optimization Problems in Congestion Control / R. Karp ; E. Koutsoupias ; C. Papadimitriou ; S. Shenker
Fairness Measures for Resource Allocation / A. Kumar ; J. Kleinberg
On the Approximability of Trade-offs and Optimal Access of Web Sources / M. Yannakakis
How Bad is Selfish Routing? / T. Roughgarden ; E. Tardos
A Polylogarithmic Approximation of the Minimum Bisection / Sanjeev Arora ; U. Feige ; R. KrauthgamerSession 3:
Approximability and In-Approximability Results for No-Wait Shop Scheduling / M. Sviridenko ; G. Woeginger
Nested Graph Dissection and Approximation Algorithms / S. Guha
Approximating the Single Source Unsplittable Min-Cost Flow Problem / M. Skutella
Hardness of Approximate Hypergraph Coloring / Michael Sipser ; V. Guruswami ; J. Hastad ; M. SudanSession 4:
"Soft-Decision" Decoding of Chinese Remainder Codes / A. Sahai
Super-Linear Time-Space Tradeoff Lower Bounds for Randomized Computation / P. Beame ; M. Saks ; X. Sun ; E. Vee
On the Hardness of Graph Isomorphism / J. Toran
Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation / R. Ravi ; P. IndykSession 5:
New Data Structures for Orthogonal Range Searching / S. Alstrup ; G. Brodal ; T. Rauhe
Nearly Optimal Expected-Case Planar Point Location / S. Arya ; T. Malamatos ; D. Mount
On Levels in Arrangements of Curves / T. Chan
Detecting a Network Failure / Avrim BlumSession 6:
Testing of Clustering / S. Dar ; M. Parnas ; D. Ron
Testing of Function That Have Small Width Branching Programs / I. Newman
Testing That Distributions Are Close / T. Batu ; L. Fortnow ; R. Rubinfeld ; W. Smith ; P. White
Using Upper Confidence Bounds for Online Learning / P. Auer
Zaps and Their Applications / Joe Kilian ; C. Dwork ; M. NaorSession 7:
Randomizing Polynomials: A New Representation with Applications to Round-Efficient Secure Computation / Y. Ishai ; E. Kushilevitz
Lower Bounds on the Efficiency of Generic Cryptographic Constructions / R. Gennaro
Concurrent Oblivious Transfer / J. Garay ; P. MacKenzie
The Relationship between Public Key Encryption and Oblivious Transfer / Y. Gertner ; S. Kannan ; T. Malkin ; M. Viswanathan
The Online Median Problem / Leonard Schulman ; R. Mettu ; C. PlaxtonSession 8:
Polynomial Time Approximation Schemes for Geometric k-Clustering / R. Ostrovsky ; Y. Rabani
Clustering Data Streams / N. Mishra ; R. Motwani ; L. O'Callaghan
On Clusterings--Good, Bad and Spectral / R. Kannan ; S. Vempala ; A. Vetta
Fully Dynamic Transitive Closure: Breaking through the O(n[superscript 2]) Barrier / C. Demetrescu ; G. ItalianoSession 9:
Opportunistic Data Structures with Applications / P. Ferragina ; G. Manzini
Cache-Oblivious B-Trees / M. Bender ; E. Demaine ; M. Farach-Colton
Using Expander Graphs to Find Vertex Connectivity / H. Gabow
On the Boundary Complexity of the Union of Fat Triangles / Mario Szegedy ; J. Pach ; G. TardosSession 10:
Straightening Polygonal Arcs and Convexifying Polygonal Cycles / R. Connelly ; G. Rote
A Combinatorial Approach to Planar Non-Colliding Robot Arm Motion Planning / I. Streinu
Topological Persistence and Simplification / H. Edelsbrunner ; D. Letscher ; A. Zomorodian
The Cover Time, the Blanket Time, and the Matthews Bound / Leslie Goldberg ; J. Kahn ; J. Kim ; L. Lovasz ; V. VuSession 11:
The Product Replacement Algorithm is Polynomial / I. Pak
Efficient Algorithms for Universal Portfolios / A. Kalai
Sampling Adsorbing Staircase Walks Using a New Markov Chain Decomposition Method / R. Martin ; D. Randall
The Randomness Recycler: A New Technique for Perfect Sampling / J. Fill ; M. Huber
An Improved Quantum Fourier Transform Algorithm and Applications / Umesh Vazirani ; L. Hales ; S. HallgrenSession 12:
Fast Parallel Circuits for the Quantum Fourier Transform / R. Cleve ; J. Watrous
Succinct Quantum Proofs for Properties of Finite Groups
Private Quantum Channels / A. Ambainis ; M. Mosca ; A. Tapp ; R. de Wolf
The Quantum Complexity of Set Membership / J. Radhakrishnan ; P. Sen ; S. Venkatesh
Randomized Rumor Spreading / C. Schindelhauer ; B. VockingSession 13:
Fast Broadcasting and Gossiping in Radio Networks / M. Chrobak ; L. Gasieniec ; W. Rytter
Linear Waste of Best Fit Bin Packing on Skewed Distributions / C. Kenyon ; M. Mitzenmacher
Optimal Myopic Algorithms for Random 3-SAT / D. Achlioptas ; G. Sorkin
Hierarchical Placement and Network Design Problems / A. Meyerson ; K. MunagalaSession 14:
Building Steiner Trees with Incomplete Global Knowledge / D. Karger ; M. Minkoff
Cost-Distance: Two Metric Network Design / S. Plotkin
Combinatorial Feature Selection Problems / M. Charikar
The Common Fragment of CTL and LTL / M. MaidlSession 15:
On the Existence of Booster Types / M. Herlihy ; E. Ruppert
Existential Second-Order Logic over Graphs: Charting the Tractability Frontier / G. Gottlob ; P. Kolaitis ; T. Schwentick
On Computing the Determinant and Smith Form of an Integer Matrix / W. Eberly ; M. Giesbrecht ; G. Villard
Author Index
Foreword
Committees
Reviewers
19.

図書

図書
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…
20.

図書

図書
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
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 IEEE Computer Society Technical Committee on Mathematical Foundations of Computing ; in cooperation with Association for Symbolic Logic, European Association for Theoretical Computer Science ; with support from Fields Institute for Research in Mathematical Sciences, Le Centre de Recherches Mathématiques (CRM), University of Ottawa
出版情報: Los Alamitos, Calif. ; Tokyo : IEEE Computer Society, c2003  xiv, 393 p. ; 28 cm
所蔵情報: loading…
目次情報: 続きを見る
Foreword
Conference Organization
Program Committee
Additional Reviewers
Proof Nets for Unit-Free Multiplicative-Additive Linear Logic / D. Hughes ; R. van GlabbeekSession 1:
About Translations of Classical Logic into Polarized Linear Logic / O. Laurent ; L. Regnier
System ST [beta]-Reduction and Completeness / C. Raffalli
Invited Tutorial--Types and Programming Languages: The Next Generation / B. C. PierceSession 2:
Reasoning about Hierarchical Storage / A. Ahmed ; L. Jia ; D. WalkerSession 3:
Invited Talk--Formal Verification at Intel / J. Harrison
New Directions in Instantiation-Based Theorem Proving / H. Ganzinger ; K. KorovinSession 4:
Abstract Saturation-Based Inference / N. Dershowitz ; C. Kirchner
Orienting Equalities with the Knuth-Bendix Order / A. Voronkov
Practical Reflection in Nuprl / E. Barzilay ; S. Allen ; R. ConstableShort Presentations I:
An Applicative-Order Term Rewriting System for Code Generation, and Its Termination Analysis / O. Kiselyov
Patterns Based on Multiple Interacting Partial Orders / F. J. Oles
Logic of Subtyping / P. Naumov
A Language and a Notion of Truth for Cryptographic Properties / S. Kramer
The Relative Complexity of Local Search Heuristics and the Iteration Principle / T. Morioka
A Second-Order Theory for NL / S. Cook ; A. Kolokolova
Dependent Intersection: A New Way of Defining Records in Type Theory / A. KopylovSession 5:
Structural Subtyping of Non-Recursive Types Is Decidable / V. Kuncak ; M. Rinard
On Program Equivalence in Languages with Ground-Type References / A. S. Murawski
A Proof Theory for Generic Judgments: An Extended Abstract / D. Miller ; A. TiuSession 6:
Polynomial-Time Algorithms from Ineffective Proofs / P. Oliva
The Complexity of Resolution Refinements / J. Buresh-Oppenheim ; T. Pitassi
Successor-Invariance in the Finite / B. RossmanSession 7:
Invited Talk--Will Deflation Lead to Depletion? On Non-Monotone Fixed Point Inductions / E. Gradel ; S. Kreutzer
On Automatic Partial Orders / B. Khoussainov ; S. Rubin ; F. StephanSession 8:
Logical Definability and Query Languages over Unranked Trees / L. Libkin ; F. Neven
Query Evaluation on Compressed Trees / M. Frick ; M. Grohe ; C. Koch
Revisiting Digitization, Robustness, and Decidability for Timed Automata / J. Ouaknine ; J. WorrellSession 9:
Satisfiability in Alternating-Time Temporal Logic / G. van Drimmelen
Strong Bisimilarity on Basic Parallel Processes Is PSPACE-Complete / P. Jancar
Invited Tutorial--Logic in Access Control / M. AbadiSession 10:
The Planning Spectrum--One, Two, Three, Infinity / M. Pistore ; M. Y. VardiSession 11:
Invited Talk--Advice about Logical AI / J. McCarthy
A Sound Framework for Untrusted Verification-Condition Generators / G. C. Necula ; R. R. SchneckSession 12:
An NP Decision Procedure for Protocol Insecurity with XOR / Y. Chevalier ; R. Kusters ; M. Rusinowitch ; M. Turuani
Intruder Deductions, Constraint Solving and Insecurity Decision in Presence of Exclusive or / H. Comon-Lundh ; V. Shmatikov
Spectrum Hierarchies and Subdiagonal Functions / A. HunterSession 13:
Spectra of Monadic Second-Order Formulas with One Unary Function / Y. Gurevich ; S. Shelah
Convergence Law for Random Graphs with Specified Degree Sequence / J. F. Lynch
Homomorphism Closed vs. Existential Positive / T. FederSession 14:
Tractable Conservative Constraint Satisfaction Problems / A. A. Bulatov
A Constraint-Based Presentation and Generalization of Rows / F. Pottier
Labelled Markov Processes: Stronger and Faster Approximations / V. Danos ; J. DesharnaisSession 15:
Invited Talk--Model Checking for Probability and Time: From Theory to Practice / M. Kwiatkowska
Model Checking Guarded Protocols / E. A. Emerson ; V. KahlonSession 16:
Model-Checking Trace Event Structures / P. Madhusudan
Micro-Macro Stack Systems: A New Frontier of Elementary Decidability for Sequential Systems / N. Piterman
A Proposal to Extend Abstract State Machines to Applications in Systems Biology / Short Presentations II:
Stuttering Refinement on Partial Systems / S. Nejati ; A. Gurfinkel
Assume-Guarantee Reasoning with Features / B. Devereux
Modularity Theorems for Non-Monotone Induction / M. Denecker ; E. Ternovska
Linear-Time Algorithms for Monadic Logic / S. Lindell
Game-Based Notions of Locality / M. Arenas ; P. Barcelo
Arb: An Implementation of Selecting Tree Automata for XML Query Processing
Author Index
Foreword
Conference Organization
Program Committee
23.

図書

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

図書

図書
sponsored by IEEE Computer Society Technical Committee on Mathematical Foundations of Computing
出版情報: Los Alamitos, Calif. ; Tokyo : IEEE Computer Society, c2001  xii, 441 p. ; 28 cm
所蔵情報: loading…
25.

図書

図書
sponsored by the IEEE Computer Society's Technical Committee on Mathematical Foundations of Computing
出版情報: Washington, D.C. : IEEE Computer Society Press, c1985  xii, 552 p. ; 28 cm
所蔵情報: loading…
26.

図書

図書
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…
27.

図書

図書
sponsored by the IEEE Computer Society's Technical Committee on Mathematical Foundations of Computing
出版情報: New York : Institute of Electrical and Electronics Engineers, c1980  421 p. ; 28 cm
所蔵情報: loading…
28.

図書

図書
sponsored by the Computer Society of the IEEE Technical Committee on Mathematical Foundations of Computing
出版情報: Washington, D.C. : IEEE Computer Society Press, c1987  xiv, 498 p. ; 28 cm
所蔵情報: loading…
29.

図書

図書
sponsored by the Computer Society of the IEEE 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. : Computer Society Press of the IEEE , Los Angeles, CA : Order from Computer Society of the IEEE, c1987  xi, 361 p. ; 28 cm
所蔵情報: loading…
30.

図書

図書
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…
31.

図書

図書
organized by Warsaw University ; sponsored by IEEE Computer Society Technical Committee on Mathematical Foundations of Computing ; in cooperation with The Special Interest Group on Automata and Computability Theory of the Association for Computing Machinery, The Association for Symbolic Logic, The European Association for Theoretical Computer Science ; with support from BRICS, University of Aarhus ... [et. al]
出版情報: Los Alamitos, Calif. ; Tokyo : IEEE Computer Society Press, c1997  xiv, 447 p. ; 28 cm
所蔵情報: loading…
32.

図書

図書
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…
33.

図書

図書
sponsored by IEEE Computer Society, IEEE Computer Society Technical Committee on Mathematical Foundations of Computing
出版情報: Los Alamitos, Calif. : IEEE Computer Society Press, c1996  xii, 638 p. ; 28 cm
所蔵情報: loading…
34.

図書

図書
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…
35.

図書

図書
edited by Dexter Kozen ; sponsored by IEEE Computer Society Technical Committee on Mathematical Foundations of Computing ; in cooperation with Special Interest Group on Automata and Computability Theory of the ACM Association for Symbolic Logic, European Association for Theoretical Computer Science ; with support from AT & T Bell Laboratories IBM Almaden Research Center Rice University, University of California, San Diego
出版情報: Los Alamitos, CA. ; Tokyo : IEEE Computer Society Press, c1995  xiii, 518 p. ; 28 cm
所蔵情報: loading…
36.

図書

図書
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…
37.

図書

図書
sponsored by the IEEE Computer Society's Technical Committee on Mathematical Foundations of Computing
出版情報: Washington, D.C. : IEEE Computer Society Press, c1986  xiv, 517 p. ; 28 cm
所蔵情報: loading…
38.

雑誌

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

図書

図書
sponsored by IEEE Computer Society Technical Committee on Mathematical Foundations of Computing, INRIA
出版情報: Los Alamitos, Calif. ; Tokyo : IEEE Computer Society Press, c1994  xii, 517 p. ; 28 cm
所蔵情報: loading…
40.

図書

図書
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…
41.

図書

図書
edited by Shafi Goldwasser ; sponsored by IEEE Computer Society Technical Committee on Mathematical Foundations of Computing
出版情報: Los Alamitos, Calif. : IEEE Computer Society Press, c1994  xiii, 837 p. ; 28 cm
所蔵情報: loading…
42.

図書

図書
sponsored by the IEEE Computer Society's Technical Committee on Mathematical Foundations of Computing
出版情報: Washington, D.C. ; Tokyo : IEEE Computer Society Press, c1989  xvii, 632 p. ; 28 cm
所蔵情報: loading…
43.

図書

図書
sponsored by IEEE Computer Society Technical Committee on Mathematical Foundations of Computing
出版情報: Los Alamitos, Calif. : IEEE Computer Society Press, c1993  xiii, 745 p. ; 28 cm
所蔵情報: loading…
44.

図書

図書
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…
45.

図書

図書
sponsored by IEEE Computer Society Technical Committee on Mathematical Foundations of Computing ; in cooperation with Association for Computing Machinery-SIGACT ... [et al.]
出版情報: Los Alamitos, CA. ; Tokyo : IEEE Computer Society Press, c1993  xii, 434 p. ; 28 cm
所蔵情報: loading…
46.

図書

図書
sponsored by the IEEE Computer Society's Technical Committee on Mathematical Foundations of Computing
出版情報: Washington, D.C. ; Tokyo : IEEE Computer Society Press, c1988  x, 614 p. ; 28 cm
所蔵情報: loading…
47.

図書

図書
sponsored by the Computer Society's Technical Committee on Mathematical Foundations of Computing
出版情報: Washington, D.C. : Computer Society Press , Los Angeles, CA : Ordered from Computer Society, c1988  xi, 436 p. ; 28 cm
所蔵情報: loading…
48.

図書

図書
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…
49.

図書

図書
[sponsored by IEEE Computer Society Technical Committee on Mathematical Foundations of Computing]
出版情報: Washington, D.C. ; Tokyo : IEEE Computer Society Press, c1989  xvi, 402 p. ; 28 cm
所蔵情報: loading…
50.

図書

図書
IEEE Computer Society. Technical Committee on Mathematical Foundations of Computing ; University of Oregon ; Structure in Complexity Theory Conference
出版情報: Washington, D.C. : IEEE Computer Society Press, c1989  xi, 271 p. ; 28 cm
所蔵情報: loading…
51.

図書

図書
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…
52.

図書

図書
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…
53.

図書

図書
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…
54.

図書

図書
sponsored by the IEEE Computer Society's Technical Committee on Mathematical Foundations of Computing
出版情報: Los Angeles, CA : IEEE Computer Society Press, c1981  429 p. ; 28 cm
所蔵情報: loading…
55.

図書

図書
sponsored by the IEEE Computer Society's Technical Committee on Mathematical Foundations of Computing
出版情報: New York, N.Y. : IEEE Computer Society Press, c1982  vii, 387 p. ; 28 cm
所蔵情報: loading…
56.

図書

図書
sponsored by the IEEE Computer Society's Technical Committee on Mathematical Foundations of Computing
出版情報: New York, N.Y. : IEEE Computer Society Press, c1983  xii, 477 p. ; 28 cm
所蔵情報: loading…
57.

図書

図書
sponsored by the IEEE Computer Society's Technical Committee on Mathematical Foundations of Computing
出版情報: New York, N.Y. : IEEE Computer Society Press, c1984  xii, 518 p. ; 28 cm
所蔵情報: loading…
58.

図書

図書
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…
59.

図書

図書
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…
60.

図書

図書
sponsored by IEEE Technical Committee on Mathematical Foundations of Computing, CWI, Amsterdam, Vrije Universiteit, Amsterdam ; in cooperation with Association for Computing Machinery, Association for Symbolic Logic, European Association for Theoretical Computer Science
出版情報: Los Alamitos, CA. ; Tokyo : IEEE Computer Society Press, c1991  xvii, 417 p. ; 28 cm
所蔵情報: loading…
61.

図書

図書
sponsored by IEEE Computer Society Technical Committee on Mathematical Foundations of Computing
出版情報: Los Alamitos, Cal. ; Tokyo : IEEE Computer Society Press, c1991  xi, 824 p. ; 28 cm
所蔵情報: loading…
62.

図書

図書
sponsored by IEEE Computer Society Technical Committee on Mathematical Foundations of Computing
出版情報: Los Alamitos, CA. : IEEE Computer Society Press, c1992  xi, 734 p. ; 28 cm
所蔵情報: loading…
63.

図書

図書
sponsored by the IEEE Technical Committee on Mathematical Foundations of Computing ; in cooperation with Association for Computing Machinery-SIGACT, Association for Symbolic Logic, European Association for Theoretical Computer Science
出版情報: Los Alamitos, CA. ; Tokyo : IEEE Computer Society Press, c1990  xvi, 509 p. ; 28 cm
所蔵情報: loading…
64.

図書

図書
Structure in Complexity Theory Conference ; IEEE Computer Society. Technical Committee on Mathematical Foundations of Computing ; Universitat Politècnica de Catalunya ; Northeastern University
出版情報: Washington, D.C. : IEEE Computer Society Press, c1990  viii, 320 p. ; 28 cm
所蔵情報: loading…
65.

図書

図書
sponsored by the IEEE Computer Society's Technical Committee on Mathematical Foundations of Computing
出版情報: Los Alamitos, Cal. ; Tokyo : IEEE Computer Society Press, c1990  2 v. (xiv, 881 p.) ; 28 cm
所蔵情報: loading…
66.

図書

図書
organized by Indiana University, Bloomington ; sponsored by IEEE Technical Committee on Mathematical Foundations of Computing ; in cooperation with ACM SIGACT, The Association for Symbolic Logic, The European Association for Theoretical Computer Science ; with support from College of Arts and Sciences, Indiana University, Bloomington ... [et. al]
出版情報: Los Alamitos, Calif. ; Tokyo : IEEE Computer Society, c1998  xv, 538 p. ; 28 cm
所蔵情報: loading…
67.

図書

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

図書

図書
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 Computer Science Department, University of California, Los Angeles, California
出版情報: New York, N.Y. : ACM, c1980  447 p. ; 28 cm
所蔵情報: loading…
69.

図書

図書
sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing ... [et al.] ; in cooperation with ACM-SIGACT, EATCS
出版情報: Los Alamitos : IEEE Computer Society Press, c1992  viii, 347 p. ; 28 cm
所蔵情報: loading…
70.

図書

図書
sponsored by IEEE Computer Society Technical Committee on Mathematical Foundations of Computing
出版情報: Los Alamitos, Calif. : IEEE Computer Society Press, c1995  xiii, 735 p. ; 28 cm
所蔵情報: loading…
71.

図書

図書
sponsored by the IEEE Computer Society's Technical Committee on Mathematical Foundations of Computing, in cooperation with the University of Puerto Rico at Mayaguez and at Rio Piedras
出版情報: Long Beach, Calif. : IEEE Computer Society, c1979  431 p. ; 28 cm
所蔵情報: loading…
72.

図書

図書
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, Rice University, Departments of Mathematical Sciences and Electrical Engineering, the University of Houston, Department of Computer Science
出版情報: Long Beach, CA : IEEE Computer Society, c1976  276 p. ; 28 cm
所蔵情報: loading…
73.

図書

図書
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, the University of Michigan
出版情報: Long Beach, Calif. : IEEE Computer Society, c1978  v, 290 p. ; 28 cm
所蔵情報: loading…
74.

図書

図書
sponsored by IEEE Computer Society Technical Committee on Mathematical Foundations of Computing
出版情報: Los Alamitos, Calif. ; Tokyo : IEEE Computer Society, c2006  xiv, 750 p. ; 28 cm
所蔵情報: loading…
75.

図書

図書
sponsored by IEEE Computer Society Technical Committee on Mathematical Foundations of Computing
出版情報: Los Alamitos, Calif. ; Tokyo : IEEE Computer Society, c2007  xiv, 736 p. ; 28 cm
所蔵情報: loading…
76.

雑誌

雑誌
Symposium on Foundations of Computer Science ; IEEE Computer Society. Technical Committee on Mathematical Foundations of Computing ; ACM Special Interest Group for Automata and Computability Theory ; University of California, Berkeley. Dept. of Electrical Engineering and Computer Sciences
出版情報: Long Beach, Calif. : IEEE Computer Society, 1975-  v. ; 28 cm
巻次年月次: 16th (1975)-
所蔵情報: loading…
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼