default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMária Ercsey-Ravasz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i9]Botond Molnár, Ildikó-Beáta Márton, Szabolcs Horvát
, Mária Ercsey-Ravasz:
Community Detection in Directed Weighted Networks using Voronoi Partitioning. CoRR abs/2304.12389 (2023)- 2021
- [j5]Bulcsú Sándor, Bence Schneider, Zsolt I. Lázár, Mária Ercsey-Ravasz:
A Novel Measure Inspired by Lyapunov Exponents for the Characterization of Dynamics in State-Transition Networks. Entropy 23(1): 103 (2021) - [j4]István Tóth, Zsolt I. Lázár, Levente Varga, Ferenc Járai-Szabó, István Papp, Razvan V. Florian, Mária Ercsey-Ravasz:
Mitigating ageing bias in article level metrics using citation network analysis. J. Informetrics 15(1): 101105 (2021)
2010 – 2019
- 2018
- [j3]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) - [i8]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
- [i7]Zsolt I. Lázár, István Papp, Levente Varga, Ferenc Járai-Szabó, Dávid Deritei, Mária Ercsey-Ravasz:
Stochastic graph Voronoi tessellation reveals community structure. CoRR abs/1702.06363 (2017) - 2016
- [i6]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) - [i5]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) - 2014
- [i4]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) - 2012
- [i3]Mária Ercsey-Ravasz, Zoltán Toroczkai:
The Chaos Within Sudoku. CoRR abs/1208.0370 (2012) - [i2]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
- [i1]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
- [j2]Faruck Morcos, Santanu Chatterjee, Christopher L. McClendon, Paul R. Brenner, Roberto López-Rendón, John Zintsmaster, Mária Ercsey-Ravasz, Christopher R. Sweet, Matthew P. Jacobson, Jeffrey W. Peng, Jesús A. Izaguirre:
Modeling Conformational Ensembles of Slow Functional Motions in Pin1-WW. PLoS Comput. Biol. 6(12) (2010)
2000 – 2009
- 2009
- [j1]Mária Ercsey-Ravasz, Tamás Roska, Zoltán Néda:
Cellular Neural Networks for NP-Hard Optimization. EURASIP J. Adv. Signal Process. 2009 (2009) - 2008
- [b1]Mária Ercsey-Ravasz:
Applications of Cellular Neural/Nonlinear Networks in Physics. Pázmány Péter Catholic University, Hungary, 2008
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-04-25 05:40 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:
