×

Found 472 Documents (Results 1–100)

Newest Citations Relevance
Braverman, Mark

Communication and information complexity. (English) Zbl 07822678

Beliaev, Dmitry (ed.) et al., International congress of mathematicians 2022, ICM 2022, Helsinki, Finland, virtual, July 6–14, 2022. Volume 1. Prize lectures. Berlin: European Mathematical Society (EMS). 284-320 (2023).
MSC:  68Q11 68P30 94A15
PDFBibTeX XMLCite
\textit{M. Braverman}, in: International congress of mathematicians 2022, ICM 2022, Helsinki, Finland, virtual, July 6--14, 2022. Volume 1. Prize lectures. Berlin: European Mathematical Society (EMS). 284--320 (2023; Zbl 07822678)
Full Text: DOI
OA License
Braverman, Alexander; Finkelberg, Michael

A quasi-coherent description of the category \(D\)-\(\bmod(\mathrm{Gr}_{\mathrm{GL}}(n))\). (English) Zbl 1502.14041

Baranovsky, Vladimir (ed.) et al., Representation theory and algebraic geometry. A conference celebrating the birthdays of Sasha Beilinson and Victor Ginzburg, Chicago, IL, USA, August 21–25, 2017. Cham: Birkhäuser. Trends Math., 133-149 (2022).
MSC:  14F08 81T13 14F43 14D21
PDFBibTeX XMLCite
\textit{A. Braverman} and \textit{M. Finkelberg}, in: Representation theory and algebraic geometry. A conference celebrating the birthdays of Sasha Beilinson and Victor Ginzburg, Chicago, IL, USA, August 21--25, 2017. Cham: Birkhäuser. 133--149 (2022; Zbl 1502.14041)
Full Text: DOI arXiv
Braverman, Mark (ed.)

13th innovations in theoretical computer science conference, ITCS 2022, Berkeley, CA, USA, January 31 – February 3, 2022. (English) Zbl 1482.68012

LIPIcs – Leibniz International Proceedings in Informatics 215. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-217-4). xxiv, 120 articles, not consecutively paged, electronic only, open access (2022).
MSC:  68-06 68Qxx 00B25
PDFBibTeX XMLCite
\textit{M. Braverman} (ed.), 13th innovations in theoretical computer science conference, ITCS 2022, Berkeley, CA, USA, January 31 -- February 3, 2022. Wadern: Schloss Dagstuhl -- Leibniz Zentrum für Informatik (2022; Zbl 1482.68012)
Full Text: DOI Link
Braverman, Mark; Minzer, Dor

New separations results for external information. (English) Zbl 07765168

Khuller, Samir (ed.) et al., Proceedings of the 53rd annual ACM SIGACT symposium on theory of computing, STOC ’21, virtual, Italy, June 21–25, 2021. New York, NY: Association for Computing Machinery (ACM). 248-258 (2021).
MSC:  68Qxx
PDFBibTeX XMLCite
\textit{M. Braverman} and \textit{D. Minzer}, in: Proceedings of the 53rd annual ACM SIGACT symposium on theory of computing, STOC '21, virtual, Italy, June 21--25, 2021. New York, NY: Association for Computing Machinery (ACM). 248--258 (2021; Zbl 07765168)
Full Text: DOI arXiv
Braverman, Mark; Minzer, Dor

Optimal tiling of the Euclidean space using permutation-symmetric bodies. (English) Zbl 07711587

Kabanets, Valentine (ed.), 36th computational complexity conference, CCC 2021, Toronto, Ontario, Canada, virtual conference, July 20–23, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 200, Article 5, 48 p. (2021).
MSC:  68Q25
PDFBibTeX XMLCite
\textit{M. Braverman} and \textit{D. Minzer}, LIPIcs -- Leibniz Int. Proc. Inform. 200, Article 5, 48 p. (2021; Zbl 07711587)
Full Text: DOI arXiv
Braverman, M.; Buchstaber, V. M.; Gromov, M.; Ivrii, V.; Kordyukov, Yu. A.; Kuchment, P.; Maz’ya, V.; Novikov, S. P.; Sunada, T.; Friedlander, L.; Khovanskii, A. G.

Mikhail Aleksandrovich Shubin. (English. Russian original) Zbl 1459.01023

Russ. Math. Surv. 75, No. 6, 1143-1152 (2020); translation from Usp. Mat. Nauk 75, No. 6, 162-170 (2020).
MSC:  01A70 35-03 47-03 58-03
PDFBibTeX XMLCite
\textit{M. Braverman} et al., Russ. Math. Surv. 75, No. 6, 1143--1152 (2020; Zbl 1459.01023); translation from Usp. Mat. Nauk 75, No. 6, 162--170 (2020)
Full Text: DOI arXiv
Shubin, Mikhail
Braverman, Maxim (ed.); McOwen, Robert (ed.); Topalov, Peter (ed.)

Invitation to partial differential equations. Edited by Maxim Braverman, Robert McOwen and Peter Topalov. (English) Zbl 1458.35001

Graduate Studies in Mathematics 205. Providence, RI: American Mathematical Society (AMS) (ISBN 978-0-8218-3640-8/hbk; 978-1-4704-5697-9/ebook). xvii, 319 p. (2020).
Reviewer: Vicenţiu D. Rădulescu (Craiova)
MSC:  35-01 35Jxx 35Kxx 35Lxx
PDFBibTeX XMLCite
\textit{M. Shubin} et al., Invitation to partial differential equations. Edited by Maxim Braverman, Robert McOwen and Peter Topalov. Providence, RI: American Mathematical Society (AMS) (2020; Zbl 1458.35001)
Full Text: DOI
Braverman, Maxim; Dikansky, Arnold; Friedlander, Leonid; Gromov, Misha; Ivrii, Victor; Kordyukov, Yuri; Kuchment, Peter; Maz’ya, Vladimir; Owen, Robert Mc; Sunada, Toshikazu; Zvonkin, Alexander

Mikhail Aleksandrovich Shubin. December 19, 1944 – May 13, 2020. arXiv:2008.01248

Preprint, arXiv:2008.01248 [math.HO] (2020).
MSC:  01A70
BibTeX Cite
\textit{M. Braverman} et al., ``Mikhail Aleksandrovich Shubin. December 19, 1944 -- May 13, 2020'', Preprint, arXiv:2008.01248 [math.HO] (2020)
Full Text: arXiv
OA License
Braverman, Mark; Kol, Gillat; Oshman, Rotem; Tal, Avishay

On the computational power of radio channels. (English) Zbl 1515.68138

Suomela, Jukka (ed.), 33rd international symposium on distributed computing, DISC 2019, Budapest, Hungary, October 14–18, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 146, Article 8, 17 p. (2019).
MSC:  68Q10 68M12 68Q11 68W15
PDFBibTeX XMLCite
\textit{M. Braverman} et al., LIPIcs -- Leibniz Int. Proc. Inform. 146, Article 8, 17 p. (2019; Zbl 1515.68138)
Full Text: DOI
Braverman, Mark; Efremenko, Klim; Gelles, Ran; Yitayew, Michael A.

Optimal short-circuit resilient formulas. (English) Zbl 07564410

Shpilka, Amir (ed.), 34th computational complexity conference, CCC 2019, New Brunswick, NJ, USA, July 18–20, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 137, Article 10, 22 p. (2019).
MSC:  68Q25
PDFBibTeX XMLCite
\textit{M. Braverman} et al., LIPIcs -- Leibniz Int. Proc. Inform. 137, Article 10, 22 p. (2019; Zbl 07564410)
Full Text: DOI arXiv
Braverman, Vladimir; Charikar, Moses; Kuszmaul, William; Woodruff, David P.; Yang, Lin F.

The one-way communication complexity of dynamic time warping distance. (English) Zbl 07559216

Barequet, Gill (ed.) et al., 35th international symposium on computational geometry, SoCG 2019, Portland, Oregon, USA, June 18–21, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 129, Article 16, 15 p. (2019).
MSC:  68U05
PDFBibTeX XMLCite
\textit{V. Braverman} et al., LIPIcs -- Leibniz Int. Proc. Inform. 129, Article 16, 15 p. (2019; Zbl 07559216)
Full Text: DOI
Braverman, Alexander; Finkelberg, Michael

Coulomb branches of 3-dimensional gauge theories and related structures. (English) Zbl 1439.81074

Bruzzo, Ugo (ed.) et al., Geometric representation theory and gauge theory. Cetraro, Italy, June 25–29, 2018. Lecture notes given at the CIME school. Cham: Springer; Florence: Fondazione CIME. Lect. Notes Math. 2248, 1-52 (2019).
MSC:  81T13 53D17 57P10 58J47 14D21
PDFBibTeX XMLCite
\textit{A. Braverman} and \textit{M. Finkelberg}, Lect. Notes Math. 2248, 1--52 (2019; Zbl 1439.81074)
Full Text: DOI arXiv
Aizerman, M. A.; Braverman, E. M.; Rozonoer, Lev I.

On the choice of a kernel function in symmetric spaces. (English) Zbl 1518.68285

Rozonoer, Lev (ed.) et al., Braverman readings in machine learning. Key ideas from inception to current state. International conference commemorating the 40th anniversary of Emmanuil Braverman’s decease, Boston, MA, USA, April 28–30, 2017. Invited talks. Cham: Springer. Lect. Notes Comput. Sci. 11100, 128-147 (2018).
MSC:  68T05 68-03 68T10
PDFBibTeX XMLCite
\textit{M. A. Aizerman} et al., Lect. Notes Comput. Sci. 11100, 128--147 (2018; Zbl 1518.68285)
Full Text: DOI
Braverman, Mark; Ko, Young Kun

Semi-direct sum theorem and nearest neighbor under \(\ell_\infty\). (English) Zbl 1521.68066

Blais, Eric (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 21st international workshop, APPROX 2018, and 22nd international workshop, RANDOM 2018 August 20–22, 2018, Princeton, USA. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 116, Article 6, 17 p. (2018).
MSC:  68Q11 68P05 68P10 68W20
PDFBibTeX XMLCite
\textit{M. Braverman} and \textit{Y. K. Ko}, LIPIcs -- Leibniz Int. Proc. Inform. 116, Article 6, 17 p. (2018; Zbl 1521.68066)
Full Text: DOI
Braverman, Mark; Ko, Young Kun

Information value of two-prover games. (English) Zbl 1462.68055

Karlin, Anna R. (ed.), 9th innovations in theoretical computer science conference, ITCS 2018, Cambridge, MA, USA, January 11–14, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 94, Article 12, 15 p. (2018).
MSC:  68Q11 91A80
PDFBibTeX XMLCite
\textit{M. Braverman} and \textit{Y. K. Ko}, LIPIcs -- Leibniz Int. Proc. Inform. 94, Article 12, 15 p. (2018; Zbl 1462.68055)
Full Text: DOI
Braverman, Mark; Ganor, Anat; Kol, Gillat; Raz, Ran

A candidate for a strong separation of information and communication. (English) Zbl 1462.68054

Karlin, Anna R. (ed.), 9th innovations in theoretical computer science conference, ITCS 2018, Cambridge, MA, USA, January 11–14, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 94, Article 11, 13 p. (2018).
MSC:  68Q11
PDFBibTeX XMLCite
\textit{M. Braverman} et al., LIPIcs -- Leibniz Int. Proc. Inform. 94, Article 11, 13 p. (2018; Zbl 1462.68054)
Full Text: DOI
Braverman, Mark; Kol, Gillat

Interactive compression to external information. (English) Zbl 1427.68075

Diakonikolas, Ilias (ed.) et al., Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC ’18, Los Angeles, CA, USA, June 25–29, 2018. New York, NY: Association for Computing Machinery (ACM). 964-977 (2018).
MSC:  68P30 68Q11
PDFBibTeX XMLCite
\textit{M. Braverman} and \textit{G. Kol}, in: Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC '18, Los Angeles, CA, USA, June 25--29, 2018. New York, NY: Association for Computing Machinery (ACM). 964--977 (2018; Zbl 1427.68075)
Full Text: DOI
Braverman, Mark; Cohen, Gil; Garg, Sumegha

Hitting sets with near-optimal error for read-once branching programs. (English) Zbl 1427.68095

Diakonikolas, Ilias (ed.) et al., Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC ’18, Los Angeles, CA, USA, June 25–29, 2018. New York, NY: Association for Computing Machinery (ACM). 353-362 (2018).
MSC:  68Q15 68W20
PDFBibTeX XMLCite
\textit{M. Braverman} et al., in: Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC '18, Los Angeles, CA, USA, June 25--29, 2018. New York, NY: Association for Computing Machinery (ACM). 353--362 (2018; Zbl 1427.68095)
Full Text: DOI
Braverman, Mark; Mao, Jieming; Weinberg, S. Matthew

On simultaneous two-player combinatorial auctions. (English) Zbl 1403.91160

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). 2256-2273 (2018).
MSC:  91B26 91A05 91A46 91-04
PDFBibTeX XMLCite
\textit{M. Braverman} et al., in: 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). 2256--2273 (2018; Zbl 1403.91160)
Full Text: arXiv Link
Braverman, Mark; Ko, Young Kun; Rubinstein, Aviad; Weinstein, Omri

ETH hardness for densest-\(k\)-subgraph with perfect completeness. (English) Zbl 1409.68125

Klein, Philip N. (ed.), Proceedings of the 28th annual ACM-SIAM symposium on discrete algorithms, SODA 2017, Barcelona, Spain, January 16–19, 2017. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1326-1341 (2017).
MSC:  68Q17 05C42 05C69 05C85 68Q25
PDFBibTeX XMLCite
\textit{M. Braverman} et al., in: Proceedings of the 28th annual ACM-SIAM symposium on discrete algorithms, SODA 2017, Barcelona, Spain, January 16--19, 2017. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1326--1341 (2017; Zbl 1409.68125)
Full Text: DOI arXiv
Braverman, Mark; Garg, Sumegha; Schvartzman, Ariel

Coding in undirected graphs is either very helpful or not helpful at all. (English) Zbl 1402.90030

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 18, 18 p. (2017).
MSC:  90B18 05C21 05C76 94A29
PDFBibTeX XMLCite
\textit{M. Braverman} et al., LIPIcs -- Leibniz Int. Proc. Inform. 67, Article 18, 18 p. (2017; Zbl 1402.90030)
Full Text: DOI arXiv
Braverman, Mark; Mao, Jieming; Weinberg, S. Matthew

Interpolating between truthful and non-truthful mechanisms for combinatorial auctions. (English) Zbl 1417.91228

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). 1444-1457 (2016).
MSC:  91B26
PDFBibTeX XMLCite
\textit{M. Braverman} et al., in: 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). 1444--1457 (2016; Zbl 1417.91228)
Full Text: DOI arXiv
Braverman, Vladimir; Lang, Harry; Levin, Keith; Monemizadeh, Morteza

Clustering problems on sliding windows. (English) Zbl 1411.68182

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). 1374-1390 (2016).
MSC:  68W25 68P05 68Q25 68U05
PDFBibTeX XMLCite
\textit{V. Braverman} et al., in: 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). 1374--1390 (2016; Zbl 1411.68182)
Full Text: DOI
Braverman, Mark; Schneider, Jon

Information complexity is computable. (English) Zbl 1388.68059

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 87, 10 p. (2016).
MSC:  68Q10 68P30
PDFBibTeX XMLCite
\textit{M. Braverman} and \textit{J. Schneider}, LIPIcs -- Leibniz Int. Proc. Inform. 55, Article 87, 10 p. (2016; Zbl 1388.68059)
Full Text: DOI arXiv
Braverman, Mark; Gelles, Ran; Mao, Jieming; Ostrovsky, Rafail

Coding for interactive communication correcting insertions and deletions. (English) Zbl 1390.68314

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 61, 14 p. (2016).
MSC:  68Q10 68P30
PDFBibTeX XMLCite
\textit{M. Braverman} et al., LIPIcs -- Leibniz Int. Proc. Inform. 55, Article 61, 14 p. (2016; Zbl 1390.68314)
Full Text: DOI
Alon, Noga; Braverman, Mark; Efremenko, Klim; Gelles, Ran; Haeupler, Bernhard

Reliable communication over highly connected noisy networks. (English) Zbl 1373.68033

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). 165-173 (2016).
MSC:  68M10 68M12 68M14 68M15 68P30 68R10
PDFBibTeX XMLCite
\textit{N. Alon} 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). 165--173 (2016; Zbl 1373.68033)
Full Text: DOI
Braverman, Mark; Garg, Ankit; Ma, Tengyu; Nguyen, Huy L.; Woodruff, David P.

Communication lower bounds for statistical estimation problems via a distributed data processing inequality. (English) Zbl 1373.68235

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). 1011-1020 (2016).
MSC:  68Q17 62F10 62H12 68Q10
PDFBibTeX XMLCite
\textit{M. Braverman} et al., 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). 1011--1020 (2016; Zbl 1373.68235)
Full Text: DOI arXiv
Braverman, Mark; Efremenko, Klim; Gelles, Ran; Haeupler, Bernhard

Constant-rate coding for multiparty interactive communication is impossible. (English) Zbl 1373.68038

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). 999-1010 (2016).
MSC:  68M10 68M12 68P30 68Q17
PDFBibTeX XMLCite
\textit{M. Braverman} et al., 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). 999--1010 (2016; Zbl 1373.68038)
Full Text: DOI
Braverman, Mark; Mao, Jieming; Weinberg, S. Matthew

Parallel algorithms for select and partition with noisy comparisons. (English) Zbl 1375.68186

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). 851-862 (2016).
MSC:  68W10 60C05 68Q17 68Q25
PDFBibTeX XMLCite
\textit{M. Braverman} et al., 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). 851--862 (2016; Zbl 1375.68186)
Full Text: DOI arXiv

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Biographic Reference

all top 3

Software