Lecture Notes in Computer Science - Algorithms and Complexity
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540578116, 9783540483373

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A non-interactive electronic cash system

Lecture Notes in Computer Science - Algorithms and Complexity ◽

10.1007/3-540-57811-0_10 ◽

1994 ◽

pp. 109-124 ◽

Cited By ~ 3

Author(s):

Giovanni Di Crescenzo

Keyword(s):

Electronic Cash

Download Full-text

Learning behaviors of automata from multiplicity and equivalence queries

Lecture Notes in Computer Science - Algorithms and Complexity ◽

10.1007/3-540-57811-0_6 ◽

1994 ◽

pp. 54-62 ◽

Cited By ~ 9

Author(s):

F. Bergadano ◽

S. Varricchio

Keyword(s):

Learning Behaviors ◽

Equivalence Queries

Download Full-text

Advances in graph drawing

Lecture Notes in Computer Science - Algorithms and Complexity ◽

10.1007/3-540-57811-0_2 ◽

1994 ◽

pp. 12-21 ◽

Cited By ~ 2

Author(s):

Ashim Garg ◽

Roberto Tamassia

Keyword(s):

Graph Drawing

Download Full-text

Efficient reorganization of binary search trees

Lecture Notes in Computer Science - Algorithms and Complexity ◽

10.1007/3-540-57811-0_13 ◽

1994 ◽

pp. 152-166 ◽

Cited By ~ 1

Author(s):

Micha Hofri ◽

Hadas Shachnai

Keyword(s):

Binary Search ◽

Binary Search Trees ◽

Search Trees

Download Full-text

On the intellectual terrain around NP

Lecture Notes in Computer Science - Algorithms and Complexity ◽

10.1007/3-540-57811-0_1 ◽

1994 ◽

pp. 1-11

Author(s):

Juris Hartmanis ◽

Suresh Chari

Download Full-text

Lower bounds for merging on the hypercube

Lecture Notes in Computer Science - Algorithms and Complexity ◽

10.1007/3-540-57811-0_18 ◽

1994 ◽

pp. 213-222

Author(s):

Christine Rüb

Keyword(s):

Lower Bounds

Download Full-text

New local search approximation techniques for maximum generalized satisfiability problems

Lecture Notes in Computer Science - Algorithms and Complexity ◽

10.1007/3-540-57811-0_5 ◽

1994 ◽

pp. 40-53 ◽

Cited By ~ 8

Author(s):

Paola Alimonti

Keyword(s):

Local Search ◽

Approximation Techniques ◽

Satisfiability Problems

Download Full-text

On self-reducible sets of low information content

Lecture Notes in Computer Science - Algorithms and Complexity ◽

10.1007/3-540-57811-0_17 ◽

1994 ◽

pp. 203-212

Author(s):

Martin Mundhenk

Keyword(s):

Information Content

Download Full-text

Measures of Boolean function complexity based on Harmonic Analysis

Lecture Notes in Computer Science - Algorithms and Complexity ◽

10.1007/3-540-57811-0_7 ◽

1994 ◽

pp. 63-72 ◽

Cited By ~ 1

Author(s):

A. Bernasconi ◽

B. Codenotti

Keyword(s):

Boolean Function ◽

Harmonic Analysis

Download Full-text

Parallel pruning decomposition (PDS) and biconnected components of graphs

Lecture Notes in Computer Science - Algorithms and Complexity ◽

10.1007/3-540-57811-0_9 ◽

1994 ◽

pp. 91-108

Author(s):

Eliezer Dekel ◽

Jie Hu

Keyword(s):

Biconnected Components

Download Full-text

Lecture Notes in Computer Science - Algorithms and ComplexityLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

A non-interactive electronic cash system

Learning behaviors of automata from multiplicity and equivalence queries

Advances in graph drawing

Efficient reorganization of binary search trees

On the intellectual terrain around NP

Lower bounds for merging on the hypercube

New local search approximation techniques for maximum generalized satisfiability problems

On self-reducible sets of low information content

Measures of Boolean function complexity based on Harmonic Analysis

Parallel pruning decomposition (PDS) and biconnected components of graphs

Lecture Notes in Computer Science - Algorithms and Complexity
Latest Publications