close
1.

図書

図書
sponsored by ACM SIGACT, ACM SIGARCH ; in cooperation with EATCS
出版情報: New York : Association for Computing Machinery, c2002  viii, 294 p. ; 28 cm
所蔵情報: loading…
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 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…
4.

図書

図書
Kim G. Larsen, Sven Skyum, Glynn Winskel (eds.)
出版情報: Berlin ; Tokyo : Springer, c1998  xvi, 932 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1443
所蔵情報: loading…
5.

図書

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

図書

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

図書

図書
Jiří Wiedermann, Peter van Emde Boas, Mogens Nielsen (eds.)
出版情報: Berlin ; Tokyo : Springer, c1999  xiv, 720 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1644
所蔵情報: loading…
8.

図書

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

図書

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

図書

図書
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…
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼