close
1.

図書

図書
Peter Widmayer ... [et al.] (eds.)
出版情報: Berlin : Springer, c2002  xxi, 1069 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2380
所蔵情報: loading…
目次情報: 続きを見る
Invited Talks
Molecular Assembly and Computation: From Theory to Experimental Demonstrations / John H. Reif
Towards a Predictive Computational Complexity Theory / Madhav V. Marathe
Equivariant Syntax and Semantics / Andrew M. Pitts
L(A) = L(B)? Decidability Results from Complete Formal Systems / Géraud Sénizergues (Gödel Prize 2002)
Discrete Tomography: Reconstruction under Periodicity Constraints / Alberto Del Lungo ; Andrea Frosini ; Maurice Nivat ; Laurent Vuillon
Local and Global Methods in Data Mining: Basic Techniques and Open Problems / Heikki Mannila
Program Debugging and Validation Using Semantic Approximations and Partial Specifications / M. Hermenegildo ; G. Puebla ; F. Bueno ; P. López García
Best Papers
Inapproximability Results for Equations over Finite Groups / Lars Engebretsen ; Jonas Holmerin ; Alexander Russell
A Faster All-Pairs Shortest Path Algorithm for Real-Weighted Sparse Graphs / Seth Pettie
On Families of Graphs Having a Decidable First Order Theory with Reachability / Thomas Colcombet
Contributions
Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet / Alex Fabrikant ; Elias Koutsoupias ; Christos H. Papadimitriou
The Structure and Complexity of Nash Equilibria for a Selfish Routing Game / Dimitris Fotakis ; Spyros Kontogiannis ; Marios Mavronicolas ; Paul Spirakis
Control Message Aggregation in Group Communication Protocols / Sanjeev Khanna ; Joseph (Seffi) Naor ; Dan Raz
Church-Rosser Languages vs. UCFL / Tomasz Jurdziński ; Krzysztof Loryś
Intersection of Regular Languages and Star Hierarchy / Sebastian Bala
On the Construction of Reversible Automata for Reversible Languages / Sylvain Lombardy
Priority Queues, Pairing, and Adaptive Sorting / Amr Elmasry
Exponential Structures for Efficient Cache-Oblivious Algorithms / Michael A. Bender ; Richard Cole ; Rajeev Raman
Bounded-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz Refutations / Russell Impagliazzo ; Nathan Segerlind
On the Complexity of Resolution with Bounded Conjunctions / Juan Luis Esteban ; Nicola Galesi ; Jochen Messner
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes / Aggelos Kiayias ; Moti Yung
Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials / Yuval Ishai ; Eyal Kushilevitz
Exponential Lower Bound for Static Semi-algebraic Proofs / Dima Grigoriev ; Edward A. Hirsch ; Dmitrii V. Pasechnik
Paths Problems in Symmetric Logarithmic Space / Andreas Jakoby ; Maciej Liśkiewicz
Scheduling Search Procedures / Peter Damaschke
Removable Online Knapsack Problems / Kazuo Iwama ; Shiro Taketomi
New Bounds for Variable-Sized and Resource Augmented Online Bin Packing / Leah Epstein ; Steve Seiden ; Rob van Stee
The Quest for Small Universal Cellular Automata / Nicolas Ollinger
Hyperbolic Recognition by Graph Automata / Christophe Papazian ; Eric Rémila
Quantum and Stochastic Branching Programs of Bounded Width / Farid Ablayev ; Cristopher Moore ; Christopher Pollett
Spanning Trees with Bounded Number of Branch Vertices / Luisa Gargano ; Pavol Hell ; Ladislav Stacho ; Ugo Vaccaro
Energy Optimal Routing in Radio Networks Using Geometric Data Structures / René Beier ; Peter Sanders ; Naveen Sivadasan
Gossiping with Bounded Size Messages in ad hoc Radio Networks / Malin Christersson ; Leszek G&acedil;sieniec ; Andrzej Lingas
The Kolmogorov-Loveland Stochastic Sequences Are Not Closed under Selecting Subsequences / Wolfgang Merkle
The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications / Robert A. Hearn ; Erik D. Demaine
Constraint Satisfaction Problems in Non-deterministic Logarithmic Space / Víctor Dalmau
Cache Oblivious Distribution Sweeping / Gerth Stølting Brodal ; Rolf Fagerberg
One-Probe Search / Anna Östlin ; Rasmus Pagh
New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems / Moses Charikar ; Piotr Indyk ; Rina Panigrahy
Measuring the Probabilistic Powerdomain / Keye Martin ; Michael Mislove ; James Worrell
Games Characterizing Levy-Longo Trees / C.-H.L. Ong ; P. Di Gianantonio
Comparing Functional Paradigms for Exact Real-Number Computation / Andrej Bauer ; Martín Hötzel Escardó ; Alex Simpson
Random Sampling from Boltzmann Principles / Philippe Duchon ; Philippe Flajolet ; Guy Louchard ; Gilles Schaeffer
On the Average Performance of Orthogonal Range Search in Multidimensional Data Structures / Amalia Duch ; Conrado Martínez
Bialgebraic Modelling of Timed Processes / Marco Kick
Testing Labelled Markov Processes / Franck van Breugel ; Steven Shalit
Why Computational Complexity Requires Stricter Martingales / John M. Hitchcock ; Jack H. Lutz
Correspondence Principles for Effective Dimensions
A Total Approach to Partial Algebraic Specification / José Meseguer ; Grigore Roşu
Axiomatising Divergence / Markus Lohrey ; Pedro R. D'Argenio ; Holger Hermanns
A Spatial Logic for Querying Graphs / Luca Cardelli ; Philippa Gardner ; Giorgio Ghelli
Improving Time Bounds on Maximum Generalised Flow Computations by Contracting the Network / Tomasz Radzik
Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION / Piotr Berman ; Marek Karpinski
Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths / Camil Demetrescu ; Giuseppe F. Italiano
Synthesis of Uninitialized Systems / Thomas A. Henzinger ; Sriram C. Krishnan ; Orna Kupferman ; Freddy Y.C. Mang
Infinite-State High-Level MSCs: Model-Checking and Realizability / Blaise Genest ; Anca Muscholl ; Helmut Seidl ; Marc Zeitoun
Universal Inherence of Cycle-Free Context-Free Ambiguity Functions / Klaus Wich
Histogramming Data Streams with Fast Per-Item Processing / Sudipto Guha ; S. Muthukrishnan ; Martin J. Strauss
Finding Frequent Items in Data Streams / Kevin Chen ; Martin Farach-Colton
Symbolic Strategy Synthesis for Games on Pushdown Graphs / Thierry Cachat
Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard / Jiří Srba
Solving the String Statistics Problem in Time <$>{\cal O}<$>(n log n) / Rune B. Lyngsø ; Christian N.S. Pedersen
A PTAS for Distinguishing (Sub)string Selection / Xiaotie Deng ; Guojun Li ; Zimao Li ; Bin Ma ; Lusheng Wang
On the Theory of One-Step Rewriting in Trace Monoids / Dietrich Kuske
Navigating with a Browser / Michail Bielecki ; Jan Hidders ; Jan Paredaens ; Jerzy Tyszkiewicz ; Jan Van den Bussche
Improved Results for Stackelberg Scheduling Strategies / V.S. Anil Kumar
Call Control in Rings / Udo Adamy ; Christoph Ambuehl ; R. Sai Anand ; Thomas Erlebach
Preemptive Scheduling in Overloaded Systems / Marek Chrobak ; John Noga ; Jiří Sgall ; Tomáš Tichý ; Nodari Vakhania
The Equivalence Problem of Finite Substitutions on ab*c, with Applications / J. Karhumäki ; L.P. Lisovik
Deciding DPDA Equivalence Is Primitive Recursive / Colin Stirling
Two-Way Alternating Automata and Finite Models / Mikolaj Bojańczyk
Approximating Huffman Codes in Parallel / Yakov Nekrich
Seamless Integration of Parallelism and Memory Hierarchy / Carlo Fantozzi ; Andrea Pietracaprina ; Geppino Pucci
The Communication Complexity of Approximate Set Packing and Covering / Noam Nisan
Antirandomizing the Wrong Game / Benjamin Doerr
Fast Universalization of Investment Strategies with Provably Good Relative Returns / Karhan Akcoglu ; Petros Drineas ; Ming-Yang Kao
Randomized Pursuit-Evasion in Graphs / Micah Adler ; Harald Räcke ; Christian Sohler ; Berthold Vöcking
The Essence of Principal Typings / J. B. Wells
Complete and Tractable Local Linear Time Temporal Logics over Traces / Bharat Adsul ; Milind Sohoni
An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces / Paul Gastin ; Madhavan Mukund
Random Numbers and an Incomplete Immune Recursive Set / Vasco Brattka
A Banach-Mazur Computable But Not Markov Computable Function on the Computable Real Numbers / Peter Hertling
Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem / Artur Czumaj ; Hairong Zhao
Finding a Path of Superlogarithmic Length / Andreas Björklund ; Thore Husfeldt
Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs / Ryuhei Uehara
Improved Inapproximability Results for Vertex Cover on k-Uniform Hypergraphs
Efficient Testing of Hypergraphs / Yoshiharu Kohayakawa ; Brendan Nagle ; Vojtěch Rödl
Optimal Net Surface Problems with Applications / Xiaodong Wu ; Danny Z. Chen
Wagner's Theorem on Realizers / Nicolas Bonichon ; Bertrand Le Saëc ; Mohamed Mosbah
Circular Arrangements / Vincenzo Liberatore
Author Index
Invited Talks
Molecular Assembly and Computation: From Theory to Experimental Demonstrations / John H. Reif
Towards a Predictive Computational Complexity Theory / Madhav V. Marathe
2.

図書

図書
Holger Hermanns, Roberto Segala (eds.)
出版情報: Berlin ; Tokyo : Springer, c2002  x, 214 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2399
所蔵情報: loading…
目次情報: 続きを見る
Invited Contributions
Failure Detection vs Group Membership in Fault-Tolerant Distributed Systems: Hidden Trade-Offs / André Schiper
Probability and Timing: Challenges for Secure Programming / David Sands
Selected Papers
Security Analysis of a Probabilistic Non-repudiation Protocol / Alessandro Aldini ; Roberto Gorrieri
The Mean Value of the Maximum / Henrik Bohnenkamp ; Boudewijn Haverkort
Reduction and Refinement Strategies for Probabilistic Analysis / Pedro R. D'Argenio ; Bertrand Jeannet ; Henrik E. Jensen ; Kim G. Larsen
Action Refinement for Probabilistic Processes with True Concurrency Models / Harald Fecher ; Mila Majster-Cederbaum ; Jinzhao Wu
Probabilistic Unfoldings and Partial Order Fairness in Petri Nets / Stefan Haar
Possibilistic and Probabilistic Abstraction-Based Model Checking / Michael Huth
Out-of-Core Solution of Large Linear Systems of Equations Arising from Stochastic Modelling / Marta Kwiatkowska ; Rashid Mehmood
Model Checking CSL until Formulae with Random Time Bounds / Gethin Norman ; António Pacheco
Probabilistic Model Checking of the IEEE 802.11 Wireless Local Area Network Protocol / Jeremy Sproston
Deriving Symbolic Representations from Stochastic Process Algebras / Matthias Kuntz ; Markus Siegle
Short Abstracts
A Generalization of Equational Proof Theory? / Olivier Bournez
An Integrated Approach for the Specification and Analysis of Stochastic Real-Time Systems / Mario Bravetti
Probabilistic Abstract Interpretation and Statistical Testing / Alessandra Di Pierro ; Herbert Wiklicky
Approximate Verification of Probabilistic Systems / Richard Lassaigne ; Sylvain Peyronnet
Author Index
Invited Contributions
Failure Detection vs Group Membership in Fault-Tolerant Distributed Systems: Hidden Trade-Offs / André Schiper
Probability and Timing: Challenges for Secure Programming / David Sands
3.

図書

図書
Oliver Boldt, Helmut Jürgensen (eds.)
出版情報: Berlin : Springer, c2001  viii, 182 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2214
所蔵情報: loading…
目次情報: 続きを見る
FA Minimisation Heuristics for a Class of Finite Languages / Jérôme Amilhastre ; Philippe Janssen ; Marie-Catherine Vilarem
SEA: A Symbolic Environment for Automata Theory / Philippe Andary ; Pascal Caron ; Jean-Marc Champarnaud ; Gerard Duchamp ; Marianne Flouret ; éric Laugerotte
Analysis of Reactive Systems with n Timers / Anne Bergeron ; Riccardo Catalano
Animation of the Generation and Computation of Finite Automata for Learning Software / Beatrix Braune ; Stephan Diehl ; Andreas Kerren ; Reinhard Wilhelm
Metric Lexical Analysis / Cristian S. Calude ; Kai Salomaa ; ShengYu
State Complexity of Basic Operations on Finite Languages / C. Câmpeanu ; K. Culik ; K. Salomaa ; S. Yu
Treatment of Unknown Words / Jan Daciuk
Computing Entropy Maps of Finite-Automaton-Encoded Binary Images / Mark G. Eramian
Thompson Digraphs: A Characterization / Dora Giammarresi ; Jean-Luc Ponty ; Derick Wood
Finite Automata Encoding Geometric Figures / Helmut Jurgensen ; Ludwig Staiger
Compressed Storage of Sparse Finite-State Transducers / George Anton Kiraz
An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing / Gertjan van Noord ; Dale Gerdemann
Multiset Processing by Means of Systems of Finite State Transducers / Gheorghe Păun ; Gabriel Thierrin
A Structural Method for Output Compaction of Sequential Automata Implemented as Circuits / M. Seuring ; M. Gossel
An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata / A.N. Trahtman
A Taxonomy of Algorithms for Constructing Minimal Acyclic Deterministic Finite Automata / Bruce W. Watson
Author Index
FA Minimisation Heuristics for a Class of Finite Languages / Jérôme Amilhastre ; Philippe Janssen ; Marie-Catherine Vilarem
SEA: A Symbolic Environment for Automata Theory / Philippe Andary ; Pascal Caron ; Jean-Marc Champarnaud ; Gerard Duchamp ; Marianne Flouret ; éric Laugerotte
Analysis of Reactive Systems with n Timers / Anne Bergeron ; Riccardo Catalano
4.

図書

図書
Fernando Orejas, Paul G. Spirakis, Jan van Leeuwen (eds.)
出版情報: Berlin : Springer, c2001  xiv, 1083 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2076
所蔵情報: loading…
5.

図書

図書
Maurice Margenstern, Yurii Rogozhin (eds.)
出版情報: Berlin : Springer, c2001  viii, 319 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2055
所蔵情報: loading…
目次情報: 続きを見る
Invited Lectures
Three Small Universal Turing Machines / Claudio Baiocchi
Computation in Gene Networks / Asa Ben-Hur ; Hava T. Siegelmann
Power, Puzzles and Properties of Entanglement / Jozef Gruska ; Hiroshi Imai
Combinatorial and Computational Problems on Finite Sets of Words / Juhani Karhumaki
Computing with Membranes (P Systems): Universality Results / Carlos Martín-Vide ; Gheorghe Paun
A Simple Universal Logic Element and Cellular Automata for Reversible Computing / Kenichi Morita
Some Applications of the Decidability of DPDAÆs Equivalence / Geraud Senizergues
The Equivalence Problem for Computational Models: Decidable and Undecidable Cases / Vladimir A. Zakharov
Two Normal Forms for Rewriting P Systems / Claudio Zandron ; Claudio Ferretti ; Giancarlo Mauri
Technical Contributions
On a Conjecture of Kurka. A Turing Machine with No Periodic Configurations / Vincent D. Blondel ; Julien Cassaigne ; Codrin Nichitiu
On the Transition Graphs of Turing Machines / Didier Caucal
JC-Nets / Gabriel Ciobanu ; Mihai Rotaru
Nonterminal Complexity of Programmed Grammars / Henning Fernau
On the Number of Non-terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars / Rudolf Freund
A Direct Construction of a Universal Extended H System / Pierluigi Frisco
Speeding-Up Cellular Automata by Alternations / Chuzo Iwamoto ; Katsuyuki Tateishi ; Katsunobu Imai
Efficient Universal Pushdown Cellular Automata and Their Application to Complexity / Martin Kutrib
Firing Squad Synchronization Problem on Bidimensional Cellular Automata with Communication Constraints / Salvatore La Torre ; Margherita Napoli ; Mimmo Parente
P Systems with Membrane Creation: Universality and Efficiency / Madhu Mutyam ; Kamala Krithivasan
On the Computational Power of a Continuous-Space Optical Model of Computation / Thomas J. Naughton ; Damien Woods
On a P-optimal Proof System for the Set of All Satisfiable Boolean Formulas (SAT) / Zenon Sadowski
D0L System = Watson-Crick Complementarity=Universal Computation / Petr Sosík
Author Index
Invited Lectures
Three Small Universal Turing Machines / Claudio Baiocchi
Computation in Gene Networks / Asa Ben-Hur ; Hava T. Siegelmann
6.

図書

図書
Egon Börger, Angelo Gargantini, Elvinia Riccobene (eds.)
出版情報: Berlin ; Tokyo : Springer, c2003  xi, 424 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2589
所蔵情報: loading…
7.

図書

図書
Clemens Grelck ... [et al.] (eds.)
出版情報: Berlin ; Tokyo : Springer, c2005  x, 225 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 3474
所蔵情報: loading…
8.

図書

図書
Michael Domaratzki ... [et al.] (eds.)
出版情報: Berlin ; Tokyo : Springer, c2005  xii, 336 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 3317
所蔵情報: loading…
9.

図書

図書
Josep Díaz ... [et al.] (eds.)
出版情報: Berlin ; Tokyo : Springer, c2004  xix, 1253 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 3142
所蔵情報: loading…
10.

図書

図書
Jean-Marc Champarnaud, Denis Maurel, Djelloul Ziadi (eds.)
出版情報: Berlin : Springer, c1999  x, 243 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1660
所蔵情報: loading…
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼