Published in: LIPIcs, Volume 261, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)
Or Zamir. The Wrong Direction of Jensen’s Inequality Is Algorithmically Right. In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 261, pp. 107:1-107:10, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{zamir:LIPIcs.ICALP.2023.107, author = {Zamir, Or}, title = {{The Wrong Direction of Jensen’s Inequality Is Algorithmically Right}}, booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)}, pages = {107:1--107:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-278-5}, ISSN = {1868-8969}, year = {2023}, volume = {261}, editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.107}, URN = {urn:nbn:de:0030-drops-181593}, doi = {10.4230/LIPIcs.ICALP.2023.107}, annote = {Keywords: algorithms, complexity, Jensen’s inequality} }
Published in: LITES, Volume 8, Issue 2 (2022): Special Issue on Distributed Hybrid Systems. Leibniz Transactions on Embedded Systems, Volume 8, Issue 2
Paul Kröger and Martin Fränzle. Bayesian Hybrid Automata: A Formal Model of Justified Belief in Interacting Hybrid Systems Subject to Imprecise Observation. In LITES, Volume 8, Issue 2 (2022): Special Issue on Distributed Hybrid Systems. Leibniz Transactions on Embedded Systems, Volume 8, Issue 2, pp. 05:1-05:27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@Article{kroger_et_al:LITES.8.2.5, author = {Kr\"{o}ger, Paul and Fr\"{a}nzle, Martin}, title = {{Bayesian Hybrid Automata: A Formal Model of Justified Belief in Interacting Hybrid Systems Subject to Imprecise Observation}}, journal = {Leibniz Transactions on Embedded Systems}, pages = {05:1--05:27}, ISSN = {2199-2002}, year = {2022}, volume = {8}, number = {2}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LITES.8.2.5}, doi = {10.4230/LITES.8.2.5}, annote = {Keywords: } }
Published in: LIPIcs, Volume 244, 30th Annual European Symposium on Algorithms (ESA 2022)
Or Zamir. Faster Algorithm for Unique (k,2)-CSP. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 92:1-92:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{zamir:LIPIcs.ESA.2022.92, author = {Zamir, Or}, title = {{Faster Algorithm for Unique (k,2)-CSP}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {92:1--92:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.92}, URN = {urn:nbn:de:0030-drops-170309}, doi = {10.4230/LIPIcs.ESA.2022.92}, annote = {Keywords: Algorithms, Constraint Satisfaction Problem} }
Published in: LIPIcs, Volume 198, 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)
Or Zamir. Breaking the 2ⁿ Barrier for 5-Coloring and 6-Coloring. In 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 198, pp. 113:1-113:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{zamir:LIPIcs.ICALP.2021.113, author = {Zamir, Or}, title = {{Breaking the 2ⁿ Barrier for 5-Coloring and 6-Coloring}}, booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)}, pages = {113:1--113:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-195-5}, ISSN = {1868-8969}, year = {2021}, volume = {198}, editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.113}, URN = {urn:nbn:de:0030-drops-141825}, doi = {10.4230/LIPIcs.ICALP.2021.113}, annote = {Keywords: Algorithms, Graph Algorithms, Graph Coloring} }
Published in: LIPIcs, Volume 132, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
Mikkel Thorup, Or Zamir, and Uri Zwick. Dynamic Ordered Sets with Approximate Queries, Approximate Heaps and Soft Heaps. In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 132, pp. 95:1-95:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{thorup_et_al:LIPIcs.ICALP.2019.95, author = {Thorup, Mikkel and Zamir, Or and Zwick, Uri}, title = {{Dynamic Ordered Sets with Approximate Queries, Approximate Heaps and Soft Heaps}}, booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)}, pages = {95:1--95:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-109-2}, ISSN = {1868-8969}, year = {2019}, volume = {132}, editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.95}, URN = {urn:nbn:de:0030-drops-106712}, doi = {10.4230/LIPIcs.ICALP.2019.95}, annote = {Keywords: Order queries, word RAM, lower bounds} }
Published in: OASIcs, Volume 69, 2nd Symposium on Simplicity in Algorithms (SOSA 2019)
Haim Kaplan, László Kozma, Or Zamir, and Uri Zwick. Selection from Heaps, Row-Sorted Matrices, and X+Y Using Soft Heaps. In 2nd Symposium on Simplicity in Algorithms (SOSA 2019). Open Access Series in Informatics (OASIcs), Volume 69, pp. 5:1-5:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{kaplan_et_al:OASIcs.SOSA.2019.5, author = {Kaplan, Haim and Kozma, L\'{a}szl\'{o} and Zamir, Or and Zwick, Uri}, title = {{Selection from Heaps, Row-Sorted Matrices, and X+Y Using Soft Heaps}}, booktitle = {2nd Symposium on Simplicity in Algorithms (SOSA 2019)}, pages = {5:1--5:21}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-099-6}, ISSN = {2190-6807}, year = {2019}, volume = {69}, editor = {Fineman, Jeremy T. and Mitzenmacher, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2019.5}, URN = {urn:nbn:de:0030-drops-100315}, doi = {10.4230/OASIcs.SOSA.2019.5}, annote = {Keywords: selection, soft heap} }
Published in: LIPIcs, Volume 47, 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)
Shiri Chechik, Haim Kaplan, Mikkel Thorup, Or Zamir, and Uri Zwick. Bottleneck Paths and Trees and Deterministic Graphical Games. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 27:1-27:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{chechik_et_al:LIPIcs.STACS.2016.27, author = {Chechik, Shiri and Kaplan, Haim and Thorup, Mikkel and Zamir, Or and Zwick, Uri}, title = {{Bottleneck Paths and Trees and Deterministic Graphical Games}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {27:1--27:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.27}, URN = {urn:nbn:de:0030-drops-57283}, doi = {10.4230/LIPIcs.STACS.2016.27}, annote = {Keywords: bottleneck paths, comparison model, deterministic graphical games} }
Feedback for Dagstuhl Publishing