LATIN '95: Theoretical Informatics - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540591757, 9783540492207

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On linear-time alphabet-independent 2-dimensional pattern matching

LATIN '95: Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/3-540-59175-3_91 ◽

1995 ◽

pp. 220-229

Author(s):

Maxime Crochemore ◽

Wojciech Rytter

Keyword(s):

Pattern Matching ◽

Linear Time

Download Full-text

Paging more than one page

LATIN '95: Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/3-540-59175-3_95 ◽

1995 ◽

pp. 272-285

Author(s):

Esteban Feuerstein

Download Full-text

A rewrite approach for constraint logic programming

LATIN '95: Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/3-540-59175-3_111 ◽

1995 ◽

pp. 469-482

Author(s):

Gilles Richard ◽

Frédéric Saubion

Keyword(s):

Logic Programming ◽

Constraint Logic Programming

Download Full-text

On monotonous oracle machines

LATIN '95: Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/3-540-59175-3_108 ◽

1995 ◽

pp. 436-448

Author(s):

M. Mundhenk

Download Full-text

Lower bounds for the modular communication complexity of various graph accessibility problems

LATIN '95: Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/3-540-59175-3_107 ◽

1995 ◽

pp. 427-435 ◽

Cited By ~ 2

Author(s):

Christoph Meinel ◽

Stephan Waack

Keyword(s):

Lower Bounds ◽

Communication Complexity

Download Full-text

Lower bounds for the matrix chain ordering problem

LATIN '95: Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/3-540-59175-3_85 ◽

1995 ◽

pp. 112-130

Author(s):

Phillip G. Bradford ◽

Venkatesh Choppella ◽

Gregory J. E. Rawlins

Keyword(s):

Lower Bounds ◽

The Matrix ◽

Chain Ordering

Download Full-text

On using learning automata for fast graph partitioning

LATIN '95: Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/3-540-59175-3_109 ◽

1995 ◽

pp. 449-460

Author(s):

B. John Oommen ◽

Edward V. Croix

Keyword(s):

Graph Partitioning ◽

Learning Automata

Download Full-text

On the relation between BDDs and FDDs

LATIN '95: Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/3-540-59175-3_82 ◽

1995 ◽

pp. 72-83 ◽

Cited By ~ 2

Author(s):

Bernd Becker ◽

Rolf Drechsler ◽

Ralph Werchner

Download Full-text

A new approach for routing in arrangement graphs and its performance evaluation

LATIN '95: Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/3-540-59175-3_114 ◽

1995 ◽

pp. 509-523

Author(s):

Peter M. Yamakawa ◽

Hiroyuki Ebara ◽

Hideo Nakano

Keyword(s):

Performance Evaluation ◽

New Approach

Download Full-text

Simulations between cellular automata on cayley graphs

LATIN '95: Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/3-540-59175-3_112 ◽

1995 ◽

pp. 483-493 ◽

Cited By ~ 3

Author(s):

Zsuzsanna Róka

Keyword(s):

Cellular Automata ◽

Cayley Graphs

Download Full-text

LATIN '95: Theoretical Informatics - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

On linear-time alphabet-independent 2-dimensional pattern matching

Paging more than one page

A rewrite approach for constraint logic programming

On monotonous oracle machines

Lower bounds for the modular communication complexity of various graph accessibility problems

Lower bounds for the matrix chain ordering problem

On using learning automata for fast graph partitioning

On the relation between BDDs and FDDs

A new approach for routing in arrangement graphs and its performance evaluation

Simulations between cellular automata on cayley graphs

LATIN '95: Theoretical Informatics - Lecture Notes in Computer Science
Latest Publications