Lecture Notes in Computer Science - Foundations of Software Technology and Theoretical Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540620341, 9783540496311

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Circuit complexity before the dawn of the new millennium

Lecture Notes in Computer Science - Foundations of Software Technology and Theoretical Computer Science ◽

10.1007/3-540-62034-6_33 ◽

1996 ◽

pp. 1-18 ◽

Cited By ~ 12

Author(s):

Eric Allender

Keyword(s):

Circuit Complexity ◽

New Millennium

Download Full-text

Non-cancellative Boolean circuits: A generalization of monotone Boolean circuits

Lecture Notes in Computer Science - Foundations of Software Technology and Theoretical Computer Science ◽

10.1007/3-540-62034-6_58 ◽

1996 ◽

pp. 298-309

Author(s):

Rimli Sengupta ◽

H. Venkateswaran

Keyword(s):

Boolean Circuits

Download Full-text

Finite state implementations of knowledge-based programs

Lecture Notes in Computer Science - Foundations of Software Technology and Theoretical Computer Science ◽

10.1007/3-540-62034-6_55 ◽

1996 ◽

pp. 262-273 ◽

Cited By ~ 6

Author(s):

Ron van der Meyden

Keyword(s):

Knowledge Based ◽

Finite State

Download Full-text

Efficient computation of rectilinear geodesic voronoi neighbor in presence of obstacles

Lecture Notes in Computer Science - Foundations of Software Technology and Theoretical Computer Science ◽

10.1007/3-540-62034-6_39 ◽

1996 ◽

pp. 76-87 ◽

Cited By ~ 1

Author(s):

Pinaki Mitra ◽

Subhas C. Nandy

Keyword(s):

Efficient Computation

Download Full-text

On the design of hybrid control systems using automata models

Lecture Notes in Computer Science - Foundations of Software Technology and Theoretical Computer Science ◽

10.1007/3-540-62034-6_46 ◽

1996 ◽

pp. 156-167 ◽

Cited By ~ 9

Author(s):

Dang Van Hung ◽

Wang Ji

Keyword(s):

Control Systems ◽

Hybrid Control ◽

Hybrid Control Systems

Download Full-text

Graph types for monadic mobile processes

Lecture Notes in Computer Science - Foundations of Software Technology and Theoretical Computer Science ◽

10.1007/3-540-62034-6_64 ◽

1996 ◽

pp. 371-386 ◽

Cited By ~ 55

Author(s):

Nobuko Yoshida

Keyword(s):

Mobile Processes

Download Full-text

Correcting type errors in the Curry System

Lecture Notes in Computer Science - Foundations of Software Technology and Theoretical Computer Science ◽

10.1007/3-540-62034-6_62 ◽

1996 ◽

pp. 347-358 ◽

Cited By ~ 1

Author(s):

Milind Gandhe ◽

G. Venkatesh ◽

Amitabha Sanyal

Download Full-text

Higher-order proof by consistency

Lecture Notes in Computer Science - Foundations of Software Technology and Theoretical Computer Science ◽

10.1007/3-540-62034-6_56 ◽

1996 ◽

pp. 274-285 ◽

Cited By ~ 1

Author(s):

Henrik Linnestad ◽

Christian Prehofer ◽

Olav Lysne

Keyword(s):

Higher Order

Download Full-text

Minimal relative normalization in orthogonal expression reduction systems

Lecture Notes in Computer Science - Foundations of Software Technology and Theoretical Computer Science ◽

10.1007/3-540-62034-6_53 ◽

1996 ◽

pp. 238-249 ◽

Cited By ~ 1

Author(s):

John Glauert ◽

Zurab Khasidashvili

Keyword(s):

Relative Normalization

Download Full-text

Optimal and information theoretic syntactic Pattern Recognition involving traditional and transposition errors

Lecture Notes in Computer Science - Foundations of Software Technology and Theoretical Computer Science ◽

10.1007/3-540-62034-6_52 ◽

1996 ◽

pp. 224-237

Author(s):

B. J. Oommen ◽

R. K. S. Loke

Keyword(s):

Pattern Recognition ◽

Syntactic Pattern Recognition ◽

Information Theoretic ◽

Syntactic Pattern

Download Full-text

Lecture Notes in Computer Science - Foundations of Software Technology and Theoretical Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Circuit complexity before the dawn of the new millennium

Non-cancellative Boolean circuits: A generalization of monotone Boolean circuits

Finite state implementations of knowledge-based programs

Efficient computation of rectilinear geodesic voronoi neighbor in presence of obstacles

On the design of hybrid control systems using automata models

Graph types for monadic mobile processes

Correcting type errors in the Curry System

Higher-order proof by consistency

Minimal relative normalization in orthogonal expression reduction systems

Optimal and information theoretic syntactic Pattern Recognition involving traditional and transposition errors

Lecture Notes in Computer Science - Foundations of Software Technology and Theoretical Computer Science
Latest Publications