Automata, Languages and Programming - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540677154, 9783540450221

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Negation Elimination from Simple Equational Formulae

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-45022-x_52 ◽

2000 ◽

pp. 612-623 ◽

Cited By ~ 1

Author(s):

Reinhard Pichler

Download Full-text

Constraint Programming and Graph Algorithms

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-45022-x_48 ◽

2000 ◽

pp. 571-575

Author(s):

Kurt Mehlhorn

Keyword(s):

Constraint Programming ◽

Graph Algorithms

Download Full-text

Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-45022-x_3 ◽

2000 ◽

pp. 13-24 ◽

Cited By ~ 7

Author(s):

Michael Krivelevich ◽

H. Van Vu

Keyword(s):

Chromatic Number ◽

Polynomial Time ◽

Independence Number

Download Full-text

An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-45022-x_25 ◽

2000 ◽

pp. 283-295 ◽

Cited By ~ 4

Author(s):

Steven S. Seiden

Keyword(s):

Online Algorithm ◽

Bin Packing ◽

Space Variable ◽

Bounded Space

Download Full-text

An Automata-Theoretic Completeness Proof for Interval Temporal Logic

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-45022-x_19 ◽

2000 ◽

pp. 223-234 ◽

Cited By ~ 6

Author(s):

Ben C. Moszkowski

Keyword(s):

Temporal Logic ◽

Completeness Proof ◽

Interval Temporal Logic

Download Full-text

Graph Transformation as a Conceptual and Formal Framework for System Modeling and Model Evolution

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-45022-x_12 ◽

2000 ◽

pp. 127-150 ◽

Cited By ~ 11

Author(s):

Gregor Engels ◽

Reiko Heckel

Keyword(s):

Graph Transformation ◽

System Modeling ◽

Model Evolution ◽

Formal Framework

Download Full-text

One-Round Secure Computation and Secure Autonomous Mobile Agents

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-45022-x_43 ◽

2000 ◽

pp. 512-523 ◽

Cited By ~ 55

Author(s):

Christian Cachin ◽

Jan Camenisch ◽

Joe Kilian ◽

Joy Müller

Keyword(s):

Mobile Agents ◽

Secure Computation

Download Full-text

Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-45022-x_21 ◽

2000 ◽

pp. 236-247 ◽

Cited By ~ 13

Author(s):

Evgeny Dantsin ◽

Andreas Goerdt ◽

Edward A. Hirsch ◽

Uwe Schöning

Keyword(s):

Local Search ◽

Deterministic Algorithms ◽

Covering Codes

Download Full-text

A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-45022-x_59 ◽

2000 ◽

pp. 705-717 ◽

Cited By ~ 3

Author(s):

Leslie Ann Goldberg ◽

Mark Jerrum ◽

Sampath Kannan ◽

Mike Paterson

Download Full-text

Polynomial Time Approximation Schemes for General Multiprocessor Job Shop Scheduling

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-45022-x_74 ◽

2000 ◽

pp. 878-889 ◽

Cited By ~ 3

Author(s):

Klaus Jansen ◽

Lorant Porkolab

Keyword(s):

Polynomial Time ◽

Job Shop ◽

Job Shop Scheduling ◽

Approximation Schemes ◽

Time Approximation ◽

Shop Scheduling ◽

Polynomial Time Approximation

Download Full-text

Automata, Languages and Programming - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Negation Elimination from Simple Equational Formulae

Constraint Programming and Graph Algorithms

Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time

An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing

An Automata-Theoretic Completeness Proof for Interval Temporal Logic

Graph Transformation as a Conceptual and Formal Framework for System Modeling and Model Evolution

One-Round Secure Computation and Secure Autonomous Mobile Agents

Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search

A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols

Polynomial Time Approximation Schemes for General Multiprocessor Job Shop Scheduling

Automata, Languages and Programming - Lecture Notes in Computer Science
Latest Publications