default search action
Miklós Z. Rácz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j14]Tatiana Brailovskaya
, Miklós Z. Rácz:
Tree trace reconstruction using subtraces. J. Appl. Probab. 60(2): 629-641 (2023) - [j13]Miklós Z. Rácz
Towards Consensus: Reducing Polarization by Perturbing Social Networks. IEEE Trans. Netw. Sci. Eng. 10(6): 3450-3464 (2023) - [c12]Miklós Z. Rácz, Anirudh Sridhar
Matching Correlated Inhomogeneous Random Graphs using the k-core Estimator. ISIT 2023: 2499-2504 - [i25]Miklós Z. Rácz, Anirudh Sridhar
Matching Correlated Inhomogeneous Random Graphs using the $k$-core Estimator. CoRR abs/2302.05407 (2023) - 2022
- [j12]Konstantin Makarychev, Miklós Z. Rácz
Batch Optimization for DNA Synthesis. IEEE Trans. Inf. Theory 68(11): 7454-7470 (2022) - [j11]Mayee F. Chen, Miklós Z. Rácz
An Adversarial Model of Network Disruption: Maximizing Disagreement and Polarization in Social Networks. IEEE Trans. Netw. Sci. Eng. 9(2): 728-739 (2022) - [c11]Julia Gaudio, Miklós Z. Rácz, Anirudh Sridhar:
Exact Community Recovery in Correlated Stochastic Block Models. COLT 2022: 2183-2241 - [i24]Julia Gaudio, Miklós Z. Rácz, Anirudh Sridhar
Exact Community Recovery in Correlated Stochastic Block Models. CoRR abs/2203.15736 (2022) - [i23]Miklós Z. Rácz, Daniel E. Rigobon:
Towards Consensus: Reducing Polarization by Perturbing Social Networks. CoRR abs/2206.08996 (2022) - [i22]Julia Gaudio, Miklós Z. Rácz, Anirudh Sridhar
Local canonical labeling of Erdős-Rényi random graphs. CoRR abs/2211.16454 (2022) - 2021
- [j10]Miklós Z. Rácz
Rumor Source Detection With Multiple Observations Under Adaptive Diffusions. IEEE Trans. Netw. Sci. Eng. 8(1): 2-12 (2021) - [c10]Konstantin Makarychev, Miklós Z. Rácz, Cyrus Rashtchian, Sergey Yekhanin:
Batch Optimization for DNA Synthesis. ISIT 2021: 1949-1954 - [c9]Sami Davies, Miklós Z. Rácz, Benjamin G. Schiffer, Cyrus Rashtchian:
Approximate Trace Reconstruction: Algorithms. ISIT 2021: 2525-2530 - [c8]Miklós Z. Rácz, Anirudh Sridhar:
Correlated Stochastic Block Models: Exact Graph Matching with Applications to Recovering Communities. NeurIPS 2021: 22259-22273 - [i21]Tatiana Brailovskaya, Miklós Z. Rácz:
Tree trace reconstruction using subtraces. CoRR abs/2102.01541 (2021) - [i20]Suqi Liu, Miklós Z. Rácz:
Phase transition in noisy high-dimensional random geometric graphs. CoRR abs/2103.15249 (2021) - [i19]Miklós Z. Rácz, Anirudh Sridhar:
Correlated Stochastic Block Models: Exact Graph Matching with Applications to Recovering Communities. CoRR abs/2107.06767 (2021) - [i18]Suqi Liu, Miklós Z. Rácz:
A probabilistic view of latent space graphs and phase transitions. CoRR abs/2110.15886 (2021) - 2020
- [j9]Uriel Feige, David Gamarnik, Joe Neeman, Miklós Z. Rácz, Prasad Tetali:
Finding cliques using few probes. Random Struct. Algorithms 56(1): 142-153 (2020) - [i17]Mayee Chen, Miklós Z. Rácz:
Network disruption: maximizing disagreement and polarization in social networks. CoRR abs/2003.08377 (2020) - [i16]Miklós Z. Rácz, Anirudh Sridhar:
Correlated randomly growing graphs. CoRR abs/2004.13537 (2020) - [i15]Miklós Z. Rácz, Jacob Richey:
Rumor source detection with multiple observations under adaptive diffusions. CoRR abs/2006.11211 (2020) - [i14]Konstantin Makarychev, Miklós Z. Rácz, Cyrus Rashtchian, Sergey Yekhanin:
Batch Optimization for DNA Synthesis. CoRR abs/2011.14532 (2020) - [i13]Sami Davies, Miklós Z. Rácz, Cyrus Rashtchian, Benjamin G. Schiffer:
Approximate Trace Reconstruction. CoRR abs/2012.06713 (2020)
2010 – 2019
- 2019
- [c7]Sami Davies, Miklós Z. Rácz, Cyrus Rashtchian:
Reconstructing Trees from Traces. COLT 2019: 961-978 - [i12]Sami Davies, Miklós Z. Rácz, Cyrus Rashtchian:
Reconstructing Trees from Traces. CoRR abs/1902.05101 (2019) - [i11]Miklós Z. Rácz, Benjamin Schiffer:
Finding a planted clique by adaptive probing. CoRR abs/1903.12050 (2019) - 2018
- [j8]Laura Florescu, Yuval Peres, Miklós Z. Rácz:
Optimal Control for Diffusions on Graphs. SIAM J. Discret. Math. 32(4): 2941-2972 (2018) - [i10]Uriel Feige, David Gamarnik, Joe Neeman, Miklós Z. Rácz, Prasad Tetali:
Finding cliques using few probes. CoRR abs/1809.06950 (2018) - 2017
- [j7]Ronen Eldan, Miklós Z. Rácz, Tselil Schramm:
Braess's paradox for the spectral gap in random graphs and delocalization of eigenvectors. Random Struct. Algorithms 50(4): 584-611 (2017) - [c6]Adam Fourney
Geographic and Temporal Trends in Fake News Consumption During the 2016 US Presidential Election. CIKM 2017: 2071-2074 - [c5]Cyrus Rashtchian, Konstantin Makarychev, Miklós Z. Rácz, Siena Ang, Djordje Jevdjic, Sergey Yekhanin, Luis Ceze, Karin Strauss:
Clustering Billions of Reads for DNA Data Storage. NIPS 2017: 3360-3371 - [i9]Yuval Peres, Miklós Z. Rácz, Allan Sly, Izabella Stuhl:
How fragile are information cascades? CoRR abs/1711.04024 (2017) - 2016
- [j6]Tonci Antunovic, Elchanan Mossel, Miklós Z. Rácz:
Coexistence in Preferential Attachment Networks. Comb. Probab. Comput. 25(6): 797-822 (2016) - [j5]Sébastien Bubeck, Jian Ding, Ronen Eldan, Miklós Z. Rácz:
Testing for high-dimensional geometry in random graphs. Random Struct. Algorithms 49(3): 503-532 (2016) - [c4]Victoria Kostina
Rate-limited control of systems with uncertain gain. Allerton 2016: 1189-1196 - [c3]Shirshendu Ganguly, Elchanan Mossel, Miklós Z. Rácz:
Sequence assembly from corrupted shotgun reads. ISIT 2016: 265-269 - [i8]Shirshendu Ganguly, Elchanan Mossel, Miklós Z. Rácz:
Sequence assembly from corrupted shotgun reads. CoRR abs/1601.07086 (2016) - [i7]Miklós Z. Rácz, Sébastien Bubeck:
Basic models and questions in statistical network analysis. CoRR abs/1609.03511 (2016) - 2015
- [j4]Elchanan Mossel
A quantitative Gibbard-Satterthwaite theorem without neutrality. Comb. 35(3): 317-387 (2015) - [j3]Sébastien Bubeck, Elchanan Mossel
On the Influence of the Seed Graph in the Preferential Attachment Model. IEEE Trans. Netw. Sci. Eng. 2(1): 30-39 (2015) - [c2]Eric J. Friedman, Miklós Z. Rácz, Scott Shenker:
Dynamic Budget-Constrained Pricing in the Cloud. Canadian AI 2015: 114-121 - 2014
- [i6]Sébastien Bubeck, Elchanan Mossel, Miklós Z. Rácz:
On the influence of the seed graph in the preferential attachment model. CoRR abs/1401.4849 (2014) - [i5]Sébastien Bubeck, Ronen Eldan, Elchanan Mossel, Miklós Z. Rácz:
From trees to seeds: on the inference of the seed from large trees in the uniform attachment model. CoRR abs/1409.7685 (2014) - [i4]Sébastien Bubeck, Jian Ding, Ronen Eldan, Miklós Z. Rácz:
Testing for high-dimensional geometry in random graphs. CoRR abs/1411.5713 (2014) - 2013
- [j2]Elchanan Mossel, Ariel D. Procaccia, Miklós Z. Rácz:
A Smooth Transition from Powerlessness to Absolute Power. J. Artif. Intell. Res. 48: 923-951 (2013) - [i3]Tonci Antunovic, Elchanan Mossel, Miklós Z. Rácz:
Coexistence in preferential attachment networks. CoRR abs/1307.2893 (2013) - 2012
- [j1]Elchanan Mossel, Miklós Z. Rácz:
Election manipulation: the average case. SIGecom Exch. 11(2): 22-24 (2012) - [c1]Elchanan Mossel
A quantitative gibbard-satterthwaite theorem without neutrality. STOC 2012: 1041-1060 - [i2]Elchanan Mossel, Ariel D. Procaccia, Miklós Z. Rácz:
A Smooth Transition from Powerlessness to Absolute Power. CoRR abs/1205.2074 (2012) - 2011
- [i1]Elchanan Mossel, Miklós Z. Rácz:
A quantitative Gibbard-Satterthwaite theorem without neutrality. CoRR abs/1110.5888 (2011)
Coauthor Index
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: