Endre Csóka

Follow

Generating author description...

All published works
Action Title Year Authors
+ PDF Chat FIID homomorphisms and entropy inequalities 2024 Endre Csóka
Zoltán Vidnyánszky
+ Finding cliques and dense subgraphs using edge queries 2023 Endre Csóka
András Pongrácz
+ Block partitions in higher dimensions 2023 Endre Csóka
+ PDF Chat Locally common graphs 2022 Endre Csóka
Tamás Hubai
László Lovász
+ Upper bounds for the necklace folding problems 2022 Endre Csóka
Zoltán L. Blázsik
Zoltán Király
Dániel Lenger
+ Moser-Tardos Algorithm with small number of random bits 2022 Endre Csóka
Łukasz Grabowski
András Máthé
Oleg Pikhurko
Konstantinos Tyros
+ A Robust Efficient Dynamic Mechanism 2021 Endre Csóka
+ PDF Chat On directed analogues of expander and hyperfinite graph sequences 2021 Endre Csóka
Łukasz Grabowski
+ Towards solving the 7-in-a-row game 2021 Domonkos Czifra
Endre Csóka
Zsolt Zombori
Géza Makay
+ A Robust Efficient Dynamic Mechanism 2021 Endre Csóka
+ PDF Chat Entropy and expansion 2020 Endre Csóka
Viktor Harangi
Bálint Virág
+ On directed analogues of expander and hyperfinite graph sequences 2020 Endre Csóka
Łukasz Grabowski
+ PDF Chat Application-oriented mathematical algorithms for group testing 2020 Endre Csóka
+ Application-oriented mathematical algorithms for group testing. 2020 Endre Csóka
+ On directed analogues of expander and hyperfinite graph sequences 2020 Endre Csóka
Łukasz Grabowski
+ Upper bounds for the necklace folding problems 2020 Endre Csóka
Zoltán L. Blázsik
Zoltán Király
Dániel Lenger
+ Application-oriented mathematical algorithms for group testing 2020 Endre Csóka
+ Locally common graphs. 2019 Endre Csóka
Tamás Hubai
László Lovász
+ Locally common graphs 2019 Endre Csóka
Tamás Hubai
László Lovász
+ PDF Chat Block partitions: an extended view 2018 Imre Bárány
Endre Csóka
György Károlyi
Gézá Tóth
+ PDF Chat The extremal function for disconnected minors 2017 Endre Csóka
Irene Lo
Sergey Norin
Hehui Wu
Liana Yepremyan
+ Invariant random perfect matchings in Cayley graphs 2017 Endre Csóka
Gábor Lippner
+ Block partitions: an extended view 2017 Imre Bárány
Endre Csóka
György Károlyi
G. Tóth
+ PDF Chat The solution to an open problem for a caching game 2016 Endre Csóka
Thomas Lidbetter
+ Invariant random matchings in Cayley graphs 2016 Endre Csóka
Gábor Lippner
+ Independent sets and cuts in large-girth regular graphs 2016 Endre Csóka
+ Borel version of the Local Lemma 2016 Endre Csóka
Łukasz Grabowski
András Máthé
Oleg Pikhurko
Konstantinos Tyros
+ PDF Chat KŐNIG’S LINE COLORING AND VIZING’S THEOREMS FOR GRAPHINGS 2016 Endre Csóka
Gábor Lippner
Oleg Pikhurko
+ PDF Chat On the graph limit question of Vera T. Sós 2015 Endre Csóka
+ Positive graphs 2015 Omar Antolín Camarena
Endre Csóka
Tamás Hubai
Gábor Lippner
László Lovász
+ On the graph limit question of Vera T. Sós 2015 Endre Csóka
+ The extremal function for disconnected minors 2015 Endre Csóka
Irene Lo
Sergey Norin
Hehui Wu
Liana Yepremyan
+ The solution to an open problem for a caching game 2015 Endre Csóka
Thomas Lidbetter
+ Limits of some combinatorial problems 2015 Endre Csóka
+ Generalized solution for the Herman Protocol Conjecture 2015 Endre Csóka
Szabolcs Mészáros
+ A conjecture about the efficiency of first price mechanisms. 2015 Endre Csóka
+ On the graph limit question of Vera T. S\'os 2015 Endre Csóka
+ A macro placer algorithm for chip design 2015 Endre Csóka
Attila Deák
+ Limit theory of discrete mathematics problems 2015 Endre Csóka
+ The solution to an open problem for a caching game 2015 Endre Csóka
Thomas Lidbetter
+ The extremal function for disconnected minors 2015 Endre Csóka
Irene M.C. Lo
Sergey Norin
Hehui Wu
Liana Yepremyan
+ A conjecture about the efficiency of first price mechanisms 2015 Endre Csóka
+ On the graph limit question of Vera T. Sós 2015 Endre Csóka
+ Generalized solution for the Herman Protocol Conjecture 2015 Endre Csóka
Szabolcs Mészáros
András Pongrácz
+ K\H{o}nig's Line Coloring and Vizing's Theorems for Graphings 2014 Endre Csóka
Gábor Lippner
Oleg Pikhurko
+ PDF Chat Invariant Gaussian processes and independent sets on regular graphs of large girth 2014 Endre Csóka
Balázs Gerencsér
Viktor Harangi
Bálint Virág
+ Kőnig's Line Coloring and Vizing's Theorems for Graphings 2014 Endre Csóka
Gábor Lippner
Oleg Pikhurko
+ PDF Chat Emergence of bimodality in controlling complex networks 2013 Tao Jia
Yang‐Yu Liu
Endre Csóka
Márton Pósfai
Jean-Jacques Slotine
Albert‐László Barabási
+ A local flow algorithm in bounded degree networks 2013 Endre Csóka
+ PDF Chat Core Percolation on Complex Networks 2012 Yang‐Yu Liu
Endre Csóka
Haijun Zhou
Márton Pósfai
+ PDF Chat An Undecidability Result on Limits of Sparse Graphs 2012 Endre Csóka
+ Random local algorithms 2012 Endre Csóka
+ Local algorithms with public randomisation on sparse graphs 2012 Endre Csóka
+ Diszkrét és folytonos: a gráfelmélet, algebra, analízis és geometria találkozási pontjai = Discrete and Continuous: interfaces between graph theory, algebra, analysis and geometry 2012 László Lovász
Mihály Bárász
Károly Bezdek
Károly J. Böröczky
Balázs Csikós
Endre Csóka
György Elekes
Szabolcs L. Fancsali
András Gács
János Geleji
+ Variants of local algorithms on sparse graphs 2012 Endre Csóka
+ Invariant random matchings in Cayley graphs 2012 Endre Csóka
Gábor Lippner
+ Positive graphs 2012 Omar Antolín Camarena
Endre Csóka
Tamás Hubai
Gábor Lippner
László Lovász
+ An undecidability result on limits of sparse graphs 2011 Endre Csóka
+ An undecidability result on limits of sparse graphs 2011 Endre Csóka
+ Local algorithms for the maximum flow and minimum cut in bounded-degree networks 2010 Endre Csóka
András Pongrácz
+ Efficient tendering mechanism for stochastic dynamic multi-agent projects 2006 Endre Csóka
+ Optimal tendering system for projects as partial information non-cooperative randomized games 2006 Endre Csóka
+ Optimization of tendering with multiple subtasks 2006 Endre Csóka
+ Efficient tendering system for stochastic cooperative games with imperfect information 2006 Endre Csóka
+ Optimal tendering system for projects with multiple subtasks 2006 Endre Csóka
+ Efficient mechanism for real-life projects 2006 Endre Csóka
+ Optimal tendering system for stochastic cooperative games with imperfect information 2006 Endre Csóka
+ An efficient mechanism for real-life multi-agent projects 2006 Endre Csóka
+ Efficient mechanism design for stochastic games 2006 Endre Csóka
+ Efficient Teamwork 2006 Endre Csóka
+ Efficient Teamwork 2006 Endre Csóka
Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ PDF Chat Limits of dense graph sequences 2006 László Lovász
Balázs Szegedy
9
+ Large Networks and Graph Limits 2012 László Lovász
7
+ PDF Chat Processes on Unimodular Random Networks 2007 David Aldous
Russell Lyons
5
+ PDF Chat Perfect matchings as IID factors on non-amenable groups 2011 Russell Lyons
Fëdor Nazarov
5
+ PDF Chat Borel oracles. An analytical approach to constant-time algorithms 2010 Gábor Elek
Gábor Lippner
5
+ PDF Chat Limits of local algorithms over sparse random graphs 2014 David Gamarnik
Madhu Sudan
3
+ PDF Chat Recurrence of Distributional Limits of Finite Planar Graphs 2001 Itaı Benjamini
Oded Schramm
3
+ Limits of local-global convergent graph sequences 2012 Hamed Hatami
László Lovász
Balázs Szegedy
3
+ Quasi-random graphs 1989 Fan Chung
Ronald Graham
R. Wilson
3
+ Sidorenko's conjecture for blow-ups 2018 David Conlon
Joonkyung Lee
2
+ The edge-density for <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math> minors 2010 Maria Chudnovsky
Bruce Reed
Paul Seymour
2
+ PDF Chat Global Aspects of Ergodic Group Actions 2010 Alexander S. Kechris
2
+ Dense graphs have <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si3.gif" display="inline" overflow="scroll"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math> minors 2010 Alexandr Kostochka
Noah Prince
2
+ Conjectures on Optimal Nested Generalized Group Testing Algorithm 2018 Yaakov Malinovsky
2
+ Orbit Equivalence and Measured Group Theory 2010 Damien Gaboriau
2
+ PDF Chat Limits of locally–globally convergent graph sequences 2014 Hamed Hatami
László Lovász
Balázs Szegedy
2
+ PDF Chat Combinatorial approach to the interpolation method and scaling limits in sparse random graphs 2010 Mohsen Bayati
David Gamarnik
Prasad Tetali
2
+ PDF Chat Controlling edge dynamics in complex networks 2012 Tamás Nepusz
Tamás Vicsek
2
+ Mercuriale de groupes et de relations 1998 Damien Gaboriau
2
+ PDF Chat Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing 2008 Christian Borgs
Jennifer Chayes
L. Lovász
Vera T. Sós
K. Vesztergombi
2
+ Graph products and monochromatic multiplicities 1997 Andrew Thomason
2
+ PDF Chat Statistical mechanics of complex networks 2002 Réka Albert
Albert‐László Barabási
2
+ On maximal paths and circuits of graphs 1959 P. Erdős
Т. Галлаи
2
+ The Extremal Function for Complete Minors 2001 Andrew Thomason
2
+ A determinacy approach to Borel combinatorics 2015 Andrew Marks
2
+ A note on the independence number of triangle-free graphs 1983 James B. Shearer
2
+ Contractions to <i>k</i><sub>8</sub> 1994 Leif K. Jørgensen
2
+ PDF Chat Random graphs with arbitrary degree distributions and their applications 2001 M. E. J. Newman
Steven H. Strogatz
Duncan J. Watts
2
+ PDF Chat Universal Behavior of Load Distribution in Scale-Free Networks 2001 K.-I. Goh
B. Kahng
D. Kim
2
+ Note on limits of finite graphs 2007 Gábor Elek
2
+ PDF Chat Closed sets without measurable matching 1988 Miklós Laczkovich
2
+ On the independence and chromatic numbers of random regular graphs 1992 Alan Frieze
Tomasz Łuczak
2
+ Disjoint unions of complete minors 2007 Andrew Thomason
2
+ PDF Chat The number of matchings in random graphs 2006 Lenka Zdeborová
Marc Mézard
2
+ PDF Chat A Proof of the Kikuta–Ruckle Conjecture on Cyclic Caching of Resources 2011 Steve Alpern
Robbert Fokkink
Christos Pelekis
2
+ A critical point for random graphs with a given degree sequence 1995 Michael Molloy
Bruce Reed
2
+ Homomorphism theorems for graphs 1964 G. A. Dirac
2
+ PDF Chat Block partitions of sequences 2014 Imre Bárány
Victor S. Grinberg
2
+ Concentration for Independent Permutations 2002 Colin McDiarmid
2
+ The undecidability of the domino problem 1966 Robert E. Berger
2
+ Topics in Orbit Equivalence 2004 Alexander S. Kechris
2
+ PDF Chat Fractional colorings of cubic graphs with large girth 2011 František Kardoš
Daniel Kráľ
Jan Volec
2
+ Decomposing graphs under degree constraints 1996 Michael Stiebitz
2
+ PDF Chat Non-Three-Colourable Common Graphs Exist 2012 Hamed Hatami
Jan Hladký
Daniel Kráľ
Serguei Norine
Alexander Razborov
2
+ PDF Chat Measurable chromatic and independence numbers for ergodic graphs and group actions 2013 Clinton T. Conley
Alexander S. Kechris
2
+ PDF Chat The Extremal Function For Noncomplete Minors 2005 Joseph Samuel Myers
Andrew Thomason
2
+ PDF Chat The independence ratio of regular graphs 1981 Béla Bollobás
2
+ The extremal function for <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>9</mml:mn></mml:mrow></mml:msub></mml:math> minors 2005 Zi‐Xia Song
Robin Thomas
2
+ PDF Chat Accumulation games on graphs 2014 Steve Alpern
Robbert Fokkink
2
+ Borel Chromatic Numbers 1999 Alexander S. Kechris
Sławomir Solecki
Stevo Todorčević
2