Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540678236, 9783540449294

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Ambient Groups and Mobility Types

Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/3-540-44929-9_25 ◽

2000 ◽

pp. 333-347 ◽

Cited By ~ 40

Author(s):

Luca Cardelli ◽

Giorgio Ghelli ◽

Andrew D. Gordon

Download Full-text

A Single Complete Refinement Rule for Demonic Specifications

Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/3-540-44929-9_39 ◽

2000 ◽

pp. 564-579

Author(s):

Karl Lermer ◽

Paul Strooper

Download Full-text

Local π-Calculus at Work: Mobile Objects as Mobile Processes

Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/3-540-44929-9_28 ◽

2000 ◽

pp. 390-408 ◽

Cited By ~ 1

Author(s):

Massimo Merro ◽

Josva Kleist ◽

Uwe Nestmann

Keyword(s):

Mobile Objects ◽

Mobile Processes ◽

Π Calculus

Download Full-text

Alternating Automata and Logics over Infinite Words

Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/3-540-44929-9_36 ◽

2000 ◽

pp. 521-535 ◽

Cited By ~ 26

Author(s):

Christof Loding ◽

Wolfgang Thomas

Keyword(s):

Infinite Words ◽

Alternating Automata

Download Full-text

Some New Directions in the Syntax and Semantics of Formal Languages

Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/3-540-44929-9_41 ◽

2000 ◽

pp. 596-596

Author(s):

Gordon D. Plotkin

Keyword(s):

Formal Languages ◽

New Directions

Download Full-text

Damage Spreading and μ-Sensitivity on Cellular Automata

Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/3-540-44929-9_18 ◽

2000 ◽

pp. 226-241 ◽

Cited By ~ 1

Author(s):

Bruno Martin

Keyword(s):

Cellular Automata ◽

Damage Spreading

Download Full-text

It Is on the Boundary: Complexity Considerations for Polynomial Ideals

Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/3-540-44929-9_8 ◽

2000 ◽

pp. 99-99

Author(s):

Ernst W. Mayr

Keyword(s):

Polynomial Ideals ◽

Boundary Complexity

Download Full-text

An Efficient Parallel Algorithm for Scheduling Interval Ordered Tasks

Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/3-540-44929-9_9 ◽

2000 ◽

pp. 100-111

Author(s):

Yoojin Chung ◽

Kunsoo Park ◽

Hyuk-Chul Kwon

Keyword(s):

Parallel Algorithm

Download Full-text

The (σ + 1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges of a Graph

Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/3-540-44929-9_14 ◽

2000 ◽

pp. 169-185 ◽

Cited By ~ 1

Author(s):

Satoshi Taoka ◽

Toshimasa Watanabe

Keyword(s):

Edge Connectivity ◽

Connectivity Augmentation ◽

Multiple Edges

Download Full-text

New Challenges for Computational Models

Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/3-540-44929-9_46 ◽

2000 ◽

pp. 612-613

Author(s):

Yoshihito Toyama

Keyword(s):

Computational Models ◽

New Challenges

Download Full-text

Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Ambient Groups and Mobility Types

A Single Complete Refinement Rule for Demonic Specifications

Local π-Calculus at Work: Mobile Objects as Mobile Processes

Alternating Automata and Logics over Infinite Words

Some New Directions in the Syntax and Semantics of Formal Languages

Damage Spreading and μ-Sensitivity on Cellular Automata

It Is on the Boundary: Complexity Considerations for Polynomial Ideals

An Efficient Parallel Algorithm for Scheduling Interval Ordered Tasks

The (σ + 1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges of a Graph

New Challenges for Computational Models

Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics - Lecture Notes in Computer Science
Latest Publications