Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Liah Kor
@article{DBLP:journals/corr/KorKP15, author = {Liah Kor and Amos Korman and David Peleg}, title = {Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification}, journal = {CoRR}, volume = {abs/1512.04832}, year = {2015}, url = {http://arxiv.org/abs/1512.04832}, eprinttype = {arXiv}, eprint = {1512.04832}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/KorKP15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/KorKP13, author = {Liah Kor and Amos Korman and David Peleg}, title = {Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification}, journal = {Theory Comput. Syst.}, volume = {53}, number = {2}, pages = {318--340}, year = {2013}, url = {https://doi.org/10.1007/s00224-013-9479-7}, doi = {10.1007/S00224-013-9479-7}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/KorKP13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/SarmaHKKNPPW12, author = {Atish Das Sarma and Stephan Holzer and Liah Kor and Amos Korman and Danupon Nanongkai and Gopal Pandurangan and David Peleg and Roger Wattenhofer}, title = {Distributed Verification and Hardness of Distributed Approximation}, journal = {{SIAM} J. Comput.}, volume = {41}, number = {5}, pages = {1235--1265}, year = {2012}, url = {https://doi.org/10.1137/11085178X}, doi = {10.1137/11085178X}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/SarmaHKKNPPW12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/KorKP11, author = {Liah Kor and Amos Korman and David Peleg}, editor = {Thomas Schwentick and Christoph D{\"{u}}rr}, title = {Tight Bounds For Distributed {MST} Verification}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science, {STACS} 2011, March 10-12, 2011, Dortmund, Germany}, series = {LIPIcs}, volume = {9}, pages = {69--80}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2011}, url = {https://doi.org/10.4230/LIPIcs.STACS.2011.69}, doi = {10.4230/LIPICS.STACS.2011.69}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/stacs/KorKP11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/SarmaHKKNPPW11, author = {Atish Das Sarma and Stephan Holzer and Liah Kor and Amos Korman and Danupon Nanongkai and Gopal Pandurangan and David Peleg and Roger Wattenhofer}, editor = {Lance Fortnow and Salil P. Vadhan}, title = {Distributed verification and hardness of distributed approximation}, booktitle = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing, {STOC} 2011, San Jose, CA, USA, 6-8 June 2011}, pages = {363--372}, publisher = {{ACM}}, year = {2011}, url = {https://doi.org/10.1145/1993636.1993686}, doi = {10.1145/1993636.1993686}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/SarmaHKKNPPW11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1011-3049, author = {Atish Das Sarma and Stephan Holzer and Liah Kor and Amos Korman and Danupon Nanongkai and Gopal Pandurangan and David Peleg and Roger Wattenhofer}, title = {Distributed Verification and Hardness of Distributed Approximation}, journal = {CoRR}, volume = {abs/1011.3049}, year = {2010}, url = {http://arxiv.org/abs/1011.3049}, eprinttype = {arXiv}, eprint = {1011.3049}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1011-3049.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.