close
1.

図書

図書
Andrzej Lingas, Bengt J. Nilsson (eds.)
出版情報: Berlin ; Tokyo : Springer, c2003  xii, 431 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2751
所蔵情報: loading…
2.

図書

図書
Peter M.A. Sloot ... [et al.] (eds.)
出版情報: Berlin ; Tokyo : Springer, c2003  4 v. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2657-2660
所蔵情報: loading…
3.

図書

図書
Vipin Kumar ... [et al.] (eds.)
出版情報: Berlin ; Tokyo : Springer, c2003  3 v. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2667-2669
所蔵情報: loading…
4.

図書

図書
Helmut Alt, Michel Habib (eds.)
出版情報: Berlin ; Tokyo : Springer, c2003  xvii, 700 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2607
所蔵情報: loading…
5.

図書

東工大
目次DB

図書
東工大
目次DB
Paritosh K. Pandya, Jaikumar Radhakrishnan (eds.)
出版情報: Berlin ; Tokyo : Springer, c2003  xiii, 446 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2914
所蔵情報: loading…
目次情報: 続きを見る
Contributed Papers
   A Cryptographically Sound Security Proof of the Needham-Schroeder-Lowe Public-Key Protocol Michael Backes, Birgit Pfitzmann 1
   Constructions of Sparse Asymmetric Connectors Andreas Baltz, Gerold Jaeger, Anand Srivastav 13
   A Separation Logic for Resource Distribution Nicolas Biri, Didier Galmiche 23
   An Equational Theory for Transactions Andrew P. Black, Vincent Cremet, Rachid Guerraoui, Martin Odersky 38
   Axioms for Regular Words Stephen L. Boom, Zoltan Esik 50
   1-Bounded TWA Cannot Be Determinized Mikolaj Bojanczyk 62
   Reachability Analysis of Process Rewrite Systems Ahmed Bouajjani, Tayssir Touili 74
   Pushdown Games with Unboundedness and Regular Conditions Alexis-Julien Bouquet, Oliver Serre, Igor Walukiewicz 88
   Real-Time Model-Checking: Parameters Eveywhere Veronique Bruyere, Jean-Francois Raskin 100
   The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata Arnaud Carayol, Stefan Woehrle 112
   Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents Yannick Chevalier, Ralf Kuesters, Michaeel Rusinowitch, Mathieu Turuani 124
   Subtyping Constraints in Quasi-lattices Emmanuel Coquery, Francois Fages 136
   An Improved Approximation Scheme for Computing Arrow-Debreu Prices for the Linear Case Nikhil R. Devanur, Vijay V. Vazirani 149
   Word Equations over Graph Products Volker Diekert, Markus Lohrey 156
   Analysis and Experimental Evaluation of a Simple Algorithm for Collaborative Filtering in Planted Partition Models Devdatt Dubhashi, Luigi Laura, Alessandro Panconesi 168
   Comparing Sequences with Segment Rearrangements Funda Ergun, S. Muthukrishnan, S. Cenk Sahinalp 183
   On Logically Defined Recognizable Tree Languages Zoltan Esik, Pascal Weil 195
   Randomized Time-Space Tradeoffs for Directed Graph Connectivity Parikshit Gopalan, Richard J. Lipton, Aranyak Mehta 208
   Distance-Preserving Approximations of Polygonal Paths Joachim Gudmundsson, Giri Narasimhan, Michiel Smid 217
   Joint Separation of Geometric Clusters and the Extreme Irregularities of Regular Polyhedra Sumanta Guha 229
   On the Covering Steiner Problem Anupam Gupta, Aravind Srinivasan 244
   Minimality Results for the Spatial Logics D. Hirschkoff, E. Lozes, D. Sangiorgi 252
   Algorithms for Non-uniform Size Data Placement on Parallel Disks Srinivas Kashyap, Samir Khuller 265
   Efficient Algorithms for Abelian Group Isomorphism and Related Problems T. Kavitha 277
   Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees Jochen Koenemann, R. Ravi 289
   Model Checking and Satisfiability for Sabotage Modal Logic Christof Loeding, Philipp Rohde 302
   Merging and Sorting By Strip Moves Meena Mahajan, Raghavan Rama, Venkatesh Raman, S. Vijayakumar 314
   The Macro Tree Transducer Hierarchy Collapses for Functions of Linear Size Increase Sebastian Maneth 326
   Distributed Games Swarup Mohalik, Igor Walukiewicz 338
   Maintenance of Multidimensional Histograms S. Muthukrishnan, Martin Strauss 352
   Tagging Makes Secrecy Decidable with Unbounded Nonces as Well R. Ramanujam, S.P. Suresh 363
   Quantum and Classical Complexity Classes: Separations, Collapses, and Closure Properties Holger Spakowski, Mayur Thakur, Rahul Tripathi 375
   On the Greedy Superstring Conjecture Maik Weinard, Georg Schnitger 387
Invited Papers
   Reasoning about Infinite State Systems Using Boolean Methods Randal E. Bryant 399
   Stringent Relativization Jin-Yi Cai, Osamu Watanabe 408
   Component-Based Construction of Deadlock-Free Systems Gregor Goessler, Joseph Sifakis 420
   Moderately Hard Functions: From Complexity to Spam Fighting Moni Naor 434
   Zigzag Products, Expander Constructions, Connections, and Applications Avi Wigderson 443
Author Index 445
Contributed Papers
   A Cryptographically Sound Security Proof of the Needham-Schroeder-Lowe Public-Key Protocol Michael Backes, Birgit Pfitzmann 1
   Constructions of Sparse Asymmetric Connectors Andreas Baltz, Gerold Jaeger, Anand Srivastav 13
6.

図書

図書
Carlo Blundo, Cosimo Laneve (eds.)
出版情報: Berlin ; Tokyo : Springer, c2003  xi, 396 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2841
所蔵情報: loading…
目次情報: 続きを見る
Invited Talks
Extreme Nash Equilibria / Martin Gairing ; Thomas Lücking ; Marios Mavronicolas ; Burkhard Monien ; Paul Spirakis
Certification of Memory Usage / Martin Hofmann
On Programming Models for Mobility / Gérard Boudol
Program Design, Models and Analysis
On the Computational Complexity of Cut-Elimination in Linear Logic / Harry G. Mairson ; Kazushige Terui
A Constructive Proof of the Soundness of the Encoding of Random Access Machines in a Linda Calculus with Ordered Semantics / Claudio Sacerdoti Coen
Finite Horizon Analysis of Stochastic Systems with the Mur Verifier / Giuseppe Della Penna ; Benedetto Intrigila ; Igor Melatti ; Enrico Tronci ; Marisa Venturini Zilli
Towards Compact and Tractable Automaton-Based Representations of Time Granularities / Ugo Dal Lago ; Angelo Montanari ; Gabriele Puppis
Lower Bounds on the Size of Quantum Automata Accepting Unary Languages / Alberto Bertoni ; Carlo Mereghetti ; Beatrice Palano
Refined Effects for Unanticipated Object Re-classification: Fickle3 / Ferruccio Damiani ; Sophia Drossopoulou ; Paola Giannini
Algorithms and Complexity
Cost Constrained Fixed Job Scheduling / Qiwei Huang ; Errol Lloyd
A Work-Optimal Coarse-Grained PRAM Algorithm for Lexicographically First Maximal Independent Set / Jens Gustedt ; Jan Arne Telle
An Approximation Algorithm for the Minimum Weight Vertex-Connectivity Problem in Complete Graphs with Sharpened Triangle Inequality / Alessandro Ferrante ; Mimmo Parente
Channel Assignment in Honeycomb Networks / Alan A. Bertossi ; Cristina M. Pinotti ; Romea Rizzi ; Anil M. Shende
Exact Solution of a Class of Frequency Assignment Problems in Cellular Networks / Tiziana Calamoneri
The Complexity of Checking Consistency of Pedigree Information and Related Problems / Luca Aceto ; Jens A. Hansen ; Anna Ingólfsdóttir ; Jacob Johnsen ; John Knudsen
On Clausal Equivalence and Hull Inclusion / K. Subramani
Semantics and Formal Languages
Logical Semantics for the First Order ?-Calculus / Steffen van Bakel ; Ugo de'Liguoro
On the Expressive Power of Light Affine Logic
Reasoning about Self and Others: Communicating Agents in a Modal Action Logic / Matteo Baldoni ; Cristina Baroglio ; Alberto Martelli ; Viviana Patti
Decidability Properties of Recursive Types / Felice Cardone ; Mario Coppo
Algebraic Theories for Contextual Pre-nets / Roberto Bruni ; Jose Meseguer ; Ugo Montanari ; Vladimiro Sassone
A Coalgebraic Description of Web Interactions / Daniela Cancila ; Furio Honsell
A Calculus for Dynamic Linking / Davide Ancona ; Sonia Fagorzi ; Elena Zucca
Towards a Smart Compilation Manager for Java / Giovanni Lagorio
Security and Cryptography
Anonymous Group Communication in Mobile Networks / Stelvio Cimato ; Paolo D'Arco ; Ivan Visconti
Aspects of Pseudorandomness in Nonlinear Generators of Binary Sequences / Amparo Fúster-Sabater
An Information-Theoretic Approach to the Access Control Problem / Anna Lisa Ferrara ; Barbara Masucci
Security-Aware Program Transformations / Massimo Bartoletti ; Pierpaolo Degano ; Gian Luigi Ferrari
Information Flow Security and Recursive Systems / Annalisa Bossi ; Damiano Macedonio ; Carla Piazza ; Sabina Rossi
Compositional Verification of Secure Streamed Data: A Case Study with EMSS / Fabio Martinelli ; Marinella Petrocchi ; Anna Vaccarelli
Author Index
Invited Talks
Extreme Nash Equilibria / Martin Gairing ; Thomas Lücking ; Marios Mavronicolas ; Burkhard Monien ; Paul Spirakis
Certification of Memory Usage / Martin Hofmann
7.

図書

図書
Hans L. Bodlaender (ed.)
出版情報: Berlin ; Tokyo : Springer, c2003  xi, 386 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2880
所蔵情報: loading…
目次情報: 続きを見る
Invited Lecture
Blow-Ups, Win/Win's, and Crown Rules: Some New Directions in FPT / Michael R. Fellows
Matching, Edge-Colouring, and Dimers / Alexander Schrijver
Regular Papers
Minimum Flow Time Graph Ordering / Claudio Arbib ; Michele Flammini ; Fabrizio Marinelli
Searching Is Not Jumping / Lali Barrière ; Pierre Fraigniaud ; Nicola Santoro ; Dimitrios M. Thilikos
Incremental Integration Tools for Chemical Engineering: An Industrial Application of Triple Graph Grammars / Simon M. Becker ; Bernhard Westfechtel
The Minimum Degree Heuristic and the Minimal Triangulation Process / Anne Berry ; Pinar Heggernes ; Geneviève Simonet
Generalized Parametric Multi-terminal Flows Problem / Pascal Berthomé ; Madiagne Diallo ; Afonso Ferreira
Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generation / Nicolas Bonichon ; Cyril Gavoille ; Nicolas Hanusse
The Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes / Paul Bonsma
Tree Spanners for Bipartite Graphs and Probe Interval Graphs / Andreas Brandstädt ; Feodor F. Dragan ; Hoang-Oanh Le ; Van Bang Le ; Ryuhei Uehara
A Simple Linear Time LexBFS Cograph Recognition Algorithm / Anna Bretscher ; Derek Corneil ; Michel Habib ; Christophe Paul
Backbone Colorings for Networks / Hajo Broersma ; Fedor V. Fomin ; Petr A. Golovach ; Gerhard J. Woeginger
Greedy Edge-Disjoint Paths in Complete Graphs / Paz Carmi ; Thomas Erlebach ; Yoshio Okamoto
Graph-Based Approaches to Software Watermarking / Christian Collberg ; Stephen Kobourov ; Edward Carter ; Clark Thomborson
Completely Connected Clustered Graphs / Sabine Cornelsen ; Dorothea Wagner
An FPT Algorithm for Set Splitting / Frank Dehne ; Frances A. Rosamond
Drawing Planar Graphs on a Curve / Emilio Di Giacomo ; Walter Didimo ; Giuseppe Liotta ; Stephen K. Wismath
Tree-Partitions of k-Trees with Applications in Graph Layout / Vida Dujmovic ; David R. Wood
Resource Allocation Problems in Multifiber WDM Tree Networks / Aris Pagourtzis ; Katerina Potika ; Stamatis Stefanakos
An Improved Upper Bound on the Crossing Number of the Hypercube / Luerbio Faria ; Celina M. Herrera de Figueiredo ; Ondrej Sýkora ; Imrich Vrt'o
NCE GraphGrammarsandClique-Width / Alexander Glikson ; Johann A. Makowsky
Chordal Probe Graphs / Martin Charles Golumbic ; Marina Lipshteyn
Subgraph Induced Planar Connectivity Augmentation / Carsten Gutwenger ; Michael Jünger ; Sebastian Leipert ; Petra Mutzel ; Merijam Percan ; René Weiskircher
On the Recognition of General Partition Graphs / Ton Kloks ; C.M. Lee ; Jiping Liu ; Haiko Müller
Short Cycles in Planar Graphs / Lukasz Kowalik
Complexity of Hypergraph Coloring and Seidel's Switching / Jan Kratochvil
Feedback Vertex Set and Longest Induced Path on AT-Free Graphs / Dieter Kratsch ; Ioan Todinca
The Complexity of Graph Contractions / Asaf Levin ; Daniël Paulusma
Tree Spanners, Cayley Graphs, and Diametrically Uniform Graphs / Paul Manuel ; Bharati Rajan ; Indra Rajasingh ; Amutha Alaguvel
The Probabilistic Minimum Coloring Problem / Cecile Murat ; Vangelis Th. Paschos
Recognizing Bipolarizable and P4-Simplicial Graphs / Stavros D. Nikolopoulos ; Leonidas Palios
Coloring Powers of Graphs of Bounded Clique-Width
Erratum
Erratum: Cycles in Generalized Networks / Franz J. Brandenburg
Author Index
Invited Lecture
Blow-Ups, Win/Win's, and Crown Rules: Some New Directions in FPT / Michael R. Fellows
Matching, Edge-Colouring, and Dimers / Alexander Schrijver
8.

図書

図書
Vijay A. Saraswat (ed.)
出版情報: Berlin ; Tokyo : Springer, c2003  viii, 304 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2896
所蔵情報: loading…
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼