close
1.

図書

図書
Eerke A. Boiten, Bernhard Möller (eds.)
出版情報: Berlin : Springer, c2002  x, 262 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2386
所蔵情報: loading…
目次情報: 続きを見る
Invited Talks
Implementing Algebraic Dynamic Programming in the Functional and the Imperative Programming Paradigm / Robert Giegerich ; Peter Steffen
Some Results in Dynamic Model Theory / Dexter Kozen
Mathematics in Computer Science Curricula / Jeannette M. Wing
Contributed Papers
Logical Relations and Galois Connections / Kevin Backhouse ; Roland Backhouse
Transformational Derivation of Greedy Network Algorithms from Descriptive Specifications / Juan Eduardo Duran
Fine Control of Demand in Haskell / William Harrison ; Tim Sheard ; James Hook
Reasoning about Timeouts / Ian J. Hayes
Eternity Variables to Simulate Specifications / Wim H. Hesselink
Constructing Tournament Representations: An Exercise in Pointwise Relational Programming / Ralf Hinze
Type-Indexed Data Types / Johan Jeuring ; Andres Loh
Verification of JavaÆs AbstractCollection Class: A Case Study / Marieke Huisman
Solving Regular Path Queries / Yanhong A. Liu ; Fuxiang Yu
Inverting Functions as Folds / Shin-Cheng Mu ; Richard Bird
From Kleene Algebra to Refinement Algebra / Joakim von Wright
Author Index
Invited Talks
Implementing Algebraic Dynamic Programming in the Functional and the Imperative Programming Paradigm / Robert Giegerich ; Peter Steffen
Some Results in Dynamic Model Theory / Dexter Kozen
2.

図書

図書
Krzysztof Diks, Wojciech Rytter (eds.)
出版情報: Berlin : Springer, c2002  xii, 652 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2420
所蔵情報: loading…
目次情報: 続きを見る
Invited Talks
Global Development via Local Observational Construction Steps / Michel Bidoit ; Donald Sannella ; Andrzej Tarlecki
Edge-Colouring Pairs of Binary Trees: Towards a Concise Proof of the Four-Colour Theorem of Planar Maps / Alan Gibbons ; Paul Sant
Applications of Finite Automata / Juhani Karhumäki
Approximability of the Minimum Bisection Problem: An Algorithmic Challenge / Marek Karpinski
Low Stretch Spanning Trees / David Peleg
Contributed Talks
On Radiocoloring Hierarchically Specified Planar Graphs: <$>{\cal PSPACE}<$>-Completeness and Approximations / Maria I. Andreou ; Dimitris A. Fotakis ; Sotiris E. Nikoletseas ; Vicky G. Papadopoulou ; Paul G. Spirakis
Finite Domain Constraint Satisfaction Using Quantum Computation / Ola Angelsmark ; Vilhelm Dahllöf ; Peter Jonsson
Fast Algorithms with Algebraic Monge Properties / Wolfgang W. Bein ; Peter Brucker ; Lawrence L. Larmore ; James K. Park
Packing Edges in Random Regular Graphs / Mihalis Beis ; William Duckworth ; Michele Ziio
A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications / Beate Bollig ; Philipp Woelfel
Matroid Intersections, Polymatroid Inequalities, and Related Problems / Endre Boros ; Khaled Elbassioni ; Vladimir Gurvich ; Leonid Khachiyan
Accessibility in Automata on Scattered Linear Orderings / Olivier Carton
On Infinite Terms Having a Decidable Monadic Theory / Didier Caucal
A Chomsky-Like Hierarchy of Infinite Graphs / Teodor Knapik
Competitive Analysis of On-line Stream Merging Algorithms / Wun-Tat Chan ; Tak-Wah Lam ; Hing-Fung Ting ; Prudence W.H. Wong
Coloring k-Colorable Semirandom Graphs in Polynomial Expected Time via Semidefinite Programming / Amin Coja-Oghlan
On Word Equations in One Variable / Robert D&acedil;browski ; Wojtek Plandowski
Autoreducibility of Random Sets: A Sharp Bound on the Density of Guessed Bits / Todd Ebert ; Wolfgang Merkle
Two-Way Finite State Transducers with Nested Pebbles / Joost Engelfriet ; Sebastian Maneth
Optimal Non-preemptive Semi-online Scheduling on Two Related Machines / Leah Epstein ; Lene M. Favrholdt
More on Weighted Servers or Fifo is Better than Lru / Csanád Imreh ; Rob van Stee
On Maximizing the Throughput of Multiprocessor Tasks / Aleksei V. Fishkin ; Guochuan Zhang
Some Results on Random Unsatisfiable k-Sat Instances and Approximation Algorithms Applied to Random Structures / Andreas Goerdt ; Tomasz Jurdziński
Evolutive Tandem Repeats Using Hamming Distance / Richard Groult ; Martine Léonard ; Laurent Mouchard
Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth / MohammadTaghi Hajiaghayi ; Naomi Nishimura
Computing Partial Information out of Intractable One - The First Digit of 2n at Base 3 as an Example / Mika Hirvensalo
Algorithms for Computing Small NFAs / Lucian Ilie ; Sheng Yu
Space-Economical Construction of Index Structures for All Suffixes of a String / Shunsuke Inenaga ; Ayumi Shinohara ; Masayuki Takeda ; Hideo Bannai ; Setsuo Arikawa
An Explicit Lower Bound of 5n - o(n) for Boolean Circuits / Kazuo Iwama ; Hiroki Morizumi
Computational Complexity in the Hyperbolic Plane / Chuzo Iwamoto ; Takeshi Andou ; Kenichi Morita ; Katsunobu Imai
On a Mereological System for Relational Software Specifications / Ryszard Janicki
An Optimal Lower Bound for Resolution with 2-Conjunctions / Jan Johannsen ; N.S. Narayanaswamy
Improved Parameterized Algorithms for Planar Dominating Set / Iyad A. Kanj ; Ljubomir Perković
Optimal Free Binary Decision Diagrams for Computation of EARn / Jan Kára ; Daniel Král'
Unification Modulo Associativity and Idempotency Is NP-complete / Ondřej Klíma
On the Complexity of Semantic Equivalences for Pushdown Automata and BPA / Antonín Kučera ; Richard Mayr
An Improved Algorithm for the Membership Problem for Extended Regular Expressions / Orna Kupferman ; Sharon Zuhovitzky
Efficient Algorithms for Locating the Length-Constrained Heaviest Segments,with Applications to Biomolecular Sequence Analysis / Yaw-Ling Lin ; Tao Jiang ; Kun-Mao Chao
Derivation of Rational Expressions with Multiplicity / Sylvain Lombardy ; Jacques Sakarovitch
Hypothesis-Founded Semantics for Datalog Programs with Negation / Yann Loyer ; Nicolas Spyratos
On the Problem of Scheduling Flows on Distributed Networks / Thomas Lücking ; Burkhard Monien ; Manuel Rode
Unit Testing for CASL Architectural Specifications / Patricia D.L. Machado
Symbolic Semantics and Analysis for Crypto-CCS with (Almost) Generic Inference Systems / Fabio Martinelli
The Complexity of Tree Multicolorings / Dániel Marx
On Verifying Fair Lossy Channel Systems / Benoît Masson ; Ph. Schnoebelen
Parameterized Counting Problems / Catherine McCartin
On the Construction of Effective Random Sets / Nenad Mihailović
On the Structure of the Simulation Order of Proof Systems / Jochen Messner
Comorphism-Based Grothendieck Logics / Till Mossakowski
Finite Test-Sets for Overlap-Free Morphisms / Gwenael Richomme ; Francis Wlazinski
Characterizing Simpler Recognizable Sets of Integers / Michel Rigo
Towards a Cardinality Theorem for Finite Automata / Till Tantau
An Approximation Semantics for the Propositional Mu-Calculus / Roger Villemaire
Author Index
Invited Talks
Global Development via Local Observational Construction Steps / Michel Bidoit ; Donald Sannella ; Andrzej Tarlecki
Edge-Colouring Pairs of Binary Trees: Towards a Concise Proof of the Four-Colour Theorem of Planar Maps / Alan Gibbons ; Paul Sant
3.

図書

図書
Kathleen Steinhöfel (ed.)
出版情報: Berlin : Springer, c2001  viii, 202 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2264
所蔵情報: loading…
目次情報: 続きを見る
Invited Talk
Randomized Communication Protocols (A Survey) / Juraj Hromkovič
Optimal Mutation Rate UsingBayesian Priors for Estimation of Distribution Algorithms / Thilo Mahnig ; Heinz Mühlenbein
An Experimental Assessment of a Stochastic, Anytime, Decentralized, Soft Colourer for Sparse Graphs / Stephen Fitzpatrick ; Lambert Meertens
Randomized BranchingPrograms / Martin Sauerhoff
Yet Another Local Search Method for Constraint Solving / Philippe Codognet ; Daniel Diaz
An Evolutionary Algorithm for the Sequence Coordination in Furniture Production / Carlo Meloni
Evolutionary Search for Smooth Maps in Motor Control Unit Calibration / Jan Poland ; Kosmas Knödler ; Alexander Mitterer ; Thomas Fleischhauer ; Frank Zuber-Goos ; Andreas Zell
Some Notes on Random Satisfiability / Gregory B. Sorkin
Prospects for Simulated AnnealingAlgorithms in Automatic Differentiation / Uwe Naumann ; Peter Gottschling
Optimization and Simulation: Sequential Packingof Flexible Objects Using Evolutionary Algorithms / Henning Behnke ; Michael Kolonko ; Ulrich Mertins ; Stefan Schnitter
Stochastic Finite Learning / Thomas Zeugmann
Sequential SamplingAlgorithms: Unified Analysis and Lower Bounds / Ricard Gavaldà ; Osamu Watanabe
Approximate Location of Relevant Variables under the Crossover Distribution / Peter Damaschke
Author Index
Invited Talk
Randomized Communication Protocols (A Survey) / Juraj Hromkovič
Optimal Mutation Rate UsingBayesian Priors for Estimation of Distribution Algorithms / Thilo Mahnig ; Heinz Mühlenbein
4.

図書

図書
Maura Cerioli, Gianna Reggio (eds.)
出版情報: Berlin : Springer, c2001  x, 343 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2267
所蔵情報: loading…
5.

図書

図書
Joanna Jędrzejowicz, Andrzej Szepietowski (eds.)
出版情報: Berlin : Springer, c2005  xvi, 814 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 3618
所蔵情報: loading…
6.

図書

図書
Jiří Fiala, Václav Koubek, Jan Kratochvíl (eds.)
出版情報: Berlin ; Tokyo : Springer, c2004  xiv, 902 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 3153
所蔵情報: loading…
7.

図書

図書
Johan Jeuring (ed.)
出版情報: Berlin : Springer, c1998  x, 382 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1422
所蔵情報: loading…
8.

図書

図書
Rastislav Královič, Paweł Urzyczyn (eds.)
出版情報: Berlin : Springer, c2006  xv, 814 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 4162
所蔵情報: loading…
9.

図書

図書
Dexter Kozen (ed.)
出版情報: Berlin : Springer, c2004  x, 399 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 3125
所蔵情報: loading…
10.

図書

図書
Didier Bert, Christine Choppy, Peter Mosses (eds.)
出版情報: Berlin : Springer, c2000  x, 476 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1827
所蔵情報: loading…
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼