default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZoltán Toroczkai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j7]Péter L. Erdös, Shubha R. Kharel
, Tamás Róbert Mezei, Zoltán Toroczkai:
Degree-preserving graph dynamics: a versatile process to construct random networks. J. Complex Networks 11(5) (2023)- [i22]David H. Wolpert, Jan Korbel, Christopher Lynn, Farita Tasnim, Joshua A. Grochow, Gülce Kardes, James B. Aimone, Vijay Balasubramanian, Eric De Giuli, David Doty, Nahuel Freitas, Matteo Marsili, Thomas E. Ouldridge, Andréa W. Richa, Paul M. Riechers, Édgar Roldán, Brenda M. Rubenstein, Zoltán Toroczkai, Joseph A. Paradiso:
Is stochastic thermodynamics the key to understanding the energy costs of computation? CoRR abs/2311.17166 (2023) - 2022
- [c3]Muya Chang, Xunzhao Yin, Zoltán Toroczkai, Xiaobo Hu, Arijit Raychowdhury:
An Analog Clock-free Compute Fabric base on Continuous-Time Dynamical System for Solving Combinatorial Optimization Problems. CICC 2022: 1-2 - 2021
- [i21]Péter L. Erdös, Shubha R. Kharel, Tamás Róbert Mezei, Zoltán Toroczkai:
Degree-preserving graph dynamics - a versatile process to construct random networks. CoRR abs/2111.11994 (2021) - 2020
- [j6]Ferenc Molnár, Shubha R. Kharel, Xiaobo Sharon Hu, Zoltán Toroczkai:
Accelerating a continuous-time analog SAT solver using GPUs. Comput. Phys. Commun. 256: 107469 (2020)
2010 – 2019
- 2018
- [j5]Péter L. Erdös, István Miklós, Zoltán Toroczkai:
New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling. Comb. Probab. Comput. 27(2): 186-207 (2018) - [j4]Xunzhao Yin, Behnam Sedighi, Melinda Varga, Mária Ercsey-Ravasz, Zoltán Toroczkai, Xiaobo Sharon Hu:
Efficient Analog Circuits for Boolean Satisfiability. IEEE Trans. Very Large Scale Integr. Syst. 26(1): 155-167 (2018) - [i20]Botond Molnár, Melinda Varga, Zoltán Toroczkai, Mária Ercsey-Ravasz:
A high-performance analog Max-SAT solver and its application to Ramsey numbers. CoRR abs/1801.06620 (2018) - 2017
- [c2]Xunzhao Yin, Zoltán Toroczkai, Xiaobo Sharon Hu:
An analog SAT solver based on a deterministic dynamical system: (Invited paper). ICCAD 2017: 794-799 - 2016
- [i19]Péter L. Erdös, István Miklós, Zoltán Toroczkai:
New classes of degree sequences with fast mixing swap Markov chain sampling. CoRR abs/1601.08224 (2016) - [i18]Róbert Sumi, Melinda Varga, Zoltán Toroczkai, Mária Ercsey-Ravasz:
Order-to-chaos transition in the hardness of random Boolean satisfiability problems. CoRR abs/1602.05152 (2016) - [i17]Xunzhao Yin, Behnam Sedighi, Melinda Varga, Mária Ercsey-Ravasz, Zoltán Toroczkai, Xiaobo Sharon Hu:
Efficient Analog Circuits for Boolean Satisfiability. CoRR abs/1606.07467 (2016) - 2015
- [j3]Péter L. Erdös, István Miklós, Zoltán Toroczkai:
A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix. SIAM J. Discret. Math. 29(1): 481-499 (2015) - [i16]Kevin E. Bassler, Charo I. Del Genio, Péter L. Erdös, István Miklós, Zoltán Toroczkai:
Exact sampling of graphs with prescribed degree correlations. CoRR abs/1503.06725 (2015) - [i15]Chiara Orsini, Marija Mitrovic Dankulov, Almerima Jamakovic, Priya Mahadevan, Pol Colomer-de-Simon, Amin Vahdat, Kevin E. Bassler, Zoltán Toroczkai, Marián Boguñá, Guido Caldarelli, Santo Fortunato, Dmitri V. Krioukov:
How random are complex networks. CoRR abs/1505.07503 (2015) - 2014
- [i14]Yihui Ren, Mária Ercsey-Ravasz, Pu Wang, Marta C. González, Zoltán Toroczkai:
Predicting commuter flows in spatial networks using a radiation model based on temporal ranges. CoRR abs/1410.4849 (2014) - 2013
- [j2]Henry Kennedy, Kenneth Knoblauch, Zoltán Toroczkai:
Why data coherence and quality is critical for understanding interareal cortical networks. NeuroImage 80: 37-45 (2013) - [i13]Péter L. Erdös, István Miklós, Zoltán Toroczkai:
A decomposition based proof for fast mixing of a Markov chain over balanced realizations of a joint degree matrix. CoRR abs/1307.5295 (2013) - 2012
- [i12]Mária Ercsey-Ravasz, Zoltán Toroczkai:
The Chaos Within Sudoku. CoRR abs/1208.0370 (2012) - [i11]Mária Ercsey-Ravasz, Zoltán Toroczkai:
Optimization hardness as transient chaos in an analog approach to constraint satisfaction. CoRR abs/1208.0526 (2012) - 2011
- [i10]Nitesh V. Chawla, David Hachen, Omar Lizardo, Zoltán Toroczkai, Anthony Strathman, Cheng Wang:
Weighted reciprocity in human communication networks. CoRR abs/1108.2822 (2011) - [i9]Hyunju Kim, Charo I. Del Genio, Kevin E. Bassler, Zoltán Toroczkai:
Constructing and sampling directed graphs with given degree sequences. CoRR abs/1109.4590 (2011) - [i8]Mária Ercsey-Ravasz, Ryan Lichtenwalter, Nitesh V. Chawla, Zoltán Toroczkai:
Range-limited Centrality Measures in Complex Networks. CoRR abs/1111.5382 (2011) - 2010
- [j1]Péter L. Erdös, István Miklós, Zoltán Toroczkai:
A Simple Havel-Hakimi Type Algorithm to Realize Graphical Degree Sequences of Directed Graphs. Electron. J. Comb. 17(1) (2010) - [i7]Charo I. Del Genio, Hyunju Kim, Zoltán Toroczkai, Kevin E. Bassler:
Efficient and exact sampling of simple graphs with given arbitrary degree sequence. CoRR abs/1002.2975 (2010)
2000 – 2009
- 2006
- [p1]Zoltán Toroczkai, György Korniss, Mark A. Novotny, Hasan Guclu:
Scalability, Random Surfaces, and Synchronized Computing Networks. Computational Complexity and Statistical Physics 2006: 249-270 - [i6]Bogdan Danila, Yong Yu, Samuel Earl, John A. Marsh, Zoltán Toroczkai, Kevin E. Bassler:
Congestion-gradient driven transport on complex networks. CoRR abs/cond-mat/0603861 (2006) - [i5]Sameet Sreenivasan, Reuven Cohen, Eduardo López, Zoltán Toroczkai, Harry Eugene Stanley:
Communication Bottlenecks in Scale-Free Networks. CoRR abs/cs/0604023 (2006) - 2003
- [i4]György Korniss, Mark A. Novotny, Hasan Guclu, Zoltán Toroczkai, Per Arne Rikvold:
Suppressing Roughness of Virtual Times in Parallel Discrete-Event Simulations. CoRR cond-mat/0302050 (2003) - 2001
- [c1]István Miklós, Zoltán Toroczkai:
An Improved Model for Statistical Alignment. WABI 2001: 1-10 - [i3]György Korniss, Mark A. Novotny, Per Arne Rikvold, Hasan Guclu, Zoltán Toroczkai:
Going through Rough Times: from Non-Equilibrium Surface Growth to Algorithmic Scalability. CoRR cond-mat/0112103 (2001) - 2000
- [i2]György Korniss, Mark A. Novotny, Zoltán Toroczkai, Per Arne Rikvold:
Non-equilibrium Surface Growth and Scalability of Parallel Algorithms for Large Asynchronous Systems. CoRR cond-mat/0002469 (2000)
1990 – 1999
- 1999
- [i1]György Korniss, Zoltán Toroczkai, Mark A. Novotny, Per Arne Rikvold:
From Massively Parallel Algorithms and Fluctuating Time Horizons to Non-equilibrium Surface Growth. CoRR cond-mat/9909114 (1999)
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-05-08 21:44 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:
