Zoltán Toroczkai

According to our database1, Zoltán Toroczkai authored at least 26 papers between 1999 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Accelerating a continuous-time analog SAT solver using GPUs.
Comput. Phys. Commun., 2020

2018
Efficient Analog Circuits for Boolean Satisfiability.
IEEE Trans. Very Large Scale Integr. Syst., 2018

New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling.
Comb. Probab. Comput., 2018

A high-performance analog Max-SAT solver and its application to Ramsey numbers.
CoRR, 2018

2017
An analog SAT solver based on a deterministic dynamical system: (Invited paper).
Proceedings of the 2017 IEEE/ACM International Conference on Computer-Aided Design, 2017

2016
Order-to-chaos transition in the hardness of random Boolean satisfiability problems.
CoRR, 2016

2015
A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix.
SIAM J. Discret. Math., 2015

How random are complex networks.
CoRR, 2015

Exact sampling of graphs with prescribed degree correlations.
CoRR, 2015

2014
Predicting commuter flows in spatial networks using a radiation model based on temporal ranges.
CoRR, 2014

2013
Why data coherence and quality is critical for understanding interareal cortical networks.
NeuroImage, 2013

2012
Optimization hardness as transient chaos in an analog approach to constraint satisfaction
CoRR, 2012

The Chaos Within Sudoku
CoRR, 2012

2011
Range-limited Centrality Measures in Complex Networks
CoRR, 2011

Constructing and sampling directed graphs with given degree sequences
CoRR, 2011

Weighted reciprocity in human communication networks
CoRR, 2011

2010
Efficient and exact sampling of simple graphs with given arbitrary degree sequence
CoRR, 2010

A Simple Havel-Hakimi Type Algorithm to Realize Graphical Degree Sequences of Directed Graphs.
Electron. J. Comb., 2010

2006
Communication Bottlenecks in Scale-Free Networks
CoRR, 2006

Congestion-gradient driven transport on complex networks
CoRR, 2006

Scalability, Random Surfaces, and Synchronized Computing Networks.
Proceedings of the Computational Complexity and Statistical Physics., 2006

2003
Suppressing Roughness of Virtual Times in Parallel Discrete-Event Simulations
CoRR, 2003

2001
Going through Rough Times: from Non-Equilibrium Surface Growth to Algorithmic Scalability
CoRR, 2001

An Improved Model for Statistical Alignment.
Proceedings of the Algorithms in Bioinformatics, First International Workshop, 2001

2000
Non-equilibrium Surface Growth and Scalability of Parallel Algorithms for Large Asynchronous Systems
CoRR, 2000

1999
From Massively Parallel Algorithms and Fluctuating Time Horizons to Non-equilibrium Surface Growth
CoRR, 1999


  Loading...