Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Randomized algorithms for metrical task systems

From MaRDI portal
Publication:1127546
Jump to:navigation, search

DOI10.1016/S0304-3975(97)00006-6zbMath0911.68071MaRDI QIDQ1127546

Steve Seiden, Sandy Irani

Publication date: 13 August 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)


zbMATH Keywords

randomized algorithmtask systems


Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)


Related Items

Uniform metrical task systems with a limited number of states ⋮ Parametrized Metrical Task Systems ⋮ Online computation with advice ⋮ Ramsey-type theorems for metric spaces with applications to online problems ⋮ A Combinatorial Metrical Task System Problem Under the Uniform Metric ⋮ Unfair problems and randomized algorithms for metrical task systems ⋮ Competitive analysis of randomized paging algorithms



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • On the power of randomization in on-line algorithms
  • Competitive randomized algorithms for nonuniform problems
  • Competitive algorithms for server problems
  • Self-adjusting binary search trees
  • An optimal on-line algorithm for metrical task system
  • Traversing Layered Graphs Using the Work Function Algorithm
  • Randomized algorithms for metrical task systems
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1127546&oldid=13179161"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 04:20.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki