Advances in Algorithms, Languages, and Complexity
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer US

9781461333968, 9781461333944

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Coding Complexity: The Computational Complexity of Succinct Descriptions

Advances in Algorithms, Languages, and Complexity ◽

10.1007/978-1-4613-3394-4_3 ◽

1997 ◽

pp. 73-91 ◽

Cited By ~ 2

Author(s):

José L. Balcázar ◽

Ricard Gavaldà ◽

Osamu Watanabe

Keyword(s):

Computational Complexity

Download Full-text

Relaxed Balancing in Search Trees

Advances in Algorithms, Languages, and Complexity ◽

10.1007/978-1-4613-3394-4_13 ◽

1997 ◽

pp. 267-283 ◽

Cited By ~ 8

Author(s):

Eljas Soisalon-Soininen ◽

Peter Widmayer

Keyword(s):

Search Trees

Download Full-text

Properties of Monoids That Are Presented by Finite Convergent String-Rewriting Systems — A Survey

Advances in Algorithms, Languages, and Complexity ◽

10.1007/978-1-4613-3394-4_12 ◽

1997 ◽

pp. 225-266 ◽

Cited By ~ 5

Author(s):

F. Otto ◽

Y. Kobayashi

Keyword(s):

Rewriting Systems ◽

String Rewriting

Download Full-text

Average-Case Intractable NP Problems

Advances in Algorithms, Languages, and Complexity ◽

10.1007/978-1-4613-3394-4_15 ◽

1997 ◽

pp. 313-378 ◽

Cited By ~ 6

Author(s):

Jie Wang

Keyword(s):

Average Case ◽

Np Problems

Download Full-text

Sparse Hard Sets for P

Advances in Algorithms, Languages, and Complexity ◽

10.1007/978-1-4613-3394-4_10 ◽

1997 ◽

pp. 191-208 ◽

Cited By ~ 1

Author(s):

Dieter van Melkebeek ◽

Mitsunori Ogihara

Download Full-text

Genericity and Randomness over Feasible Probability Measures

Advances in Algorithms, Languages, and Complexity ◽

10.1007/978-1-4613-3394-4_8 ◽

1997 ◽

pp. 171-187

Author(s):

Amy K. Lorentz ◽

Jack H. Lutz

Keyword(s):

Probability Measures

Download Full-text

High Sets for NP

Advances in Algorithms, Languages, and Complexity ◽

10.1007/978-1-4613-3394-4_6 ◽

1997 ◽

pp. 139-156 ◽

Cited By ~ 4

Author(s):

Johannes Köbler ◽

Uwe Schöning

Download Full-text

Theorem Proving in Hierarchical Clausal Specifications

Advances in Algorithms, Languages, and Complexity ◽

10.1007/978-1-4613-3394-4_1 ◽

1997 ◽

pp. 1-51 ◽

Cited By ~ 1

Author(s):

J. Avenhaus ◽

K. Madlener

Keyword(s):

Theorem Proving

Download Full-text

A Survey of Continuous-Time Computation Theory

Advances in Algorithms, Languages, and Complexity ◽

10.1007/978-1-4613-3394-4_11 ◽

1997 ◽

pp. 209-224 ◽

Cited By ~ 24

Author(s):

Pekka Orponen

Keyword(s):

Continuous Time ◽

Computation Theory

Download Full-text

Book’s Impact on the Theory of Thue Systems — Abstract

Advances in Algorithms, Languages, and Complexity ◽

10.1007/978-1-4613-3394-4_9 ◽

1997 ◽

pp. 189-190

Author(s):

Robert McNaughton

Download Full-text

Advances in Algorithms, Languages, and ComplexityLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer US

Coding Complexity: The Computational Complexity of Succinct Descriptions

Relaxed Balancing in Search Trees

Properties of Monoids That Are Presented by Finite Convergent String-Rewriting Systems — A Survey

Average-Case Intractable NP Problems

Sparse Hard Sets for P

Genericity and Randomness over Feasible Probability Measures

High Sets for NP

Theorem Proving in Hierarchical Clausal Specifications

A Survey of Continuous-Time Computation Theory

Book’s Impact on the Theory of Thue Systems — Abstract

Advances in Algorithms, Languages, and Complexity
Latest Publications