Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

25 Publications


2024 | Published | Conference Paper | IST-REx-ID: 15006 | OA
Hirvonen, J., Schmid, L., Chatterjee, K., & Schmid, S. (2024). On the convergence time in graphical games: A locality-sensitive approach. In 27th International Conference on Principles of Distributed Systems (Vol. 286). Tokyo, Japan: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2023.11
[Published Version] View | Files available | DOI | arXiv
 

2023 | Published | Conference Paper | IST-REx-ID: 14086 | OA
Henzinger, M. H., Liu, P., Vondrák, J., & Zheng, D. W. (2023). Faster submodular maximization for several classes of matroids. In 50th International Colloquium on Automata, Languages, and Programming (Vol. 261). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2023.74
[Published Version] View | Files available | DOI | arXiv
 

2023 | Published | Conference Paper | IST-REx-ID: 14405 | OA
Bartocci, E., Henzinger, T. A., Nickovic, D., & Oliveira da Costa, A. (2023). Hypernode automata. In 34th International Conference on Concurrency Theory (Vol. 279). Antwerp, Belgium: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2023.21
[Published Version] View | Files available | DOI | arXiv
 

2021 | Published | Conference Paper | IST-REx-ID: 9604 | OA
Biswas, R., Cultrera di Montesano, S., Edelsbrunner, H., & Saghafian, M. (2021). Counting cells of order-k voronoi tessellations in ℝ3 with morse theory. In Leibniz International Proceedings in Informatics (Vol. 189). Online: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2021.16
[Published Version] View | Files available | DOI
 

2021 | Published | Conference Paper | IST-REx-ID: 9605 | OA
Corbet, R., Kerber, M., Lesnick, M., & Osang, G. F. (2021). Computing the multicover bifiltration. In Leibniz International Proceedings in Informatics (Vol. 189). Online: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2021.27
[Published Version] View | Files available | DOI | arXiv
 

2020 | Published | Conference Paper | IST-REx-ID: 8533 | OA
Chatterjee, K., Ibsen-Jensen, R., Jecker, I. R., & Svoboda, J. (2020). Simplified game of life: Algorithms and complexity. In 45th International Symposium on Mathematical Foundations of Computer Science (Vol. 170). Prague, Czech Republic: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2020.22
[Published Version] View | Files available | DOI | arXiv
 

2020 | Published | Conference Paper | IST-REx-ID: 8534 | OA
Jecker, I. R., Kupferman, O., & Mazzocchi, N. (2020). Unary prime languages. In 45th International Symposium on Mathematical Foundations of Computer Science (Vol. 170). Prague, Czech Republic: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2020.51
[Published Version] View | Files available | DOI
 

2020 | Published | Conference Paper | IST-REx-ID: 8599 | OA
Avni, G., & Henzinger, T. A. (2020). A survey of bidding games on graphs. In 31st International Conference on Concurrency Theory (Vol. 171). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2020.2
[Published Version] View | Files available | DOI
 

2020 | Published | Conference Paper | IST-REx-ID: 8600 | OA
Chatterjee, K., Henzinger, T. A., & Otop, J. (2020). Multi-dimensional long-run average problems for vector addition systems with states. In 31st International Conference on Concurrency Theory (Vol. 171). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2020.23
[Published Version] View | Files available | DOI | arXiv
 

2020 | Published | Conference Paper | IST-REx-ID: 8703 | OA
Osang, G. F., Rouxel-Labbé, M., & Teillaud, M. (2020). Generalizing CGAL periodic Delaunay triangulations. In 28th Annual European Symposium on Algorithms (Vol. 173). Virtual, Online; Pisa, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2020.75
[Published Version] View | Files available | DOI
 

2020 | Published | Conference Paper | IST-REx-ID: 7605 | OA
Alistarh, D.-A., Fedorov, A., & Koval, N. (2020). In search of the fastest concurrent union-find algorithm. In 23rd International Conference on Principles of Distributed Systems (Vol. 153, p. 15:1-15:16). Neuchatal, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2019.15
[Published Version] View | Files available | DOI | arXiv
 

2020 | Published | Conference Paper | IST-REx-ID: 7989 | OA
Patakova, Z. (2020). Bounding radon number via Betti numbers. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.61
[Published Version] View | Files available | DOI | arXiv
 

2020 | Published | Conference Paper | IST-REx-ID: 7990 | OA
Wagner, U., & Welzl, E. (2020). Connectivity of triangulation flip graphs in the plane (Part II: Bistellar flips). In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.67
[Published Version] View | Files available | DOI | arXiv
 

2020 | Published | Conference Paper | IST-REx-ID: 7991 | OA
Avvakumov, S., & Nivasch, G. (2020). Homotopic curve shortening and the affine curve-shortening flow. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.12
[Published Version] View | Files available | DOI | arXiv
 

2020 | Published | Conference Paper | IST-REx-ID: 7992 | OA
Patakova, Z., Tancer, M., & Wagner, U. (2020). Barycentric cuts through a convex body. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.62
[Published Version] View | Files available | DOI | arXiv
 

2020 | Published | Conference Paper | IST-REx-ID: 7994 | OA
Arroyo Guevara, A. M., Bensmail, J., & Bruce Richter, R. (2020). Extending drawings of graphs to arrangements of pseudolines. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.9
[Published Version] View | Files available | DOI | arXiv
 

2018 | Published | Conference Paper | IST-REx-ID: 133 | OA
Kragl, B., Qadeer, S., & Henzinger, T. A. (2018). Synchronizing the asynchronous (Vol. 118). Presented at the CONCUR: International Conference on Concurrency Theory, Beijing, China: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2018.21
[Published Version] View | Files available | DOI
 

2018 | Published | Conference Paper | IST-REx-ID: 285 | OA
Huszár, K., Spreer, J., & Wagner, U. (2018). On the treewidth of triangulated 3-manifolds (Vol. 99). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.46
[Submitted Version] View | Files available | DOI | arXiv
 

2017 | Published | Conference Paper | IST-REx-ID: 697 | OA
Pietrzak, K. Z., & Skórski, M. (2017). Non uniform attacks against pseudoentropy (Vol. 80). Presented at the ICALP: International Colloquium on Automata, Languages, and Programming, Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2017.39
[Published Version] View | Files available | DOI
 

2017 | Published | Conference Paper | IST-REx-ID: 710 | OA
Obremski, M., & Skórski, M. (2017). Renyi entropy estimation revisited (Vol. 81). Presented at the 20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, Berkeley, USA: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.20
[Published Version] View | Files available | DOI
 

Filters and Search Terms

issn=18688969

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed