Hvis du har foretaget ændringer i Pure, vil de snart blive vist her.
Filtrer
Konferencebidrag i proceedings

Søgeresultater

  • 2019

    Online bin covering with advice

    Boyar, J., Favrholdt, L. M., Kamali, S. & Larsen, K. S., 12. jul. 2019, Algorithms and Data Structures: 16th International Symposium, WADS 2019, Proceedings. Friggstad, Z., Sack, J-R. & Salavatipour, M. R. (red.). Springer VS, s. 225-238 (Lecture Notes in Computer Science, Bind 11646).

    Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

    Åben adgang
    Fil
    15 Downloads (Pure)
  • 2018

    Advice complexity of priority algorithms

    Borodin, A., Boyar, J., Larsen, K. S. & Pankratov, D., 2018, Approximation and Online Algorithms - 16th International Workshop, WAOA 2018, Revised Selected Papers. Epstein, L. & Erlebach, T. (red.). Springer VS, s. 69-86 (Lecture Notes in Computer Science, Bind 11312).

    Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

    Åben adgang
    Fil
    37 Downloads (Pure)
  • 2017

    Batch Coloring of Graphs

    Boyar, J., Epstein, L., Favrholdt, L. M., Larsen, K. S. & Levin, A., 2017, Approximation and Online Algorithms: 14th International Workshop on Approximation and Online Algorithms, WAOA 2016. Jansen, K. & Mastrolilli, M. (red.). Springer, s. 52-64 (Lecture Notes in Computer Science, Bind 10138).

    Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

  • Relaxing the Irrevocability Requirement for Online Graph Algorithms

    Boyar, J., Favrholdt, L. M., Kotrbcik, M. & Larsen, K. S., 2017, Algorithms and Data Structures: Proceedings of the 15th International Symposium on Algorithms and Data Structures. Ellen, F., Kolokolova, A. & Sack, J-R. (red.). Springer, s. 217-228 (Lecture Notes in Computer Science, Bind 10389).

    Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

    Fil
    120 Downloads (Pure)
  • 2016

    Adding Isolated Vertices Makes Some Online Algorithms Optimal

    Boyar, J. & Kudahl, C., 2016, Combinatorial Algorithms: 26th International Workshop, IWOCA 2015, Verona, Italy, October 5-7, 2015, Revised Selected Papers. Lipták, Z. & Smyth, W. F. (red.). Springer, s. 65-76 (Lecture Notes in Computer Science, Bind 9538).

    Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

  • Online Bounded Analysis

    Boyar, J., Epstein, L., Favrholdt, L. M., Larsen, K. S. & Levin, A., 2016, Computer Science – Theory and Applications: 11th International Computer Science Symposium in Russia, CSR 2016, St. Petersburg, Russia, June 9-13, 2016, Proceedings. Kulikov, A. S. & Woeginger, G. J. (red.). Springer, s. 131-145 (Lecture Notes in Computer Science, Bind 9691).

    Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

  • Online Dominating Set

    Boyar, J., Eidenbenz, S. J., Favrholdt, L. M., Kotrbcik, M. & Larsen, K. S., 2016, 15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016. Pagh, R. (red.). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, s. 1-15 21. (Leibniz International Proceedings in Informatics, Bind 53).

    Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

    Åben adgang
    Fil
    30 Downloads (Pure)
  • Weighted Online Problems with Advice

    Boyar, J., Favrholdt, L. M., Kudahl, C. & Mikkelsen, J. W., 2016, Combinatorial Algorithms : 27th International Workshop, IWOCA 2016. Mäkinen, V., Puglisi, S. J. & Salmela, L. (red.). Springer, s. 179-190 (Lecture Notes in Computer Science, Bind 9843).

    Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

  • 2015

    Advice Complexity for a Class of Online Problems

    Boyar, J., Favrholdt, L. M., Kudahl, C. & Mikkelsen, J. W., 2015, 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Mayr, E. W. & Ollinger, N. (red.). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Bind 30. s. 116-129 (Leibniz International Proceedings in Informatics, Bind 30).

    Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

    Åben adgang
  • Constructive relationships between algebraic thickness and normality

    Boyar, J. & Find, M. G., 2015, 20th International Symposium, FCT 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings. Kosowski, A. & Walukiewicz, I. (red.). Springer, s. 106-117 (Lecture Notes in Computer Science, Bind 9210).

    Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

  • 2014

    Online Bin Packing with Advice

    Boyar, J., Kamali, S., Larsen, K. S. & López-Ortiz, A., 2014, 31st Symposium on Theoretical Aspects of Computer Science, STACS 2014. Mayr, E. W. & Portier, N. (red.). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, s. 174-186 (Leibniz International Proceedings in Informatics, Bind 25).

    Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

    Åben adgang
  • On the List Update Problem with Advice

    Boyar, J., Kamali, S., Larsen, K. S. & López-Ortiz, A., 2014, Language and Automata Theory and Applications: 8th International Conference, LATA 2014, Madrid, Spain, March 10-14, 2014. Proceedings. Dediu et al., A-H. (red.). Springer, s. 210-221 (Lecture Notes in Computer Science, Bind 8370).

    Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

  • The Relationship between Multiplicative Complexity and Nonlinearity

    Boyar, J. & Find, M. G., 2014, Mathematical Foundations of Computer Science 2014. Csuhaj-Varjú, E., Dietzfelbinger, M. & Ésik, Z. (red.). Springer, s. 130-140 (Lecture Notes in Computer Science, Bind 8635).

    Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

  • 2013

    Bounds for scheduling jobs on grid processors

    Boyar, J. & Ellen, F., 2013, Space-Efficient Data Structures, Streams, and Algorithms: Papers in Honor of J. Ian Munro, on the Occasion of His 66th Birthday. Brodnik, A., Lopez-Ortiz, A., Raman, V. & Viola, A. (red.). Springer, s. 12-26 (Lecture Notes in Computer Science, Bind 8066).

    Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

  • Cancellation-Free Circuits in Unbounded and Bounded Depth

    Boyar, J. & Find, M. G., 2013, Fundamentals of Computation: 19th International Symposium, FCT 2013. Gąsieniec, L. & Wolter, F. (red.). Springer, s. 159-170 (Lecture Notes in Computer Science, Bind 8070).

    Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

  • Four Measures of Nonlinearity

    Boyar, J., Find, M. G. & Peralta, R., 2013, Algorithms and Complexity - 8th International Conference, CIAC 2013, Proceedings: 8th International Conference, CIAC 2013. Spirakis, P. G. & Serna, M. (red.). Springer, s. 61-72 12 s. (Lecture Notes in Computer Science, Bind 7878).

    Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

  • Relative Interval Analysis of Paging Algorithms on Access Graphs

    Boyar, J., Gupta, S. & Larsen, K. S., 2013, Algorithms and Data Structures - 13th International Symposium, WADS 2013, Proceedings. Springer, Bind 8037. s. 195-206 (Lecture Notes in Computer Science).

    Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

  • The Frequent Items Problem in Online Streaming under Various Performance Measures

    Boyar, J., Larsen, K. S. & Maiti, A., 2013, Fundamentals of Computation Theory: 19th International Symposium, FCT 2013, Liverpool, UK, August 19-21, 2013. Proceedings. Gąsieniec, L. & Wolter, F. (red.). Springer, Bind 8. s. 60-71 (Lecture Notes in Computer Science, Bind 8070).

    Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

  • 2010

    A new combinational logic minimization technique with applications to cryptology

    Boyar, J. & Peralta, R., 2010, Experimental Algorithms: 9th International Symposium. Springer, s. 178-189 (Lecture Notes in Computer Science).

    Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

  • 2009

    A comparison of performance measures for online algorithms

    Boyar, J., Irani, S. & Larsen, K. S., 2009, Algorithms and Data Structures: 11th International Symposium, WADS 2009, Banff, Canada, August 21-23, 2009. Proceedings. Dehne, F., Gavrilova, M., Sack, J-R. & Toth, C. D. (red.). Springer, s. 119-130 (Lecture Notes in Computer Science, Bind 5664).

    Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

  • 2008

    On the Shortest Linear Straight-Line Program for Computing Linear Forms

    Boyar, J., Matthews, P. & Peralta, R., 2008, Mathematical Foundations of Computer Science: 33rd International Symposium, MFCS 2008. Ochmanski, E. & Tyszkiewicz, J. (red.). s. 168-179 12 s. (Lecture Notes in Computer Science, Bind 5162).

    Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

  • 2006

    Concrete Multiplicative Complexity of Symmetric Functions

    Boyar, J. & Peralta, R., 2006, Mathematical Foundations of Computer Science 2006: 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006. Proceedings. Bind 4162. s. 179-189 11 s. (Lecture Notes in Computer Science, Bind 4162).

    Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

  • Scheduling jobs on Grid processors

    Boyar, J. & Favrholdt, L. M., 2006, Algorithm Theory-SWAT 2006. Arge, L. & Freivalds, R. (red.). s. 17-28 12 s. (Lecture Notes in Computer Science, Bind 4059).

    Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

  • Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem

    Boyar, J., Ehmsen, M. R. & Larsen, K. S., 2006, Approximation and Online Algorithms. Erlebach, T. & Kaklamanis, C. (red.). Springer Science+Business Media, s. 95-107 13 s. (Lecture Notes in Computer Science, Bind 4368).

    Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

  • 2005

    Priority Algorithms for Graph Optimization Problems

    Borodin, A., Boyar, J. & Larsen, K. S., 2005, Second Workshop on Approximation and Online Algorithms. Persiano, G. & Solis-Oba, R. (red.). Springer Science+Business Media, s. 126-139 (Lecture Notes in Computer Science, Bind 3351).

    Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

  • The Maximum Resource Bin Packing Problem

    Boyar, J., Epstein, L., Favrholdt, L. M., Kohrt, J. S., Larsen, K. S., Pedersen, M. M. & Wøhlk, S., 2005, Fifteenth International Symposium on Fundamentals of Computation Theory. Liskiewicz, M. & Reischuk, R. (red.). Springer Science+Business Media, s. 397-408 (Lecture Notes in Computer Science, Bind 3623).

    Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

  • The Relative Worst Order Ratio Applied to Paging

    Boyar, J., Favrholdt, L. M. & Larsen, K. S., 2005, Ikke angivet. Association for Computing Machinery, s. 718-727

    Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

  • 2004

    The Relative Worst Order Ratio Applied to Seat Reservation

    Boyar, J. & Medvedev, P., 2004, Algorithm Theory - SWAT 2004. Hagerup, T. & Katajainen, J. (red.). Springer, Bind 3111. s. 90-101 (Lecture Notes in Computer Science, Bind 3111).

    Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

  • 2003

    The Relative Worst Order Ratio for On-Line Algorithms

    Boyar, J. & Favrholdt, L. M., 2003, 5th Italian Conference on Algorithms and Complexity (CIAC 2003). Petreschi, R. . R., Persiano, G. . R. & Silvestri, R. . R. (red.). Springer, Bind 2653. s. 58-69 (Lecture Notes in Computer Science, Bind 2653).

    Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

  • 2002

    Extending the Accommodating Function

    Boyar, J., Favrholdt, L. M., Larsen, K. S. & Nielsen, M. N., 2002, Computing and Combinatorics, 8th Annual International Conference, COCOON 2002. Springer, s. 87-96 (Lecture Notes in Computer Science, Bind 2387).

    Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

  • 2000

    Better Bounds on the Accommodating Ratio for the Seat Reservation Problem

    Bach, E., Boyar, J., Jiang, T., Larsen, K. S. & Lin, G-H., 2000, Computing and Combinatorics, 6th Annual International Conference, COCOON 2000. s. 221-231 11 s. (Lecture Notes in Computer Science, Bind 1858).

    Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

  • Fair versus Unrestricted Bin Packing

    Azar, Y., Boyar, J., Favrholdt, L. M., Larsen, K. S. & Nielsen, M. N., 2000, Algorithm Theory - SWAT 2000, 7th Scandinavian Workshop on Algorithm Theory. s. 200-213 14 s. (Lecture Notes in Computer Science, Bind 1851).

    Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

  • 1999

    The Accommodating Function: a generalization of the competitive ratio

    Boyar, J., Larsen, K. S. & Nielsen, M. N., 1999, Algorithms and Data Structures, 6th International Workshop, WADS '99. Springer, s. 74-79 6 s. (Lecture Notes in Computer Science, Bind 1663).

    Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review