Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Journal of Algorithms, Volume 55

> Home > Journals > Journal of Algorithms

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

Volume 55, Number 1, April 2005

- view
  authority control:
- export record
  dblp key:
  - journals/jal/GoelHP05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/GoelHP05
Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin:
An online throughput-competitive algorithm for multicast routing and admission control. 1-20
- view
  authority control:
- export record
  dblp key:
  - journals/jal/FilasetaM05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/FilasetaM05
Michael Filaseta, Douglas B. Meade:
Irreducibility testing of lacunary 0, 1-polynomials. 21-28
- view
  authority control:
- export record
  dblp key:
  - journals/jal/SparlZ05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/SparlZ05
Petra Sparl, Janez Zerovnik:
2-local 4/3-competitive algorithm for multicoloring hexagonal graphs. 29-41
- view
  authority control:
- export record
  dblp key:
  - journals/jal/Kim05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/Kim05
Yoo Ah Kim:
Data migration to minimize the total completion time. 42-57
- view
  authority control:
- export record
  dblp key:
  - journals/jal/CormodeM05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/CormodeM05
Graham Cormode, S. Muthukrishnan:
An improved data stream summary: the count-min sketch and its applications. 58-75
- view
  authority control:
- export record
  dblp key:
  - journals/jal/Bar-YehudaES05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/Bar-YehudaES05
Reuven Bar-Yehuda, Guy Even, Shimon Shahar:
On approximating a geometric prize-collecting traveling salesman problem with time windows. 76-92
- view
  authority control:
- export record
  dblp key:
  - journals/jal/Naor05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/Naor05
Moni Naor:
On fairness in the carpool problem. 93-98

Volume 55, Number 2, May 2005

- view
  authority control:
- export record
  dblp key:
  - journals/jal/AdlerR05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/AdlerR05
Micah Adler, Adi Rosén:
Tight bounds for the performance of Longest In System on DAGs. 101-112
- view
  authority control:
- export record
  dblp key:
  - journals/jal/AielloMRR05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/AielloMRR05
William Aiello, Yishay Mansour, S. Rajagopolan, Adi Rosén:
Competitive queue policies for differentiated services. 113-141
- view
  authority control:
- export record
  dblp key:
  - journals/jal/LungoLMM05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/LungoLMM05
Alberto Del Lungo, Guy Louchard, Claudio Marini, Franco Montagna:
The Guessing Secrets problem: a probabilistic approach. 142-176
- view
  authority control:
- export record
  dblp key:
  - journals/jal/LaroseLZ05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/LaroseLZ05
Benoît Larose, Cynthia Loten, László Zádori:
A polynomial-time algorithm for near-unanimity graphs. 177-191
- view
  authority control:
- export record
  dblp key:
  - journals/jal/BartalM05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/BartalM05
Yair Bartal, Manor Mendel:
Randomized k-server algorithms for growth-rate bounded graphs. 192-202

a service of

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.