Design and analysis of algorithms

skip to main content

Advanced Search
Browse
About
- Sign in
- Register

Advanced Search
Journals
Magazines
Proceedings
Books
SIGs
Conferences
People
More

Search ACM Digital Library

Design and analysis of algorithms Results

Search

Advanced Search

Applied Filters

Design and analysis of algorithms
STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of ComputingRemove filter

People

Names

Sudipto �Guha (3)
� Tardos (2)
A. M. Ben-Amram (2)
Allan Bertram Borodin (2)
Baruch M Schieber (2)
Joseph (Seffi) Naor (2)
Klaus �Jansen (2)
Moses Charikar (2)
Rafail M Ostrovsky (2)
Ravi �Kumar (2)
S �Muthukrishnan (2)
Sanjeev �Khanna (2)
Yuval �Rabani (2)
Anna �Moss (1)
Ashish �Goel (1)
Mark T De Berg (1)
Matthew D Andrews (1)
Monika Rauch Henzinger (1)
Roberto �Solis-Oba (1)
Ronitt A Rubinfeld (1)

Institutions

Nokia Bell Labs (8)
Stanford University (6)
Technion - Israel Institute of Technology (4)
Cornell University (3)
IBM Thomas J. Watson Research Center (3)
Princeton University (3)
Tel Aviv University (3)
University of Toronto (3)
Academic College of Tel-Aviv - Yaffo (2)
AT&T Laboratories Florham Park (2)
IBM Research - Almaden (2)
IDSIA Dalle Molle Institute for Artificial Intelligence (2)
Max Planck Institute for Informatics (2)
Telcordia Technologies, Inc. (2)
Goethe University Frankfurt (1)
Johns Hopkins University (1)
MIT Computer Science & Artificial Intelligence Laboratory (1)
National Taiwan University (1)
University of Colorado Boulder (1)
Yale University (1)

Authors

Sudipto �Guha (3)
� Tardos (2)
A. M. Ben-Amram (2)
Allan Bertram Borodin (2)
Baruch M Schieber (2)
Joseph (Seffi) Naor (2)
Klaus �Jansen (2)
Moses Charikar (2)
Rafail M Ostrovsky (2)
Ravi �Kumar (2)
S �Muthukrishnan (2)
Sanjeev �Khanna (2)
Yuval �Rabani (2)
Anna �Moss (1)
Ashish �Goel (1)
Mark T De Berg (1)
Matthew D Andrews (1)
Monika Rauch Henzinger (1)
Roberto �Solis-Oba (1)
Ronitt A Rubinfeld (1)

Publications

Proceedings/Book Names

STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (40)

All Publications

Proceedings (40)

Media Formats

PDF (40)

Publisher

Association for Computing Machinery (40)

Conferences

Sponsors

SIGACT (40)

Conference Event

STOC99 (40)

Proceedings Series

STOC: ACM Symposium on Theory of Computing (40)

Publication Date

Upon changing this filter the page will automatically refresh

Export Citations

Selected
All Results

Select Citation format

Please download or close your previous search result export first before starting a new bulk export.
Preview is not available.
By clicking download,a status dialog will open to start the export process. The process may takea few minutes but once it finishes a file will be downloadable from your browser. You may continue to browse the DL while the export process is in progress.
Download
- Download citation
- Copy citation

40 Results for: Book/Issue: STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of ComputingEdit SearchSave SearchFailed to save your search, try again laterSearch has been saved (My Saved Searches)RSS

Save this search

Please login to be able to save your searches and receive alerts for new content matching your search criteria.

Searched The ACM Guide to Computing Literature (3,775,278 records)|Limit your search to The ACM Full-Text Collection (761,990 records)

Results

Showing 1 - 20of40 Results

Select All

Export Citations Save to Binder

Save to Binder

Create a New Binder

Name

per page:

10
20
50

Sort by: Recency

Earliest
Latest
Downloaded
Cited

Article
Free
May 1999
Backing up in singly linked lists
- Amir M. Ben-Amram,
- Holger Petersen
STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of ComputingPages 780–786https://doi.org/10.1145/301250.301450
5
388
Metrics
Total Citations5
Total Downloads388
Last 12 Months51
Last 6 weeks10
View online with eReader
PDF
Article
Free
May 1999
Design networks with bounded pairwise distance
- Yevgeniy Dodis,
- Sanjeev Khanna
STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of ComputingPages 750–759https://doi.org/10.1145/301250.301447
86
686
Metrics
Total Citations86
Total Downloads686
Last 12 Months78
Last 6 weeks18
View online with eReader
PDF
Article
Free
May 1999
On the complexity of computing short linearly independent vectors and short bases in a lattice
- Johannes Blömer,
- Jean-Pierre Seifert
STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of ComputingPages 711–720https://doi.org/10.1145/301250.301441
48
728
Metrics
Total Citations48
Total Downloads728
Last 12 Months108
Last 6 weeks19
View online with eReader
PDF
Article
Free
May 1999
Computational sample complexity and attribute-efficient learning
- Rocco A. Servedio
STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of ComputingPages 701–710https://doi.org/10.1145/301250.301437
3
334
Metrics
Total Citations3
Total Downloads334
Last 12 Months27
Last 6 weeks7
View online with eReader
PDF
Article
Free
May 1999
Approximation schemes for minimum latency problems
- Sanjeev Arora,
- George Karakostas
STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of ComputingPages 688–693https://doi.org/10.1145/301250.301432
28
467
Metrics
Total Citations28
Total Downloads467
Last 12 Months39
Last 6 weeks5
View online with eReader
PDF
Article
Free
May 1999
Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems
- Uri Zwick
STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of ComputingPages 679–687https://doi.org/10.1145/301250.301431
88
821
Metrics
Total Citations88
Total Downloads821
Last 12 Months100
Last 6 weeks11
View online with eReader
PDF
Article
Free
May 1999
Approximating the throughput of multiple machines under real-time scheduling
STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of ComputingPages 622–631https://doi.org/10.1145/301250.301420
33
671
Metrics
Total Citations33
Total Downloads671
Last 12 Months190
Last 6 weeks27
View online with eReader
PDF
Article
Free
May 1999
Nonmonotonic phenomena in packet routing
- Uriel Feige
STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of ComputingPages 583–591https://doi.org/10.1145/301250.301409
5
306
Metrics
Total Citations5
Total Downloads306
Last 12 Months24
Last 6 weeks14
View online with eReader
PDF
Article
Free
May 1999
Efficient recovery from power outage (extended abstract)
STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of ComputingPages 574–582https://doi.org/10.1145/301250.301406
38
1,148
Metrics
Total Citations38
Total Downloads1,148
Last 12 Months181
Last 6 weeks30
View online with eReader
PDF
Article
Free
May 1999
Packet routing with arbitrary end-to-end delay requirements
- Matthew Andrews,
- Lisa Zhang
STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of ComputingPages 557–565https://doi.org/10.1145/301250.301401
9
500
Metrics
Total Citations9
Total Downloads500
Last 12 Months26
Last 6 weeks6
View online with eReader
PDF
Article
Free
May 1999
The complexity of the matrix eigenproblem
- Victor Y. Pan,
- Zhao Q. Chen
STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of ComputingPages 507–516https://doi.org/10.1145/301250.301389
157
3,059
Metrics
Total Citations157
Total Downloads3,059
Last 12 Months778
Last 6 weeks83
View online with eReader
PDF
Article
Free
May 1999
Worst-case and amortised optimality in union-find (extended abstract)
STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of ComputingPages 499–506https://doi.org/10.1145/301250.301383
10
739
Metrics
Total Citations10
Total Downloads739
Last 12 Months107
Last 6 weeks9
View online with eReader
PDF
Article
Free
May 1999
Multi-method dispatching: a geometric approach with applications to string matching problems
STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of ComputingPages 483–491https://doi.org/10.1145/301250.301378
25
583
Metrics
Total Citations25
Total Downloads583
Last 12 Months52
Last 6 weeks6
View online with eReader
PDF
Article
Free
May 1999
Finding similar regions in many strings
STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of ComputingPages 473–482https://doi.org/10.1145/301250.301376
95
890
Metrics
Total Citations95
Total Downloads890
Last 12 Months69
Last 6 weeks5
View online with eReader
PDF
Article
Free
May 1999
Compact grid layouts of multi-level networks
STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of ComputingPages 455–463https://doi.org/10.1145/301250.301372
10
379
Metrics
Total Citations10
Total Downloads379
Last 12 Months23
Last 6 weeks1
View online with eReader
PDF
Article
Free
May 1999
Subquadratic approximation algorithms for clustering problems in high dimensional spaces
STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of ComputingPages 435–444https://doi.org/10.1145/301250.301367
33
429
Metrics
Total Citations33
Total Downloads429
Last 12 Months20
Last 6 weeks5
View online with eReader
PDF
Article
Free
May 1999
Sublinear time algorithms for metric space problems
- Piotr Indyk
STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of ComputingPages 428–434https://doi.org/10.1145/301250.301366
127
1,645
Metrics
Total Citations127
Total Downloads1,645
Last 12 Months266
Last 6 weeks43
View online with eReader
PDF
Article
Free
May 1999
A polynomial time approximation scheme for general multiprocessor job scheduling (extended abstract)
- Jianer Chen,
- Antonio Miranda
STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of ComputingPages 418–427https://doi.org/10.1145/301250.301363
21
517
Metrics
Total Citations21
Total Downloads517
Last 12 Months39
Last 6 weeks7
View online with eReader
PDF
Article
Free
May 1999
Improved approximation schemes for scheduling unrelated parallel machines
- Klaus Jansen,
- Lorant Porkolab
STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of ComputingPages 408–417https://doi.org/10.1145/301250.301361
52
825
Metrics
Total Citations52
Total Downloads825
Last 12 Months74
Last 6 weeks13
View online with eReader
PDF
Article
Free
May 1999
A PTAS for minimizing the weighted sum of job completion times on parallel machines
- Martin Skutella,
- Gerhard J. Woeginger
STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of ComputingPages 400–407https://doi.org/10.1145/301250.301356
22
601
Metrics
Total Citations22
Total Downloads601
Last 12 Months62
Last 6 weeks8
View online with eReader
PDF

1
2

Footer

Categories

Journals
Magazines
Books
Proceedings
SIGs
Conferences
Collections
People

About

About ACM Digital Library
ACM Digital Library Board
Subscription Information
Author Guidelines
Using ACM Digital Library
All Holdings within the ACM Digital Library
ACM Computing Classification System
Accessibility Statement

Join

Join ACM
Join SIGs
Subscribe to Publications
Institutions and Libraries

Connect

Contact us via email
ACM on Facebook
ACM DL on X
ACM on Linkedin
Send Feedback
Submit a Bug Report

The ACM Digital Library is published by the Association for Computing Machinery. Copyright � 2024 ACM, Inc.

Terms of Usage
Privacy Policy
Code of Ethics

Your Search Results Download Request

We are preparing your search results for download ...

We will inform you here when the file is ready.

Your Search Results Download Request

Your file of search results citations is now ready.

Your Search Results Download Request

Your search export query has expired. Please try again.