Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 2004
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540228233, 9783540286295

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Schema Evolution for XML: A Consistency-Preserving Approach

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 2004 ◽

10.1007/978-3-540-28629-5_69 ◽

2004 ◽

pp. 876-888 ◽

Cited By ~ 7

Author(s):

Béatrice Bouchou ◽

Denio Duarte ◽

Mírian Halfeld Ferrari Alves ◽

Dominique Laurent ◽

Martin A. Musicante

Keyword(s):

Schema Evolution

Download Full-text

Approximating Earliest Arrival Flows with Flow-Dependent Transit Times

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 2004 ◽

10.1007/978-3-540-28629-5_46 ◽

2004 ◽

pp. 599-610 ◽

Cited By ~ 1

Author(s):

Nadine Baumann ◽

Ekkehard Köhler

Keyword(s):

Transit Times

Download Full-text

Agent-Based Information Handling in Large Networks

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 2004 ◽

10.1007/978-3-540-28629-5_45 ◽

2004 ◽

pp. 586-598 ◽

Cited By ~ 1

Author(s):

Robert Elsässer ◽

Ulf Lorenz ◽

Thomas Sauerwald

Keyword(s):

Large Networks ◽

Agent Based ◽

Information Handling

Download Full-text

Polynomial Time Approximation Schemes and Parameterized Complexity

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 2004 ◽

10.1007/978-3-540-28629-5_38 ◽

2004 ◽

pp. 500-512 ◽

Cited By ~ 2

Author(s):

Jianer Chen ◽

Xiuzhen Huang ◽

Iyad A. Kanj ◽

Ge Xia

Keyword(s):

Polynomial Time ◽

Parameterized Complexity ◽

Approximation Schemes ◽

Time Approximation ◽

Polynomial Time Approximation

Download Full-text

A New Dimension Sensitive Property for Cellular Automata

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 2004 ◽

10.1007/978-3-540-28629-5_31 ◽

2004 ◽

pp. 416-426 ◽

Cited By ~ 4

Author(s):

Vincent Bernardi ◽

Bruno Durand ◽

Enrico Formenti ◽

Jarkko Kari

Keyword(s):

Cellular Automata ◽

Sensitive Property

Download Full-text

Optimization, Games, and Quantified Constraint Satisfaction

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 2004 ◽

10.1007/978-3-540-28629-5_16 ◽

2004 ◽

pp. 239-250 ◽

Cited By ~ 3

Author(s):

Hubie Chen ◽

Martin Pál

Keyword(s):

Constraint Satisfaction

Download Full-text

Protein Folding in the HP Model on Grid Lattices with Diagonals

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 2004 ◽

10.1007/978-3-540-28629-5_15 ◽

2004 ◽

pp. 227-238 ◽

Cited By ~ 1

Author(s):

Hans-Joachim Böckenhauer ◽

Dirk Bongartz

Keyword(s):

Protein Folding ◽

Hp Model

Download Full-text

Group Coloring and List Group Coloring Are Π2 P -Complete

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 2004 ◽

10.1007/978-3-540-28629-5_19 ◽

2004 ◽

pp. 274-286 ◽

Cited By ~ 6

Author(s):

Daniel Král’ ◽

Pavel Nejedlý

Keyword(s):

Group Coloring

Download Full-text

Universal Test for Quantum One-Way Permutations

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 2004 ◽

10.1007/978-3-540-28629-5_66 ◽

2004 ◽

pp. 839-850 ◽

Cited By ~ 1

Author(s):

Akinori Kawachi ◽

Hirotada Kobayashi ◽

Takeshi Koshiba ◽

Raymond H. Putra

Keyword(s):

Universal Test

Download Full-text

Simulating 3D Cellular Automata with 2D Cellular Automata

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 2004 ◽

10.1007/978-3-540-28629-5_33 ◽

2004 ◽

pp. 439-450 ◽

Cited By ~ 1

Author(s):

Victor Poupet

Keyword(s):

Cellular Automata

Download Full-text

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 2004Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Schema Evolution for XML: A Consistency-Preserving Approach

Approximating Earliest Arrival Flows with Flow-Dependent Transit Times

Agent-Based Information Handling in Large Networks

Polynomial Time Approximation Schemes and Parameterized Complexity

A New Dimension Sensitive Property for Cellular Automata

Optimization, Games, and Quantified Constraint Satisfaction

Protein Folding in the HP Model on Grid Lattices with Diagonals

Group Coloring and List Group Coloring Are Π2 P -Complete

Universal Test for Quantum One-Way Permutations

Simulating 3D Cellular Automata with 2D Cellular Automata

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 2004
Latest Publications