24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By IEEE

0818605081

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Improved upper bounds on shellsort

24th Annual Symposium on Foundations of Computer Science (sfcs 1983) ◽

10.1109/sfcs.1983.26 ◽

1983 ◽

Cited By ~ 3

Author(s):

Janet Incerpi ◽

Robert Sedgewick

Keyword(s):

Upper Bounds

Download Full-text

Approximation algorithms for NP-complete problems on planar graphs

24th Annual Symposium on Foundations of Computer Science (sfcs 1983) ◽

10.1109/sfcs.1983.7 ◽

1983 ◽

Cited By ~ 27

Author(s):

Brenda S. Baker

Keyword(s):

Approximation Algorithms ◽

Planar Graphs ◽

Complete Problems ◽

Np Complete

Download Full-text

Lower bounds on the time of probabilistic on-line simulations

24th Annual Symposium on Foundations of Computer Science (sfcs 1983) ◽

10.1109/sfcs.1983.32 ◽

1983 ◽

Cited By ~ 1

Author(s):

Ramamohan Paturi ◽

Janos Simon

Keyword(s):

Lower Bounds ◽

On Line

Download Full-text

Information bounds are good for search problems on ordered data structures

24th Annual Symposium on Foundations of Computer Science (sfcs 1983) ◽

10.1109/sfcs.1983.27 ◽

1983 ◽

Cited By ~ 3

Author(s):

Nathan Linial ◽

Michael E. Saks

Keyword(s):

Data Structures ◽

Search Problems ◽

Good For ◽

Ordered Data

Download Full-text

A tight bound for black and white pebbles on the pyramid

24th Annual Symposium on Foundations of Computer Science (sfcs 1983) ◽

10.1109/sfcs.1983.3 ◽

1983 ◽

Cited By ~ 1

Author(s):

Maria M. Klawe

Keyword(s):

Tight Bound ◽

Black And White

Download Full-text

Randomness and the density of hard problems

24th Annual Symposium on Foundations of Computer Science (sfcs 1983) ◽

10.1109/sfcs.1983.49 ◽

1983 ◽

Cited By ~ 21

Author(s):

Robert E. Wilber

Keyword(s):

Hard Problems

Download Full-text

Monte-Carlo algorithms for enumeration and reliability problems

24th Annual Symposium on Foundations of Computer Science (sfcs 1983) ◽

10.1109/sfcs.1983.35 ◽

1983 ◽

Cited By ~ 100

Author(s):

Richard M. Karp ◽

Michael Luby

Keyword(s):

Monte Carlo ◽

Monte Carlo Algorithms

Download Full-text

Trade-offs between depth and width in parallel computation

24th Annual Symposium on Foundations of Computer Science (sfcs 1983) ◽

10.1109/sfcs.1983.77 ◽

1983 ◽

Cited By ~ 2

Author(s):

Uzi Vishkin ◽

A. Wigderson

Keyword(s):

Parallel Computation ◽

Trade Offs

Download Full-text

Legal coloring of graphs

24th Annual Symposium on Foundations of Computer Science (sfcs 1983) ◽

10.1109/sfcs.1983.28 ◽

1983 ◽

Cited By ~ 1

Author(s):

Nathan Linial

Download Full-text

Representations of rational functions

24th Annual Symposium on Foundations of Computer Science (sfcs 1983) ◽

10.1109/sfcs.1983.67 ◽

1983 ◽

Author(s):

Joachim von zur Gathen

Keyword(s):

Rational Functions

Download Full-text

24th Annual Symposium on Foundations of Computer Science (sfcs 1983)Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE

Improved upper bounds on shellsort

Approximation algorithms for NP-complete problems on planar graphs

Lower bounds on the time of probabilistic on-line simulations

Information bounds are good for search problems on ordered data structures

A tight bound for black and white pebbles on the pyramid

Randomness and the density of hard problems

Monte-Carlo algorithms for enumeration and reliability problems

Trade-offs between depth and width in parallel computation

Legal coloring of graphs

Representations of rational functions

24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
Latest Publications