ScienceGate
Advanced Search
Author Search
Journal Finder
Blog
Sign in / Sign up
ScienceGate
Search
Author Search
Journal Finder
Blog
Sign in / Sign up
24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
Latest Publications
TOTAL DOCUMENTS
65
(FIVE YEARS 0)
H-INDEX
21
(FIVE YEARS 0)
Published By IEEE
0818605081
Latest Documents
Most Cited Documents
Contributed Authors
Related Sources
Related Keywords
Latest Documents
Most Cited Documents
Contributed Authors
Related Sources
Related Keywords
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
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
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
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
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
Solving low density subset sum problems
24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
◽
10.1109/sfcs.1983.70
◽
1983
◽
Cited By ~ 44
Author(s):
J. C. Lagarias
◽
A. M. Odlyzko
Keyword(s):
Low Density
◽
Subset Sum
◽
Subset Sum Problems
Download Full-text
Geometric retrieval problems
24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
◽
10.1109/sfcs.1983.22
◽
1983
◽
Cited By ~ 18
Author(s):
Richard Cole
◽
Chee K. Yap
Download Full-text
Load More ...
Sign in / Sign up
Close
Export Citation Format
Close
Share Document
Close