×

zbMATH — the first resource for mathematics

Found 197 Documents (Results 1–100)

Hits per Page
100
Display Format
MathJax
Result Sorting
Newest 1st
Chechik, Shiri; Cohen, Sarel
Distance sensitivity oracles with subcubic preprocessing time and fast query time. (English) Zbl 07298335
Makarychev, Konstantin (ed.) et al., Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC ’20, Chicago, IL, USA, June 22–26, 2020. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-6979-4). 1375-1388 (2020).
MSC:  68Qxx
PDF BibTeX XML Cite
\textit{S. Chechik} and \textit{S. Cohen}, in: Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC '20, Chicago, IL, USA, June 22--26, 2020. New York, NY: Association for Computing Machinery (ACM). 1375--1388 (2020; Zbl 07298335)
Full Text: DOI
Müller, Jens; Brinkmann, Marcus; Poddebniak, Damian; Schinzel, Sebastian; Schwenk, Jörg
Re: what’s up Johnny? Covert content attacks on email end-to-end encryption. (English) Zbl 07160782
Deng, Robert H. (ed.) et al., Applied cryptography and network security. 17th international conference, ACNS 2019, Bogota, Colombia, June 5–7, 2019. Proceedings. Cham: Springer (ISBN 978-3-030-21567-5/pbk; 978-3-030-21568-2/ebook). Lecture Notes in Computer Science 11464, 24-42 (2019).
MSC:  68P25 94A60
PDF BibTeX XML Cite
\textit{J. Müller} et al., Lect. Notes Comput. Sci. 11464, 24--42 (2019; Zbl 07160782)
Full Text: DOI
Charalampopoulos, Panagiotis; Gawrychowski, Paweł; Mozes, Shay; Weimann, Oren
Almost optimal distance oracles for planar graphs. (English) Zbl 1433.68284
Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 138-151 (2019).
MSC:  68R10 68P05 68Q25
PDF BibTeX XML Cite
\textit{P. Charalampopoulos} et al., in: Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC '19, Phoenix, AZ, USA, June 23--26, 2019. New York, NY: Association for Computing Machinery (ACM). 138--151 (2019; Zbl 1433.68284)
Full Text: DOI
Chan, Timothy M.; Skrepetos, Dimitrios
Approximate shortest paths and distance oracles in weighted unit-disk graphs. (English) Zbl 07236428
Speckmann, Bettina (ed.) et al., 34th international symposium on computational geometry, SoCG 2018, June 11–14, 2018, Budapest, Hungary. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-066-8). LIPIcs – Leibniz International Proceedings in Informatics 99, Article 24, 13 p. (2018).
MSC:  68U05
PDF BibTeX XML Cite
\textit{T. M. Chan} and \textit{D. Skrepetos}, LIPIcs -- Leibniz Int. Proc. Inform. 99, Article 24, 13 p. (2018; Zbl 07236428)
Full Text: DOI
Camenisch, Jan; Drijvers, Manu; Gagliardoni, Tommaso; Lehmann, Anja; Neven, Gregory
The wonderful world of global random oracles. (English) Zbl 1423.94057
Nielsen, Jesper Buus (ed.) et al., Advances in cryptology – EUROCRYPT 2018. 37th annual international conference on the theory and applications of cryptographic techniques, Tel Aviv, Israel, April 29 – May 3, 2018. Proceedings. Part I. Cham: Springer. Lect. Notes Comput. Sci. 10820, 280-312 (2018).
MSC:  94A60
PDF BibTeX XML Cite
\textit{J. Camenisch} et al., Lect. Notes Comput. Sci. 10820, 280--312 (2018; Zbl 1423.94057)
Full Text: DOI
Laish, Itay; Mozes, Shay
Efficient dynamic approximate distance oracles for vertex-labeled planar graphs. (English) Zbl 1436.68247
Solis-Oba, Roberto (ed.) et al., Approximation and online algorithms. 15th international workshop, WAOA 2017, Vienna, Austria, September 7–8, 2017. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10787, 269-284 (2018).
MSC:  68R10 05C10 05C78 68P05 68W25
PDF BibTeX XML Cite
\textit{I. Laish} and \textit{S. Mozes}, Lect. Notes Comput. Sci. 10787, 269--284 (2018; Zbl 1436.68247)
Full Text: DOI
Eaton, Edward
Leighton-Micali hash-based signatures in the quantum random-oracle model. (English) Zbl 1384.94060
Adams, Carlisle (ed.) et al., Selected areas in cryptography – SAC 2017. 24th international conference, Ottawa, ON, Canada, August 16–18, 2017. Revised selected papers. Cham: Springer (ISBN 978-3-319-72564-2/pbk; 978-3-319-72565-9/ebook). Lecture Notes in Computer Science 10719, 263-280 (2018).
MSC:  94A60 81P94
PDF BibTeX XML Cite
\textit{E. Eaton}, Lect. Notes Comput. Sci. 10719, 263--280 (2018; Zbl 1384.94060)
Full Text: DOI
Knudsen, Mathias Bæk Tejs
Additive spanners and distance oracles in quadratic time. (English) Zbl 1441.68189
Chatzigiannakis, Ioannis (ed.) et al., 44th international colloquium on automata, languages, and programming, ICALP 2017, Warsaw, Poland July 10–14, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 80, Article 64, 12 p. (2017).
MSC:  68R10 05C85 68P05 68W20 68W40
PDF BibTeX XML Cite
\textit{M. B. T. Knudsen}, LIPIcs -- Leibniz Int. Proc. Inform. 80, Article 64, 12 p. (2017; Zbl 1441.68189)
Full Text: DOI
Dinitz, Michael; Zhang, Zeyu
Approximating approximate distance oracles. (English) Zbl 1402.68033
Papadimitriou, Christos H. (ed.), 8th innovations in theoretical computer science conference, ITCS 2017, Berkeley, CA, USA, January 9–11, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-029-3). LIPIcs – Leibniz International Proceedings in Informatics 67, Article 52, 14 p. (2017).
MSC:  68P05 68W25
PDF BibTeX XML Cite
\textit{M. Dinitz} and \textit{Z. Zhang}, LIPIcs -- Leibniz Int. Proc. Inform. 67, Article 52, 14 p. (2017; Zbl 1402.68033)
Full Text: DOI
Beauquier, Joffroy; Blanchard, Peva; Burman, Janna; Denysyuk, Oksana
On the power of oracle \(\varOmega ?\) for self-stabilizing leader election in population protocols. (English) Zbl 1425.68027
Bonakdarpour, Borzoo (ed.) et al., Stabilization, safety, and security of distributed systems. 18th international symposium, SSS 2016, Lyon, France, November 7–10, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10083, 20-35 (2016).
MSC:  68M12 68M14
PDF BibTeX XML Cite
\textit{J. Beauquier} et al., Lect. Notes Comput. Sci. 10083, 20--35 (2016; Zbl 1425.68027)
Full Text: DOI
Kontogiannis, Spyros; Wagner, Dorothea; Zaroliagis, Christos
Hierarchical time-dependent oracles. (English) Zbl 1398.05078
Seok-Hee Hong (ed.), 27th international symposium on algorithms and computation, ISAAC 2016, Sydney, Australia, December 12–14, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-026-2). LIPIcs – Leibniz International Proceedings in Informatics 64, Article 47, 13 p. (2016).
MSC:  05C12 05C85 68W25
PDF BibTeX XML Cite
\textit{S. Kontogiannis} et al., LIPIcs -- Leibniz Int. Proc. Inform. 64, Article 47, 13 p. (2016; Zbl 1398.05078)
Full Text: DOI
Sommer, Christian
All-pairs approximate shortest paths and distance oracle preprocessing. (English) Zbl 1388.68241
Chatzigiannakis, Ioannis (ed.) et al., 43rd international colloquium on automata, languages, and programming, ICALP 2016, Rome, Italy, July 12–15, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-013-2). LIPIcs – Leibniz International Proceedings in Informatics 55, Article 55, 13 p. (2016).
MSC:  68R10 05C85 68P05
PDF BibTeX XML Cite
\textit{C. Sommer}, LIPIcs -- Leibniz Int. Proc. Inform. 55, Article 55, 13 p. (2016; Zbl 1388.68241)
Full Text: DOI
Gawrychowski, Pawel; Landau, Gad M.; Mozes, Shay; Weimann, Oren
The nearest colored node in a tree. (English) Zbl 1380.68146
Grossi, Roberto (ed.) et al., 27th annual symposium on combinatorial pattern matching, CPM 2016, Tel Aviv, Israel, June 27–29, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-012-5). LIPIcs – Leibniz International Proceedings in Informatics 54, Article 25, 12 p. (2016).
MSC:  68P05 68R10 68Q25
PDF BibTeX XML Cite
\textit{P. Gawrychowski} et al., LIPIcs -- Leibniz Int. Proc. Inform. 54, Article 25, 12 p. (2016; Zbl 1380.68146)
Full Text: DOI
Kopelowitz, Tsvi; Krauthgamer, Robert
Color-distance oracles and snippets. (English) Zbl 1380.68153
Grossi, Roberto (ed.) et al., 27th annual symposium on combinatorial pattern matching, CPM 2016, Tel Aviv, Israel, June 27–29, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-012-5). LIPIcs – Leibniz International Proceedings in Informatics 54, Article 24, 10 p. (2016).
MSC:  68P05 68Q17 68U05 68U15
PDF BibTeX XML Cite
\textit{T. Kopelowitz} and \textit{R. Krauthgamer}, LIPIcs -- Leibniz Int. Proc. Inform. 54, Article 24, 10 p. (2016; Zbl 1380.68153)
Full Text: DOI
Gawrychowski, Paweł; Kosowski, Adrian; Uznański, Przemyslaw
Brief announcement: Sublinear-space distance labeling using hubs. (English) Zbl 1376.68158
Proceedings of the 2016 ACM symposium on principles of distributed computing, PODC ’16, Chicago, IL, USA, July 25–28, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-3964-3). 43-45 (2016).
MSC:  68W15 05C78 68P05
PDF BibTeX XML Cite
\textit{P. Gawrychowski} et al., in: Proceedings of the 35th ACM symposium on principles of distributed computing, PODC '16, Chicago, IL, USA, July 25--28, 2016. New York, NY: Association for Computing Machinery (ACM). 43--45 (2016; Zbl 1376.68158)
Full Text: DOI
Hazan, Elad; Koren, Tomer
The computational power of optimization in online learning. (English) Zbl 1373.68456
Wichs, Daniel (ed.) et al., Proceedings of the 48th annual ACM SIGACT symposium on theory of computing, STOC ’16, Cambridge, MA, USA, June 19–21, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4132-5). 128-141 (2016).
MSC:  68W27 68Q17 68T05 68T20 90C59 91A26
PDF BibTeX XML Cite
\textit{E. Hazan} and \textit{T. Koren}, in: Proceedings of the 48th annual ACM SIGACT symposium on theory of computing, STOC '16, Cambridge, MA, USA, June 19--21, 2016. New York, NY: Association for Computing Machinery (ACM). 128--141 (2016; Zbl 1373.68456)
Full Text: DOI
Kaplan, Haim; Mulzer, Wolfgang; Roditty, Liam; Seiferth, Paul
Spanners and reachability oracles for directed transmission graphs. (English) Zbl 1378.68176
Arge, Lars (ed.) et al., 31st international symposium on computational geometry, SoCG’15, Eindhoven, Netherlands, June 22–25, 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-83-5). LIPIcs – Leibniz International Proceedings in Informatics 34, 156-170 (2015).
MSC:  68U05 68P05 68Q25 68R10
PDF BibTeX XML Cite
\textit{H. Kaplan} et al., LIPIcs -- Leibniz Int. Proc. Inform. 34, 156--170 (2015; Zbl 1378.68176)
Full Text: DOI
Elkin, Michael; Filtser, Arnold; Neiman, Ofer
Prioritized metric structures and embedding. (English) Zbl 1321.68222
Proceedings of the 47th annual ACM symposium on theory of computing, STOC ’15, Portland, OR, USA, June 14–17, 2015. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-3536-2). 489-498 (2015).
MSC:  68P05 05C22 68U05
PDF BibTeX XML Cite
\textit{M. Elkin} et al., in: Proceedings of the 47th annual ACM symposium on theory of computing, STOC '15, Portland, OR, USA, June 14--17, 2015. New York, NY: Association for Computing Machinery (ACM). 489--498 (2015; Zbl 1321.68222)
Full Text: DOI
Łącki, Jakub; Oćwieja, Jakub; Pilipczuk, Marcin; Sankowski, Piotr; Zych, Anna
The power of dynamic distance oracles, efficient dynamic algorithms for the Steiner tree. (English) Zbl 1321.68389
Proceedings of the 47th annual ACM symposium on theory of computing, STOC ’15, Portland, OR, USA, June 14–17, 2015. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-3536-2). 11-20 (2015).
MSC:  68R10 05C05 05C12 05C22 68Q25 68W25
PDF BibTeX XML Cite
\textit{J. Łącki} et al., in: Proceedings of the 47th annual ACM symposium on theory of computing, STOC '15, Portland, OR, USA, June 14--17, 2015. New York, NY: Association for Computing Machinery (ACM). 11--20 (2015; Zbl 1321.68389)
Full Text: DOI
Chechik, Shiri
Approximate distance oracles with improved bounds. (English) Zbl 1321.68216
Proceedings of the 47th annual ACM symposium on theory of computing, STOC ’15, Portland, OR, USA, June 14–17, 2015. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-3536-2). 1-10 (2015).
MSC:  68P05 05C12 68Q17 68W25
PDF BibTeX XML Cite
\textit{S. Chechik}, in: Proceedings of the 47th annual ACM symposium on theory of computing, STOC '15, Portland, OR, USA, June 14--17, 2015. New York, NY: Association for Computing Machinery (ACM). 1--10 (2015; Zbl 1321.68216)
Full Text: DOI
Chechik, Shiri
Approximate distance oracles with constant query time. (English) Zbl 1315.68112
Proceedings of the 46th annual ACM symposium on theory of computing, STOC ’14, New York, NY, USA, May 31 – June 3, 2014. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2710-7). 654-663 (2014).
MSC:  68P05 05C12 05C35 05C38
PDF BibTeX XML Cite
\textit{S. Chechik}, in: Proceedings of the 46th annual ACM symposium on theory of computing, STOC '14, New York, NY, USA, May 31 -- June 3, 2014. New York, NY: Association for Computing Machinery (ACM). 654--663 (2014; Zbl 1315.68112)
Full Text: DOI
Agarwal, Rachit; Godfrey, Philip Brighten
Brief announcement: A simple stretch 2 distance oracle. (English) Zbl 1388.68204
Proceedings of the 2013 ACM symposium on principles of distributed computing, PODC ’13, Montreal, QC, Canada, July 22–24, 2013. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2065-8). 110-112 (2013).
MSC:  68R10 05C85 68P05
PDF BibTeX XML Cite
\textit{R. Agarwal} and \textit{P. B. Godfrey}, in: Proceedings of the 32nd ACM symposium on principles of distributed computing, PODC '13, Montreal, QC, Canada, July 22--24, 2013. New York, NY: Association for Computing Machinery (ACM). 110--112 (2013; Zbl 1388.68204)
Full Text: DOI
Haitner, Iftach; Omri, Eran; Zarosim, Hila
Limits on the usefulness of random oracles. (English) Zbl 1310.94150
Sahai, Amit (ed.), Theory of cryptography. 10th theory of cryptography conference, TCC 2013, Tokyo, Japan, March 3–6, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-36593-5/pbk). Lecture Notes in Computer Science 7785, 437-456 (2013).
MSC:  94A60 68P25
PDF BibTeX XML Cite
\textit{I. Haitner} et al., Lect. Notes Comput. Sci. 7785, 437--456 (2013; Zbl 1310.94150)
Full Text: DOI
Kumabe, Masahiro; Suzuki, Toshio
Computable Dowd-type generic oracles. (English) Zbl 1280.03046
Arai, Toshiyasu (ed.) et al., Proceedings of the 11th Asian logic conference in honor of Professor Chong Chitat on his 60th birthday, National University of Singapore, Singapore, June 22–27, 2009. Hackensack, NJ: World Scientific (ISBN 978-981-4360-53-1/hbk; 978-981-4360-54-8/ebook). 128-146 (2012).
Reviewer: Heribert Vollmer (Hannover)
MSC:  03D15 03D20 03D30 03D32 03E57 68Q15 68Q30
PDF BibTeX XML Cite
\textit{M. Kumabe} and \textit{T. Suzuki}, in: Proceedings of the 11th Asian logic conference in honor of Professor Chong Chitat on his 60th birthday, National University of Singapore, Singapore, June 22--27, 2009. Hackensack, NJ: World Scientific. 128--146 (2012; Zbl 1280.03046)
Full Text: DOI
Lubarsky, Robert S.
ITTMs with feedback. (English) Zbl 1231.03036
Schindler, Ralf (ed.), Ways of proof theory. Collected papers by speakers of the colloquium and workshop held on the occasion of the retirement of Wolfram Pohlers, July 17–19, 2008, Münster, Germany. Frankfurt am Main: Ontos Verlag (ISBN 978-3-86838-087-3/hbk). Ontos Mathematical Logic 2, 341-353 (2010).
Reviewer: Heribert Vollmer (Hannover)
MSC:  03D10
PDF BibTeX XML Cite
\textit{R. S. Lubarsky}, Ontos Math. Log. 2, 341--353 (2010; Zbl 1231.03036)
Mandal, Avradip; Patarin, Jacques; Nachef, Valerie
Indifferentiability beyond the birthday bound for the xor of two public random permutations. (English) Zbl 1253.94061
Gong, Guang (ed.) et al., Progress in cryptology – INDOCRYPT 2010. 11th international conference on cryptology in India, Hyderabad, India, December 12–15, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-17400-1/pbk). Lecture Notes in Computer Science 6498, 69-81 (2010).
MSC:  94A60
PDF BibTeX XML Cite
\textit{A. Mandal} et al., Lect. Notes Comput. Sci. 6498, 69--81 (2010; Zbl 1253.94061)
Full Text: DOI
Watson, Thomas
Relativized worlds without worst-case to average-case reductions for NP. (English) Zbl 1305.68089
Serna, Maria (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 13th international workshop, APPROX 2010, and 14th international workshop, RANDOM 2010, Barcelona, Spain, September 1–3, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15368-6/pbk). Lecture Notes in Computer Science 6302, 752-765 (2010).
MSC:  68Q15 68Q25
PDF BibTeX XML Cite
\textit{T. Watson}, Lect. Notes Comput. Sci. 6302, 752--765 (2010; Zbl 1305.68089)
Full Text: DOI
Moses, Yoram
Optimum simultaneous consensus for general omissions is equivalent to an NP oracle. (English) Zbl 1261.68032
Keidar, Idit (ed.), Distributed computing. 23rd international symposium, DISC 2009, Elche, Spain, September 23–25, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04354-3/pbk). Lecture Notes in Computer Science 5805, 436-448 (2009).
MSC:  68M14 68M12 68M15 68Q25
PDF BibTeX XML Cite
\textit{Y. Moses}, Lect. Notes Comput. Sci. 5805, 436--448 (2009; Zbl 1261.68032)
Full Text: DOI
Mol, Petros; Yung, Moti
Recovering NTRU secret key from inversion oracles. (English) Zbl 1162.94393
Cramer, Ronald (ed.), Public key cryptography – PKC 2008. 11th international workshop on practice and theory in public-key cryptography, Barcelona, Spain, March 9–12, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-78440-1/pbk). Lecture Notes in Computer Science 4939, 18-36 (2008).
MSC:  94A60 94A62
PDF BibTeX XML Cite
\textit{P. Mol} and \textit{M. Yung}, Lect. Notes Comput. Sci. 4939, 18--36 (2008; Zbl 1162.94393)
Full Text: DOI
Unruh, Dominique
Random oracles and auxiliary input. (English) Zbl 1215.94071
Menezes, Alfred (ed.), Advances in cryptology – CRYPTO 2007. 27th annual international cryptology conference, Santa Barbara, CA, USA, August 19–23, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-74142-8/pbk). Lecture Notes in Computer Science 4622, 205-223 (2007).
MSC:  94A60
PDF BibTeX XML Cite
\textit{D. Unruh}, Lect. Notes Comput. Sci. 4622, 205--223 (2007; Zbl 1215.94071)
Full Text: DOI
Ebbinghaus, Heinz-Dieter; Flum, Jörg
Finite model theory. Hardback edition of the 2nd revised and enlarged edition 1999. (English) Zbl 1081.03026
Springer Monographs in Mathematics. Berlin: Springer (ISBN 3-540-28787-6/hbk). xi, 360 p. (2006).
Reviewer: Martin Weese (Potsdam)
MSC:  03C13 68Q19 03-02
PDF BibTeX XML Cite
\textit{H.-D. Ebbinghaus} and \textit{J. Flum}, Finite model theory. Hardback edition of the 2nd revised and enlarged edition 1999. Berlin: Springer (2006; Zbl 1081.03026)
Full Text: DOI
Young, Adam; Yung, Moti
Relationships between Diffie-Hellman and “index oracles”. (English) Zbl 1116.94340
Blundo, Carlo (ed.) et al., Security in communication networks. 4th international conference, SCN 2004, Amalfi, Italy, September 8–10, 2004. Revised selected papers. Berlin: Springer (ISBN 3-540-24301-1/pbk). Lecture Notes in Computer Science 3352, 16-32 (2005).
MSC:  94A60
PDF BibTeX XML Cite
\textit{A. Young} and \textit{M. Yung}, Lect. Notes Comput. Sci. 3352, 16--32 (2005; Zbl 1116.94340)
Full Text: DOI
Gudmundsson, Joachim; Levcopoulos, Christos; Narasimhan, Giri; Smid, Michiel
Approximate distance oracles for geometric graphs. (English) Zbl 1058.65028
Proceedings of the thirteenth annual ACM-SIAM symposium on discrete algorithms, San Francisco, CA, USA, January 6–8, 2002. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-513-X/pbk). 828-837 (2002).
MSC:  65D18 05C12
PDF BibTeX XML Cite
\textit{J. Gudmundsson} et al., in: Proceedings of the thirteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2002, San Francisco, CA, USA, January 6--8, 2002. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 828--837 (2002; Zbl 1058.65028)

Filter Results by …

Document Type
Reviewing State
all top 5
Author
all top 5
Serial
all top 5
Year of Publication
all top 3
Classification
all top 3
Software