Skip to main navigation
Skip to search
Skip to main content
Tel Aviv University Home
Update Request & User Guide (TAU staff only)
Home
Experts
Research units
Research output
Prizes
Activities
Press/Media
Search by expertise, name or affiliation
Improved online algorithms for the sorting buffer problem on line metrics
Iftah Gamzu
*
,
Danny Segev
*
Corresponding author for this work
Tel Aviv University
Massachusetts Institute of Technology
Research output
:
Contribution to journal
›
Article
›
peer-review
15
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Improved online algorithms for the sorting buffer problem on line metrics'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Online Algorithms
100%
Sorting Buffer
100%
Line Metrics
100%
Competitive Ratio
60%
Competitive Algorithm
60%
Metric Space
40%
Continuous Line
40%
Pandits
40%
Log-log
20%
Total Distance
20%
Distance Traveled
20%
Input Sequence
20%
Deterministic Algorithm
20%
Number of Requests
20%
Deterministic Strategy
20%
Discretization Method
20%
Finite Capacity
20%
Capacity Buffer
20%
Computer Science
on-line algorithm
100%
Competitive Ratio
100%
Metric Space
66%
Total Distance
33%
Discretization
33%
Mathematics
Metric Line
100%
Competitive Ratio
60%
Metric Space
40%
Minimizes
20%
Discretization
20%
Open Question
20%
Evenly Spaced Point
20%