Discrete Algorithms and Complexity
Latest Publications

TOTAL DOCUMENTS

32

(FIVE YEARS 0)

H-INDEX

5

(FIVE YEARS 0)

Published By Elsevier

9780123868701

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

COMPETITIVE SNOOPY CACHING11A preliminary version of this paper appeared in the Proceedings of the 27th Annual Symposium on the Foundations of Computer Science, IEEE, Toronto, Canada, 1986. A version of this paper containing all proofs and some further results will appear in Algorithmica.

Discrete Algorithms and Complexity ◽

10.1016/b978-0-12-386870-1.50031-9 ◽

1987 ◽

pp. 459-483

Author(s):

Anna R. Karlin ◽

Mark S. Manasse ◽

Larry Rudolph ◽

Daniel D. Sleator

Keyword(s):

Computer Science ◽

Annual Symposium ◽

Preliminary Version

Download Full-text

On Probability that a Randomly Selected Set Has Some complexity-Theoretical Property

Discrete Algorithms and Complexity ◽

10.1016/b978-0-12-386870-1.50024-1 ◽

1987 ◽

pp. 325-339

Author(s):

Kojiro Kobayashi

Keyword(s):

Theoretical Property

Download Full-text

Are problems having a polynomial time upper bound actually thought to be feasible?

Discrete Algorithms and Complexity ◽

10.1016/b978-0-12-386870-1.50023-x ◽

1987 ◽

pp. 311-324

Author(s):

Akeo ADACHI ◽

Takumi KASAI

Keyword(s):

Polynomial Time ◽

Upper Bound

Download Full-text

Game Solving Procedure H* Is Unsurpassed

Discrete Algorithms and Complexity ◽

10.1016/b978-0-12-386870-1.50017-4 ◽

1987 ◽

pp. 185-200 ◽

Cited By ~ 3

Author(s):

T. Ibaraki

Download Full-text

SOME PROPERTIES OF THE PARALLEL BUBBLING AND PARALLEL SORTS ON A MESH–CONNECTED PROCESSOR ARRAY

Discrete Algorithms and Complexity ◽

10.1016/b978-0-12-386870-1.50016-2 ◽

1987 ◽

pp. 161-183

Author(s):

Kazuhiro SADO ◽

Yoshihide IGARASHI

Keyword(s):

Processor Array

Download Full-text

Algorithms for Routing around a Rectangle

Discrete Algorithms and Complexity ◽

10.1016/b978-0-12-386870-1.50012-5 ◽

1987 ◽

pp. 99-105

Author(s):

Hitoshi Suzuki ◽

Takao Nishizeki ◽

Nobuji Saito

Download Full-text

Fast, Rigorous Factorization and Discrete Logarithm Algorithms

Discrete Algorithms and Complexity ◽

10.1016/b978-0-12-386870-1.50014-9 ◽

1987 ◽

pp. 119-143 ◽

Cited By ~ 34

Author(s):

Carl Pomerance

Keyword(s):

Discrete Logarithm

Download Full-text

An Upper Bound on the Expected Cost of an Optimal Assignment

Discrete Algorithms and Complexity ◽

10.1016/b978-0-12-386870-1.50006-x ◽

1987 ◽

pp. 1-4 ◽

Cited By ~ 11

Author(s):

Richard M. Karp

Keyword(s):

Upper Bound ◽

Optimal Assignment ◽

Expected Cost

Download Full-text

Foreword

Discrete Algorithms and Complexity ◽

10.1016/b978-0-12-386870-1.50005-8 ◽

1987 ◽

pp. xi

Author(s):

David S. Johnson ◽

Takao Nishizeki ◽

Akihiro Nozaki ◽

Herbert S. Wilf

Download Full-text

Linear-time Computability of Combinatorial Problems on Generalized-Series-Parallel Graphs

Discrete Algorithms and Complexity ◽

10.1016/b978-0-12-386870-1.50030-7 ◽

1987 ◽

pp. 437-457 ◽

Cited By ~ 14

Author(s):

E. Hare ◽

S. Hedetniemi ◽

R. Laskar ◽

K. Peters ◽

T. Wimer

Keyword(s):

Linear Time ◽

Combinatorial Problems

Download Full-text