×

Found 325 Documents (Results 1–100)

6th SIAM symposium on simplicity in algorithms, SOSA 2023, co-located with SODA 2023, Florence, Italy, January 23–25, 2023. (English) Zbl 1508.68018

Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 978-1-61197-758-5/ebook). vi, 389 p. (2023).
MSC:  68-06 68Wxx 00B25
PDFBibTeX XMLCite
Full Text: DOI

A little charity guarantees almost envy-freeness. (English) Zbl 07304186

Chawla, Shuchi (ed.), Proceedings of the 31st annual ACM-SIAM symposium on discrete algorithms, SODA 2020, Salt Lake City, UT, USA, January 5–8, 2020. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 2658-2672 (2020).
MSC:  91B32
PDFBibTeX XMLCite
Full Text: DOI

Trustworthy graph algorithms (Invited Talk). (English) Zbl 07561645

Rossmanith, Peter (ed.) et al., 44th international symposium on mathematical foundations of computer science, MFCS 2019, Aachen, Germany, August 26–30, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 138, Article 1, 22 p. (2019).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Sequential and parallel algorithms and data structures. The basic toolbox. (English) Zbl 1445.68003

Cham: Springer (ISBN 978-3-030-25208-3/hbk; 978-3-030-25209-0/ebook). xv, 509 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI

Multi-finger binary search trees. (English) Zbl 07561409

Hsu, Wen-Lian (ed.) et al., 29th international symposium on algorithms and computation, ISAAC 2018, December 16–19, 2018, Jiaoxi, Yilan, Taiwan. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 123, Article 55, 26 p. (2018).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Combinatorial algorithms for general linear Arrow-Debreu markets. (English) Zbl 1528.91036

Ganguly, Sumit (ed.) et al., 38th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2018, Ahmedabad, India, December 11–13, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 122, Article 26, 16 p. (2018).
MSC:  91B26 68Q25 91B52
PDFBibTeX XMLCite
Full Text: DOI arXiv

On fair division for indivisible items. (English) Zbl 1528.91043

Ganguly, Sumit (ed.) et al., 38th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2018, Ahmedabad, India, December 11–13, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 122, Article 25, 17 p. (2018).
MSC:  91B32 68W25
PDFBibTeX XMLCite
Full Text: DOI arXiv

Approximating the Nash social welfare with budget-additive valuations. (English) Zbl 1403.91210

Czumaj, Artur (ed.), Proceedings of the 29th annual ACM-SIAM symposium on discrete algorithms, SODA 2018, New Orleans, LA, USA, January 7–10, 2018. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-61197-503-1/ebook). 2326-2340 (2018).
MSC:  91B32 91B15 91-04
PDFBibTeX XMLCite
Full Text: Link

Earning limits in Fisher markets with spending-constraint utilities. (English) Zbl 1403.91146

Bilò, Vittorio (ed.) et al., Algorithmic game theory. 10th international symposium, SAGT 2017, L’Aquila, Italy, September 12–14, 2017. Proceedings. Cham: Springer (ISBN 978-3-319-66699-0/pbk; 978-3-319-66700-3/ebook). Lecture Notes in Computer Science 10504, 67-79 (2017).
MSC:  91B24 91-04
PDFBibTeX XMLCite
Full Text: DOI

An improved combinatorial polynomial algorithm for the linear Arrow-Debreu market. (English) Zbl 1417.91326

Krauthgamer, Robert (ed.), Proceedings of the 27th annual ACM-SIAM symposium on discrete algorithms, SODA 2016, Arlington, VA, USA, January 10–12, 2016. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 90-106 (2016).
MSC:  91B50 90C27
PDFBibTeX XMLCite
Full Text: DOI arXiv

A note on spectral clustering. (English) Zbl 1397.68144

Sankowski, Piotr (ed.) et al., 24th annual European symposium on algorithms, ESA 2016, Aarhus, Denmark, August 22–24, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-015-6). LIPIcs – Leibniz International Proceedings in Informatics 57, Article 57, 14 p. (2016).
PDFBibTeX XMLCite
Full Text: DOI

Computing equilibria in markets with budget-additive utilities. (English) Zbl 1397.91242

Sankowski, Piotr (ed.) et al., 24th annual European symposium on algorithms, ESA 2016, Aarhus, Denmark, August 22–24, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-015-6). LIPIcs – Leibniz International Proceedings in Informatics 57, Article 8, 14 p. (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Opposition frameworks. (English) Zbl 1483.68375

Michael, Loizos (ed.) et al., Logics in artificial intelligence. 15th European conference, JELIA 2016, Larnaca, Cyprus, November 9–11, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10021, 190-206 (2016).
MSC:  68T27
PDFBibTeX XMLCite
Full Text: DOI

On the implementation of combinatorial algorithms for the linear exchange market. (English) Zbl 1331.91088

Zaroliagis, Christos (ed.) et al., Algorithms, probability, networks, and games. Scientific papers and essays dedicated to Paul G. Spirakis on the occasion of his 60th birthday. Cham: Springer (ISBN 978-3-319-24023-7/pbk; 978-3-319-24024-4/ebook). Lecture Notes in Computer Science 9295, 87-94 (2015).
MSC:  91B26 68Q25 91B52
PDFBibTeX XMLCite
Full Text: DOI

Self-adjusting binary search trees: what makes them tick? (English) Zbl 1466.68032

Bansal, Nikhil (ed.) et al., Algorithms – ESA 2015. 23rd annual European symposium, Patras, Greece, September 14–16, 2015. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 9294, 300-312 (2015).
MSC:  68P05 68R05 68W05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Towards more practical linear programming-based techniques for algorithmic mechanism design. (English) Zbl 1358.91058

Hoefer, Martin (ed.), Algorithmic game theory. 8th international symposium, SAGT 2015, Saarbrücken, Germany, September 28–30, 2015. Proceedings. Berlin: Springer (ISBN 978-3-662-48432-6/pbk; 978-3-662-48433-3/pbk). Lecture Notes in Computer Science 9347, 98-109 (2015).
MSC:  91B26 90C05 90C59
PDFBibTeX XMLCite
Full Text: DOI Link

Greedy is an almost optimal deque. (English) Zbl 1444.68056

Dehne, Frank (ed.) et al., Algorithms and data structures. 14th international symposium, WADS 2015, Victoria, BC, Canada, August 5–7, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9214, 152-165 (2015).
MSC:  68P05
PDFBibTeX XMLCite
Full Text: DOI arXiv

New approximability results for the robust \(k\)-median problem. (English) Zbl 1417.68049

Ravi, R. (ed.) et al., Algorithm theory – SWAT 2014. 14th Scandinavian symposium and workshops, Copenhagen, Denmark, July 2–4, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8503, 50-61 (2014).
MSC:  68Q17 90B80
PDFBibTeX XMLCite
Full Text: DOI arXiv

Algorithms and data structures. Basic toolbox. (Algorithmen und Datenstrukturen. Die Grundwerkzeuge.) (German) Zbl 1301.68002

eXamen.press. Wiesbaden: Springer Vieweg (ISBN 978-3-642-05471-6/pbk; 978-3-642-05472-3/ebook). xii, 380 p. (2014).
PDFBibTeX XMLCite
Full Text: DOI

The cost of address translation. (English) Zbl 1430.68474

Sanders, Peter (ed.) et al., Proceedings of the 15th workshop on algorithm engineering and experiments (ALENEX ’13), New Orleans, LA, USA, January 7, 2013. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 148-162 (2013).
MSC:  68W40
PDFBibTeX XMLCite
Full Text: DOI

Fair matchings and related problems. (English) Zbl 1359.05101

Seth, Anil (ed.) et al., 33nd international conference on foundations of software technology and theoretical computer science, FSTTCS 2013, Guwahati, India, December 12–14, 2013. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-64-4). LIPIcs – Leibniz International Proceedings in Informatics 24, 339-350 (2013).
MSC:  05C70 05C85
PDFBibTeX XMLCite
Full Text: DOI

From approximate factorization to root isolation. (English) Zbl 1360.68944

Kauers, Manuel (ed.), Proceedings of the 38th international symposium on symbolic and algebraic computation, ISSAC 2013, Boston, MA, USA, June 26–29, 2013. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2059-7). 283-290 (2013).
PDFBibTeX XMLCite
Full Text: DOI

The query complexity of finding a hidden permutation. (English) Zbl 1391.68044

Brodnik, Andrej (ed.) et al., Space-efficient data structures, streams, and algorithms. Papers in honor of J. Ian Munro on the occasion of his 66th birthday. Berlin: Springer (ISBN 978-3-642-40272-2/pbk). Lecture Notes in Computer Science 8066, 1-11 (2013).
MSC:  68Q25 05A05
PDFBibTeX XMLCite
Full Text: DOI Link

Physarum can compute shortest paths: convergence proofs and complexity bounds. (English) Zbl 1335.68099

Fomin, Fedor V. (ed.) et al., Automata, languages, and programming. 40th international colloquium, ICALP 2013, Riga, Latvia, July 8–12, 2013, Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-39211-5/pbk). Lecture Notes in Computer Science 7966, 472-483 (2013).
PDFBibTeX XMLCite
Full Text: DOI

A combinatorial polynomial algorithm for the linear Arrow-Debreu market. (English) Zbl 1328.91198

Fomin, Fedor V. (ed.) et al., Automata, languages, and programming. 40th international colloquium, ICALP 2013, Riga, Latvia, July 8–12, 2013, Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-39205-4/pbk). Lecture Notes in Computer Science 7965, 425-436 (2013).
MSC:  91B52 68Q25 91B26
PDFBibTeX XMLCite
Full Text: DOI arXiv

Algorithmics of matching under preferences. With a foreword by Kurt Mehlhorn. (English) Zbl 1283.68018

Series on Theoretical Computer Science 2. Hackensack, NJ: World Scientific (ISBN 978-981-4425-24-7/hbk; 978-981-4425-26-1/ebook). xxxi, 491 p. (2013).
PDFBibTeX XMLCite
Full Text: DOI

On randomized fictitious play for approximating saddle points over convex sets. (English) Zbl 1382.91007

Du, Ding-Zhu (ed.) et al., Computing and combinatorics. 19th international conference, COCOON 2013, Hangzhou, China, June 21–23, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38767-8/pbk). Lecture Notes in Computer Science 7936, 65-76 (2013).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Physarum can compute shortest paths. (English) Zbl 1420.68088

Rabani, Yuval (ed.), Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17–19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 233-240 (2012).
MSC:  68Q05 05C85 92D50
PDFBibTeX XMLCite
Full Text: Link

Counting arbitrary subgraphs in data streams. (English) Zbl 1367.68213

Czumaj, Artur (ed.) et al., Automata, languages, and programming. 39th international colloquium, ICALP 2012, Coventry, UK, July 9–13, 2012. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-31584-8/pbk). Lecture Notes in Computer Science 7392, 598-609 (2012).
PDFBibTeX XMLCite
Full Text: DOI

Automata, languages, and programming. 39th international colloquium, ICALP 2012, Coventry, UK, July 9–13, 2012. Proceedings, Part I. (English) Zbl 1268.68011

Lecture Notes in Computer Science 7391. Berlin: Springer (ISBN 978-3-642-31593-0/pbk; 978-3-642-31594-7/ebook). xxvii, 862 p. (2012).
PDFBibTeX XMLCite
Full Text: DOI

Automata, languages, and programming. 39th international colloquium, ICALP 2012, Coventry, UK, July 9–13, 2012. Proceedings, Part II. (English) Zbl 1248.68031

Lecture Notes in Computer Science 7392. Berlin: Springer (ISBN 978-3-642-31584-8/pbk). xxviii, 676 p. (2012).
PDFBibTeX XMLCite
Full Text: DOI

Approximate counting of cycles in streams. (English) Zbl 1346.68257

Demetrescu, Camil (ed.) et al., Algorithms – ESA 2011. 19th annual European symposium, Saarbrücken, Germany, September 5–9, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23718-8/pbk). Lecture Notes in Computer Science 6942, 677-688 (2011).
PDFBibTeX XMLCite
Full Text: DOI

Improving the price of anarchy for selfish routing via coordination mechanisms. (English) Zbl 1346.91021

Demetrescu, Camil (ed.) et al., Algorithms – ESA 2011. 19th annual European symposium, Saarbrücken, Germany, September 5–9, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23718-8/pbk). Lecture Notes in Computer Science 6942, 119-130 (2011).
MSC:  91A43 68M20
PDFBibTeX XMLCite
Full Text: DOI arXiv

Online graph exploration: new results on old and new algorithms. (English) Zbl 1334.68306

Aceto, Luca (ed.) et al., Automata, languages and programming. 38th international colloquium, ICALP 2011, Zurich, Switzerland, July 4–8, 2011. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-22011-1/pbk). Lecture Notes in Computer Science 6756, 478-489 (2011).
PDFBibTeX XMLCite
Full Text: DOI

Reliable and efficient geometric computing. (English) Zbl 1294.68143

Fukuda, Komei (ed.) et al., Mathematical software – ICMS 2010. Third international congress on mathematical software, Kobe, Japan, September 13–17, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15581-9/pbk). Lecture Notes in Computer Science 6327, 10-11 (2010).
PDFBibTeX XMLCite
Full Text: DOI

Isolating real roots of real polynomials. (English) Zbl 1237.68257

May, John P. (ed.), ISSAC 2009. Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation, Seoul, July 28–31, 2009. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-609-0). 247-254 (2009).
MSC:  68W30 12D10
PDFBibTeX XMLCite
Full Text: DOI

Breaking the \(O(m ^{2} n)\) barrier for minimum cycle bases. (English) Zbl 1256.68080

Fiat, Amos (ed.) et al., Algorithms – ESA 2009. 17th annual European symposium, Copenhagen, Denmark, September 7–9, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04127-3/pbk). Lecture Notes in Computer Science 5757, 301-312 (2009).
MSC:  68Q25 05C38 68R10
PDFBibTeX XMLCite
Full Text: DOI

Algorithms – ESA 2008. 16th annual European symposium, Karlsruhe, Germany, September 15–17, 2008. Proceedings. (English) Zbl 1149.68011

Lecture Notes in Computer Science 5193. Berlin: Springer (ISBN 978-3-540-87743-1/pbk). xvii, 844 p. (2008).
MSC:  68-06 68Wxx 00B25
PDFBibTeX XMLCite
Full Text: DOI

Reliable geometric computing. (English) Zbl 1209.68587

Waldmann, Karl-Heinz (ed.) et al., Operations research proceedings 2006. Selected papers of the annual international conference of the German Operations Research Society (GOR), jointly organized with the Austrian Society of Operations Research (ÖGOR) and the Swiss Society of Operations Research (SVOR), Karlsruhe, Germany, September 6–8, 2006. Berlin: Springer (ISBN 978-3-540-69994-1/pbk). 111 (2007).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

Matchings in graphs. Variations of the problem. (English) Zbl 1175.90336

Dress, Andreas (ed.) et al., Combinatorial optimization and applications. First international conference, COCOA 2007, Xi’an, China, August 14–16, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73555-7/pbk). Lecture Notes in Computer Science 4616, 1-2 (2007).
MSC:  90C27 05C70 68Q25
PDFBibTeX XMLCite
Full Text: DOI Link

Sweeping and maintaining two-dimensional arrangements on surfaces: A first step. (English) Zbl 1151.68700

Arge, Lars (ed.) et al., Algorithms – ESA 2007. 15th annual European symposium, Eilat, Israel, October 8–10, 2007, Proceedings. Berlin: Springer (ISBN 978-3-540-75519-7/pbk). Lecture Notes in Computer Science 4698, 645-656 (2007).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

Minimum cycle bases in graphs. Algorithms and applications. (English) Zbl 1147.68610

Kučera, Luděk (ed.) et al., Mathematical foundations of computer science 2007. 32nd international symposium, MFCS 2007, Český Krumlov, Czech Republic, August 26–31, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-74455-9/pbk). Lecture Notes in Computer Science 4708, 13-14 (2007).
MSC:  68R10 05C38 05C85
PDFBibTeX XMLCite
Full Text: DOI Link

New approximation algorithms for minimum cycle bases of graphs. (English) Zbl 1186.68561

Thomas, Wolfgang (ed.) et al., STACS 2007. 24th annual symposium on theoretical aspects of computer science, Aachen, Germany, February 22–24, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-70917-6/pbk). Lecture Notes in Computer Science 4393, 512-523 (2007).
MSC:  68W25 05C38 05C85
PDFBibTeX XMLCite
Full Text: DOI Link

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

Biographic Reference