![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Will Perkins 0001
aka: William Perkins 0001
Georgia Institute of Technology, Atlanta, GA, USA
Likely matches
- William R. Perkins
- William C. Perkins
- William A. Perkins
- William Perkins — disambiguation page
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 147 matches
- 2024
- David J. Galvin, Gwen McKinley, Will Perkins
, Michail Sarantis, Prasad Tetali:
On the zeroes of hypergraph independence polynomials. Comb. Probab. Comput. 33(1): 65-84 (2024) - Evangelia Kyrimi, Rebecca S. Stoner, Zane B. Perkins
, Erhan Pisirir, Jared M. Wohlgemut
, William Marsh
, Nigel R. M. Tai:
Updating and recalibrating causal probabilistic models on a new target population. J. Biomed. Informatics 149: 104572 (2024) - Will Perkins, Changji Xu:
Frozen 1-RSB structure of the symmetric Ising perceptron. Random Struct. Algorithms 64(4): 856-877 (2024) - Antonio Blanca
, Sarah Cannon
, Will Perkins
:
Fast and Perfect Sampling of Subgraphs and Polymer Systems. ACM Trans. Algorithms 20(1): 5:1-5:30 (2024) - Will Perkins, Yuzhou Wang:
On the hardness of finding balanced independent sets in random bipartite graphs. SODA 2024: 2376-2397 - Aiya Kuchukova, Marcus Pappik, Will Perkins, Corrine Yap:
Fast and Slow Mixing of the Kawasaki Dynamics on Bounded-Degree Graphs. CoRR abs/2405.06209 (2024) - 2023
- Christian Borgs
, Jennifer T. Chayes, Tyler Helmuth, Will Perkins, Prasad Tetali:
Efficient sampling and counting algorithms for the Potts model on ℤd at all temperatures. Random Struct. Algorithms 63(1): 130-170 (2023) - Matthew Jenssen, Will Perkins, Aditya Potukuchi:
Approximately counting independent sets in bipartite graphs via graph containers. Random Struct. Algorithms 63(1): 215-241 (2023) - Ewan Davies, Will Perkins:
Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs. SIAM J. Comput. 52(2): 618-640 (2023) - Tyler Helmuth
, Holden Lee
, Will Perkins, Mohan Ravichandran, Qiang Wu:
Approximation Algorithms for the Random Field Ising Model. SIAM J. Discret. Math. 37(3): 1610-1629 (2023) - Konrad Anand, Andreas Göbel, Marcus Pappik, Will Perkins:
Perfect Sampling for Hard Spheres from Strong Spatial Mixing. APPROX/RANDOM 2023: 38:1-38:18 - David Gamarnik, Eren C. Kizildag, Will Perkins, Changji Xu:
Geometric Barriers for Stable and Online Algorithms for Discrepancy Minimization. COLT 2023: 3231-3263 - Erhan Pisirir, Jared M. Wohlgemut, Evangelia Kyrimi, Rebecca S. Stoner, Zane B. Perkins, Nigel R. M. Tai, D. William R. Marsh:
A Process for Evaluating Explanations for Transparent and Trustworthy AI Prediction Models. ICHI 2023: 388-397 - David Gamarnik, Eren C. Kizildag, Will Perkins, Changji Xu:
Geometric Barriers for Stable and Online Algorithms for Discrepancy Minimization. CoRR abs/2302.06485 (2023) - Konrad Anand, Andreas Göbel, Marcus Pappik, Will Perkins:
Perfect Sampling for Hard Spheres from Strong Spatial Mixing. CoRR abs/2305.02450 (2023) - Will Perkins, Yuzhou Wang:
On the hardness of finding balanced independent sets in random bipartite graphs. CoRR abs/2307.13921 (2023) - Cecilia Aas, Hisham Abdelsalam, Irina Belousova, Shruti Bhargava, Jianpeng Cheng, Robert Daland, Joris Driesen, Federico Flego, Tristan Guigue, Anders Johannsen, Partha Lal, Jiarui Lu, Joel Ruben Antony Moniz, Nathan Perkins, Dhivya Piraviperumal, Stephen Pulman, Diarmuid Ó Séaghdha, David Q. Sun, John Torr, Marco Del Vecchio, Jay Wacker, Jason D. Williams, Hong Yu:
Intelligent Assistant Language Understanding On Device. CoRR abs/2308.03905 (2023) - 2022
- Matthew Jenssen, Will Perkins
, Aditya Potukuchi:
Independent sets of a given size and structure in the hypercube. Comb. Probab. Comput. 31(4): 702-720 (2022) - Emma Cohen, Will Perkins, Michail Sarantis, Prasad Tetali:
On the number of independent sets in uniform, regular, linear hypergraphs. Eur. J. Comb. 99: 103401 (2022) - Jie Bao
, Yunxiang Chen, Yilin Fang, Xuehang Song
, William Perkins, Zhuoran Duan, Pin Shuai
, Huiying Ren, Zhangshuan Hou, Marshall C. Richmond, Xiaoliang He, Timothy D. Scheibe
:
Modeling framework for evaluating the impacts of hydrodynamic pressure on hydrologic exchange fluxes and residence time for a large-scale river section over a long-term period. Environ. Model. Softw. 148: 105277 (2022) - Antonio Blanca, Sarah Cannon, Will Perkins:
Fast and Perfect Sampling of Subgraphs and Polymer Systems. APPROX/RANDOM 2022: 4:1-4:18 - David Gamarnik, Eren C. Kizildag, Will Perkins, Changji Xu:
Algorithms and Barriers in the Symmetric Binary Perceptron Model. FOCS 2022: 576-587 - Gregg William Perkins, Santiago Echeverry:
Virtual Production in Action: A Creative Implementation of Expanded Cinematography and Narratives. SIGGRAPH Posters 2022: 21:1-21:2 - Matthew Jenssen, Aditya Potukuchi, Will Perkins:
Approximately counting independent sets in bipartite graphs via graph containers. SODA 2022: 499-516 - Charlie Carlson, Ewan Davies
, Alexandra Kolla, Will Perkins
:
Computational thresholds for the fixed-magnetization Ising model. STOC 2022: 1459-1472 - Vishesh Jain, Will Perkins
, Ashwin Sah, Mehtaab Sawhney:
Approximate counting and sampling via local central limit theorems. STOC 2022: 1473-1486 - Antonio Blanca, Sarah Cannon, Will Perkins:
Fast and perfect sampling of subgraphs and polymer systems. CoRR abs/2202.05907 (2022) - Marcus Michelen, Will Perkins:
Strong spatial mixing for repulsive point processes. CoRR abs/2202.08753 (2022) - David Gamarnik, Eren C. Kizildag, Will Perkins, Changji Xu:
Algorithms and Barriers in the Symmetric Binary Perceptron Model. CoRR abs/2203.15667 (2022) - David J. Galvin, Gwen McKinley, Will Perkins, Michail Sarantis, Prasad Tetali:
On the zeroes of hypergraph independence polynomials. CoRR abs/2211.00464 (2022)
skipping 117 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
retrieved on 2024-07-27 08:45 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint