Endre Csóka

According to our database1, Endre Csóka authored at least 16 papers between 2006 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
On directed analogues of expander and hyperfinite graph sequences.
CoRR, 2020

Application-oriented mathematical algorithms for group testing.
CoRR, 2020

2017
The extremal function for disconnected minors.
J. Comb. Theory, Ser. B, 2017

2016
Positive graphs.
Eur. J. Comb., 2016

Independent sets and cuts in large-girth regular graphs.
CoRR, 2016

2015
Invariant Gaussian processes and independent sets on regular graphs of large girth.
Random Struct. Algorithms, 2015

On the graph limit question of Vera T. Sós.
Electron. Notes Discret. Math., 2015

Limits of some combinatorial problems.
Electron. Notes Discret. Math., 2015

Emergence of bimodality in controlling complex networks.
CoRR, 2015

Several Tokens in Herman's algorithm.
CoRR, 2015

A macro placer algorithm for chip design.
CoRR, 2015

2012
Core percolation on complex networks
CoRR, 2012

Random local algorithms
CoRR, 2012

An Undecidability Result on Limits of Sparse Graphs.
Electron. J. Comb., 2012

2010
Maximum flow is approximable by deterministic constant-time algorithm in sparse networks
CoRR, 2010

2006
Efficient design of stochastic mechanisms
CoRR, 2006


  Loading...