default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJames Stewart 0001
Person information
- affiliation (PhD 2022): University of Oxford, Department of Computer Science, UK
- affiliation: Georgia Institute of Technology, School of Computer Science, Atlanta, GA, USA
Other persons with the same name
- James Stewart — disambiguation page
- James Stewart 0002
![[0000-0002-3134-3415]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-3134-3415")
— University of Waterloo, Department of Electrical and Computer Engineering, ON, Canada
Other persons with a similar name
- Stewart Kowalski (aka: Stewart James Kowalski) — Norwegian University for Science and Technology, Gjøvik, Norway (and 1 more)
- A. James Stewart
- Edward James Charles Stewart
- James A. Stewart
- James Ayrton Stewart
- James H. Stewart
- James J. P. Stewart
- James R. Stewart
- James T. Stewart
- Robert Stewart 0002 (aka: Robert James Stewart 0002) — King's College London, Health Service and Population Research Department, UK
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[b1]James Stewart:
Randomised algorithms for low temperature spin systems. University of Oxford, UK, 2022- [j3]Andreas Galanis, Leslie Ann Goldberg, James Stewart:
Fast mixing via polymers for random graphs with unbounded degree. Inf. Comput. 285(Part): 104894 (2022) - 2021
- [j2]Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Will Perkins, James Stewart, Eric Vigoda:
Fast algorithms at low temperatures via Markov chains. Random Struct. Algorithms 58(2): 294-321 (2021) - [j1]Andreas Galanis, Leslie Ann Goldberg, James Stewart:
Fast Algorithms for General Spin Systems on Bipartite Expanders. ACM Trans. Comput. Theory 13(4): 25:1-25:18 (2021) - [c3]Andreas Galanis, Leslie Ann Goldberg, James Stewart:
Fast Mixing via Polymers for Random Graphs with Unbounded Degree. APPROX-RANDOM 2021: 36:1-36:13 - [i3]Andreas Galanis, Leslie Ann Goldberg, James Stewart:
Fast mixing via polymers for random graphs with unbounded degree. CoRR abs/2105.00524 (2021) - 2020
- [c2]Andreas Galanis, Leslie Ann Goldberg, James Stewart:
Fast Algorithms for General Spin Systems on Bipartite Expanders. MFCS 2020: 37:1-37:14 - [i2]Andreas Galanis, Leslie Ann Goldberg, James Stewart:
Fast algorithms for general spin systems on bipartite expanders. CoRR abs/2004.13442 (2020)
2010 – 2019
- 2019
- [c1]Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Will Perkins, James Stewart, Eric Vigoda:
Fast Algorithms at Low Temperatures via Markov Chains. APPROX-RANDOM 2019: 41:1-41:14 - [i1]Andreas Galanis, Leslie Ann Goldberg, James Stewart:
A note on the high-fugacity hard-core model on bounded-degree bipartite expander graphs. CoRR abs/1901.06653 (2019)
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 2025-01-21 00:18 CET 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:
