default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 130
Volume 130, Number 1, 1 August 1994
- Gerhard J. Woeginger:
On-Line Scheduling of Jobs with Fixed Start and End Times. 5-16 - Rajeev Motwani, Steven J. Phillips, Eric Torng:
Non-Clairvoyant Scheduling. 17-47 - Anja Feldmann
, Jirí Sgall, Shang-Hua Teng:
Dynamic Scheduling on Parallel Machines. 49-72 - Yossi Azar, Andrei Z. Broder, Anna R. Karlin:
On-Line Load Balancing. 73-84 - Amos Fiat, Moty Ricklin:
Competitive Algorithms for the Weighted Server Problem. 85-99 - Fabrizio d'Amore, Vincenzo Liberatore:
The List Update Problem and the Retrieval of Sets. 101-123 - Bala Kalyanasundaram, Kirk Pruhs:
Constructing Competitive Tours from Local Information. 125-138 - John Hershberger, Monika Rauch, Subhash Suri:
Data Structures for Two-Edge Connectivity in Planar Graphs. 139-161 - Magnús M. Halldórsson, Mario Szegedy:
Lower Bounds for On-Line Graph Coloring. 163-174 - Noga Alon, Gil Kalai, Moty Ricklin, Larry J. Stockmeyer:
Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling. 175-201 - Peter Bro Miltersen, Sairam Subramanian, Jeffrey Scott Vitter, Roberto Tamassia:
Complexity Models for Incremental Computation. 203-236
Volume 130, Number 2, 15 August 1994
- Vladimir A. Uspensky:
Gödel's Incompleteness Theorem. 239-319
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 01:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
