×

Found 93 Documents (Results 1–93)

Online interval scheduling with predictions. (English) Zbl 07789705

Morin, Pat (ed.) et al., Algorithms and data structures. 18th international symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 14079, 193-207 (2023).
MSC:  68P05 68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Online minimum spanning trees with weight predictions. (English) Zbl 07789701

Morin, Pat (ed.) et al., Algorithms and data structures. 18th international symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 14079, 136-148 (2023).
MSC:  68P05 68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Online bin covering with advice. (English) Zbl 1512.68456

Friggstad, Zachary (ed.) et al., Algorithms and data structures. 16th international symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11646, 225-238 (2019).
MSC:  68W27 68Q25 90C27
PDFBibTeX XMLCite
Full Text: DOI arXiv

Advice complexity of priority algorithms. (English) Zbl 1444.68298

Epstein, Leah (ed.) et al., Approximation and online algorithms. 16th international workshop, WAOA 2018, Helsinki, Finland, August 23–24, 2018. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 11312, 69-86 (2018).
MSC:  68W27 68Q17 90C59
PDFBibTeX XMLCite
Full Text: DOI arXiv

Heuristic variants of \(\mathrm{A}^*\) search for 3D flight planning. (English) Zbl 1511.90053

van Hoeve, Willem-Jan (ed.), Integration of constraint programming, artificial intelligence, and operations research. 15th international conference, CPAIOR 2018, Delft, The Netherlands, June 26–29, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10848, 361-376 (2018).
PDFBibTeX XMLCite
Full Text: DOI

Balanced binary search trees. 2nd edition. (English) Zbl 1390.68201

Mehta, Dinesh P. (ed.) et al., Handbook of data structures and applications. Boca Raton, FL: Chapman & Hall/CRC (ISBN 978-1-4987-0185-3/hbk; 978-1-4987-0188-4/ebook). Chapman & Hall/CRC Computer and Information Science Series, 151-170 (2018).
MSC:  68P05
PDFBibTeX XMLCite

Relaxing the irrevocability requirement for online graph algorithms. (English) Zbl 1491.68139

Ellen, Faith (ed.) et al., Algorithms and data structures. 15th international symposium, WADS 2017, St. John’s, NL, Canada, July 31 – August 2, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10389, 217-228 (2017).
MSC:  68R10 68W27
PDFBibTeX XMLCite
Full Text: DOI arXiv

The paths to choreography extraction. (English) Zbl 1486.68111

Esparza, Javier (ed.) et al., Foundations of software science and computation structures. 20th international conference, FOSSACS 2017, held as part of the European joint conferences on theory and practice of software, ETAPS 2017, Uppsala, Sweden, April 22–29, 2017. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 10203, 424-440 (2017).
MSC:  68Q85
PDFBibTeX XMLCite
Full Text: DOI arXiv

Batch coloring of graphs. (English) Zbl 1484.05062

Jansen, Klaus (ed.) et al., Approximation and online algorithms. 14th international workshop, WAOA 2016, Aarhus, Denmark, August 25–26, 2016. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10138, 52-64 (2017).
MSC:  05C15 05C85 68W27
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

Online dominating set. (English) Zbl 1378.68196

Pagh, Rasmus (ed.), 15th Scandinavian symposium and workshops on algorithm theory, SWAT 2016, Reykjavik, Iceland, June 22–24, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-011-8). LIPIcs – Leibniz International Proceedings in Informatics 53, Article 21, 15 p. (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Online bounded analysis. (English) Zbl 1475.68463

Kulikov, Alexander S. (ed.) et al., Computer science – theory and applications. 11th international computer science symposium in Russia, CSR 2016, St. Petersburg, Russia, June 9–13, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9691, 131-145 (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Online multi-coloring with advice. (English) Zbl 1329.68297

Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 12th international workshop, WAOA 2014, Wrocław, Poland, September 11–12, 2014. Revised selected papers. Cham: Springer (ISBN 978-3-319-18262-9/pbk; 978-3-319-18263-6/ebook). Lecture Notes in Computer Science 8952, 83-94 (2015).
MSC:  68W27 05C15 68Q25
PDFBibTeX XMLCite
Full Text: DOI arXiv

Online bin packing with advice. (English) Zbl 1359.68322

Mayr, Ernst W. (ed.) et al., 31st international symposium on theoretical aspects of computer science, STACS’ 14, Lyon, France, March 5–8, 2014. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-65-1). LIPIcs – Leibniz International Proceedings in Informatics 25, 174-186 (2014).
MSC:  68W27 90C27
PDFBibTeX XMLCite
Full Text: DOI

On the list update problem with advice. (English) Zbl 1362.68294

Dediu, Adrian-Horia (ed.) et al., Language and automata theory and applications. 8th international conference, LATA 2014, Madrid, Spain, March 10–14, 2014. Proceedings. Berlin: Springer (ISBN 978-3-319-04920-5/pbk). Lecture Notes in Computer Science 8370, 210-221 (2014).
MSC:  68W27
PDFBibTeX XMLCite
Full Text: DOI arXiv

Online bin covering: expectations versus guarantees. (English) Zbl 1338.68296

Widmayer, Peter (ed.) et al., Combinatorial optimization and applications. 7th international conference, COCOA 2013, Chengdu, China, December 12–14, 2013. Proceedings. Berlin: Springer (ISBN 978-3-319-03779-0/pbk). Lecture Notes in Computer Science 8287, 226-237 (2013).
MSC:  68W27 90C27
PDFBibTeX XMLCite
Full Text: DOI

The frequent items problem in online streaming under various performance measures. (English) Zbl 1351.68311

Gąsieniec, Leszek (ed.) et al., Fundamentals of computation theory. 19th international symposium, FCT 2013, Liverpool, UK, August 19–21, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-40163-3/pbk). Lecture Notes in Computer Science 8070, 60-71 (2013).
MSC:  68W27 68P99
PDFBibTeX XMLCite
Full Text: DOI

Relative interval analysis of paging algorithms on access graphs. (English) Zbl 1390.68174

Dehne, Frank (ed.) et al., Algorithms and data structures. 13th international symposium, WADS 2013, London, ON, Canada, August 12–14, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-40103-9/pbk). Lecture Notes in Computer Science 8037, 195-206 (2013).
MSC:  68N25 68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

Access graphs results for LRU versus FIFO under relative worst order analysis. (English) Zbl 1357.68299

Fomin, Fedor V. (ed.) et al., Algorithm theory – SWAT 2012. 13th Scandinavian symposium and workshops, Helsinki, Finland, July 4–6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31154-3/pbk). Lecture Notes in Computer Science 7357, 328-339 (2012).
MSC:  68W27 68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

A comparison of performance measures via online search. (English) Zbl 1304.68220

Snoeyink, Jack (ed.) et al., Frontiers in algorithmics and algorithmic aspects in information and management. Joint international conference, FAW-AAIM 2012, Beijing, China, May 14–16, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29699-4/pbk). Lecture Notes in Computer Science 7285, 303-314 (2012).
MSC:  68W27
PDFBibTeX XMLCite
Full Text: DOI arXiv

List factoring and relative worst order analysis. (English) Zbl 1314.68409

Jansen, Klaus (ed.) et al., Approximation and online algorithms. 8th international workshop, WAOA 2010, Liverpool, UK, September 9–10, 2010. Revised papers. Berlin: Springer (ISBN 978-3-642-18317-1/pbk). Lecture Notes in Computer Science 6534, 118-129 (2011).
MSC:  68W27 68W40
PDFBibTeX XMLCite
Full Text: DOI

Better bounds on online unit clustering. (English) Zbl 1285.68222

Kaplan, Haim (ed.), Algorithm theory – SWAT 2010. 12th Scandinavian symposium and workshops on algorithm theory, Bergen, Norway, June 21–23, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13730-3/pbk). Lecture Notes in Computer Science 6139, 371-382 (2010).
MSC:  68W27
PDFBibTeX XMLCite
Full Text: DOI

A comparison of performance measures for online algorithms. (English) Zbl 1253.68368

Dehne, Frank (ed.) et al., Algorithms and data structures. 11th international symposium, WADS 2009, Banff, Canada, August 21–23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03366-7/pbk). Lecture Notes in Computer Science 5664, 119-130 (2009).
MSC:  68W27
PDFBibTeX XMLCite
Full Text: DOI arXiv

Theoretical evidence for the superiority of LRU-2 over LRU for the paging problem. (English) Zbl 1129.68432

Erlebach, Thomas (ed.) et al., Approximation and online algorithms. 4th international workshop, WAOA 2006, Zurich, Switzerland, September 14–15, 2006. Revised papers. Berlin: Springer (ISBN 978-3-540-69513-4/pbk). Lecture Notes in Computer Science 4368, 95-107 (2007).
MSC:  68P15
PDFBibTeX XMLCite
Full Text: DOI

The relative worst order ratio applied to paging. (English) Zbl 1297.68267

Proceedings of the sixteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2005, Vancouver, BC, Canada, January 23–25, 2005. New York, NY: ACM Press (ISBN 0-89871-585-7). 718-727 (2005).
MSC:  68W27 68W25
PDFBibTeX XMLCite

The maximum resource bin packing problem. (English) Zbl 1122.90397

Liśkiewicz, Maciej (ed.) et al., Fundamentals of computation theory. 15th international symposium, FCT 2005, Lübeck, Germany, August 17–20, 2005. Proceedings. Berlin: Springer (ISBN 3-540-28193-2/pbk). Lecture Notes in Computer Science 3623, 397-408 (2005).
PDFBibTeX XMLCite
Full Text: DOI

MTCS ’02. Proceedings of the 3rd international workshop on models for time-critical systems (CONCUR 2002 satellite workshop), Brno, Czech Republic, August 24, 2002. (English) Zbl 1270.68035

Electronic Notes in Theoretical Computer Science 68, No. 5. Amsterdam: Elsevier. 1-136, electronic only (2003).
PDFBibTeX XMLCite
Full Text: Link

Online seat reservations via offline seating arrangements. (English) Zbl 1278.68079

Dehne, Frank (ed.) et al., Algorithms and data structures. 8th international workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 – August 1, 2003. Proceedings. Berlin: Springer (ISBN 3-540-40545-3/pbk). Lect. Notes Comput. Sci. 2748, 174-185 (2003).
MSC:  68P05 68W27
PDFBibTeX XMLCite
Full Text: DOI

Extending the accommodating function. (English) Zbl 1077.68816

Ibarra, Oscar H. (ed.) et al., Computing and combinatorics. 8th annual international conference, COCOON 2002, Singapore, August 15–17, 2002. Proceedings. Berlin: Springer (ISBN 3-540-43996-X). Lect. Notes Comput. Sci. 2387, 87-96 (2002).
MSC:  68T20 68W40 90C27
PDFBibTeX XMLCite
Full Text: Link

Exponentially decreasing number of operations in balanced trees. (English) Zbl 1042.68547

Restivo, Antonio (ed.) et al., Theoretical computer science. 7th Italian conference, ICTCS 2001, Torino, Italy, October 4–6, 2001. Proceedings. Berlin: Springer (ISBN 3-540-42672-8). Lect. Notes Comput. Sci. 2202, 293-311 (2001).
MSC:  68P05
PDFBibTeX XMLCite
Full Text: Link

Complexity of layered binary search trees with relaxed balance. (English) Zbl 1042.68546

Restivo, Antonio (ed.) et al., Theoretical computer science. 7th Italian conference, ICTCS 2001, Torino, Italy, October 4–6, 2001. Proceedings. Berlin: Springer (ISBN 3-540-42672-8). Lect. Notes Comput. Sci. 2202, 269-284 (2001).
MSC:  68P05 68Q25
PDFBibTeX XMLCite
Full Text: Link

Better bounds on the accomodating ratio for the seat reservation problem (extended abstract). (English) Zbl 0988.68837

Du, D.-Z. (ed.) et al., Computing and combinatorics. 6th annual international conference, COCOON 2000, Sydney, Australia, July 26-28, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1858, 221-231 (2000).
MSC:  68W05
PDFBibTeX XMLCite

The accomodating function – a generalization of the competitive ratio. (English) Zbl 1063.68703

Dehne, Frank (ed.) et al., Algorithms and data structures. 6th international workshop, WADS’99, Vancouver, Canada, August 11–14, 1999. Proceedings. Berlin: Springer (ISBN 3-540-66279-0/pbk). Lecture Notes in Computer Science 1663, 74-79 (1999).
MSC:  68W40
PDFBibTeX XMLCite

Amortization results for chromatic search trees, with an application to priority queues. (English) Zbl 1502.68085

Akl, Selim G. (ed.) et al., Algorithms and data structures. 4th international workshop, WADS ’95, Kingston, Canada, August 16–18, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 955, 270-281 (1995).
MSC:  68P05
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software