Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Boyar, Joan"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Advice complexity for a class of online problems
Joan Boyar
,
Lene M. Favrholdt
,
Christian Kudahl
,
Jesper W. Mikkelsen
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 116-129
Cancellation-free circuits in unbounded and bounded depth
Joan Boyar
,
Magnus Gausdal Find
Theoretical Computer Science
590
, 2015, pp. 17-26
Relative interval analysis of paging algorithms on access graphs
Joan Boyar
,
Sushmita Gupta
,
Kim S. Larsen
Theoretical Computer Science
568
, 2015, pp. 28-48
Online bin packing with advice
Joan Boyar
,
Shahin Kamali
,
Kim S. Larsen
,
Alejandro López-Ortiz
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 174-186
A comparison of performance measures via online search
Joan Boyar
,
Kim S. Larsen
,
Abyayananda Maiti
Theoretical Computer Science
532
, 2014, pp. 2-13
Four measures of nonlinearity
Joan Boyar
,
Magnus Find
,
René Peralta
Lecture Notes in Computer Science
7878
, 2013, pp. 61-72
Relative interval analysis of paging algorithms on access graphs
Joan Boyar
,
Sushmita Gupta
,
Kim S. Larsen
Lecture Notes in Computer Science
8037
, 2013, pp. 195-206
Access graphs results for LRU versus FIFO under relative worst order analysis
Joan Boyar
,
Sushmita Gupta
,
Kim S. Larsen
Lecture Notes in Computer Science
7357
, 2012, pp. 328-339
A theoretical comparison of LRU and LRU-K
Joan Boyar
,
Martin R. Ehmsen
,
Jens S. Kohrt
,
Kim S. Larsen
Acta Informatica
47
(7-8), 2011, pp. 359-374
Priority algorithms for graph optimization problems
Allan Borodin
,
Joan Boyar
,
Kim S. Larsen
,
Nazanin Mirmohammadi
Theoretical Computer Science
411
(1), 2010, pp. 239-258
Tight results for Next Fit and Worst Fit with resource augmentation
Joan Boyar
,
Leah Epstein
,
Asaf Levin
Theoretical Computer Science
411
(26-28), 2010, pp. 2572-2580
Scheduling jobs on grid processors
Joan Boyar
,
Lene M. Favrholdt
Algorithmica
57
(4), 2010, pp. 819-847
A comparison of performance measures for online algorithms
Joan Boyar
,
Sandy Irani
,
Kim S. Larsen
Lecture Notes in Computer Science
5664
, 2009, pp. 119-130
On the shortest linear straight-line program for computing linear forms
Joan Boyar
,
Philip Matthews
,
René Peralta
Lecture Notes in Computer Science
5162
, 2008, pp. 168-179
Tight bounds for the multiplicative complexity of symmetric functions
Joan Boyar
,
René Peralta
Theoretical Computer Science
396
(1-3), 2008, pp. 223-246
The relative worst-order ratio applied to paging
Joan Boyar
,
Lene M. Favrholdt
,
Kim S. Larsen
Journal of Computer and System Sciences
73
(5), 2007, pp. 818-843
The maximum resource bin packing problem
Joan Boyar
,
Leah Epstein
,
Lene M. Favrholdt
,
Jens S. Kohrt
,
Kim S. Larsen
,
Morten M. Pedersen
,
Sanne Whlk
Theoretical Computer Science
362
(1-3), 2006, pp. 127-139
Scheduling jobs on grid processors
Joan Boyar
,
Lene M. Favrholdt
Lecture Notes in Computer Science
4059
, 2006, pp. 17-28
Concrete multiplicative complexity of symmetric functions
Joan Boyar
,
René Peralta
Lecture Notes in Computer Science
4162
, 2006, pp. 179-189
Priority algorithms for graph optimization problems
Allan Borodin
,
Joan Boyar
,
Kim S. Larsen
Lecture Notes in Computer Science
3351
, 2005, pp. 126-139
Seat reservation allowing seat changes
Joan Boyar
,
Susan Krarup
,
Morten N. Nielsen
Journal of Algorithms
52
(2), 2004, pp. 169-192
The relative worst order ratio applied to seat reservation
Joan Boyar
,
Paul Medvedev
Lecture Notes in Computer Science
3111
, 2004, pp. 90-101
Extending the accommodating function
Joan Boyar
,
Lene M. Favrholdt
,
Kim S. Larsen
,
Morten N. Nielsen
Acta Informatica
40
(1), 2003, pp. 3-35
The relative worst order ratio for on-line algorithms
Joan Boyar
,
Lene M. Favrholdt
Lecture Notes in Computer Science
2653
, 2003, pp. 58-69
Fair versus unrestricted bin packing
Yossi Azar
,
Joan Boyar
,
Leah Epstein
,
Lene M. Favrholdt
,
Kim S. Larsen
,
Morten N. Nielsen
Algorithmica
34
(2), 2002, pp. 181-196
Seiten 1
2
>