default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBenjamin Przybocki
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[j5]Benjamin Przybocki
, Guilherme Vicentin de Toledo, Yoni Zohar:
Characterizing Sets of Theories That Can Be Disjointly Combined. Proc. ACM Program. Lang. 10(POPL): 265-293 (2026)- [c4]Andrew Krapivin, Benjamin Przybocki, Nicolás Sanhueza-Matamala, Bernardo Subercaseaux:
Optimal and Efficient Partite Decompositions of Hypergraphs. STOC 2026: 2187-2198 - [i11]David P. Woodruff, Vincent Cohen-Addad, Lalit Jain, Jieming Mao, Song Zuo, MohammadHossein Bateni, Simina Brânzei, Michael P. Brenner, Lin Chen, Ying Feng, Lance Fortnow, Gang Fu, Ziyi Guan, Zahra Hadizadeh, Mohammad T. Hajiaghayi, Mahdi JafariRaviz, Adel Javanmard, Karthik C. S., Ken-ichi Kawarabayashi, Ravi Kumar, Silvio Lattanzi, Euiwoong Lee, Yi Li, Ioannis Panageas, Dimitris Paparas, Benjamin Przybocki, Bernardo Subercaseaux, Ola Svensson, Shayan Taherijam, Xuan Wu, Eylon Yogev, Morteza Zadimoghaddam, Samson Zhou, Yossi Matias, James Manyika, Vahab Mirrokni:
Accelerating Scientific Research with Gemini: Case Studies and Common Techniques. CoRR abs/2602.03837 (2026) - [i10]Benjamin Przybocki, Bernardo Subercaseaux, Marijn J. H. Heule:
Automated Reencoding Meets Graph Theory. CoRR abs/2603.27774 (2026) - [i9]Andrew Krapivin, Benjamin Przybocki, Bernardo Subercaseaux:
Near-Optimal Encodings of Cardinality Constraints. CoRR abs/2603.28954 (2026) - [i8]Benjamin Przybocki, John Mackey, Marijn J. H. Heule, Bernardo Subercaseaux:
Doubly Saturated Ramsey Graphs: A Case Study in Computer-Assisted Mathematical Discovery. CoRR abs/2604.21187 (2026) - [i7]Guilherme Vicentin de Toledo, Benjamin Przybocki, Yoni Zohar:
Bringing closure to theory combination properties. CoRR abs/2605.30762 (2026) - 2025
- [c3]Guilherme Vicentin de Toledo, Benjamin Przybocki, Yoni Zohar:
Being Polite Is Not Enough (and Other Limits of Theory Combination). CADE 2025: 17-34 - [c2]Benjamin Przybocki, Guilherme Vicentin de Toledo, Yoni Zohar:
Shininess, Strong Politeness, and Unicorns. FroCoS 2025: 135-152 - [i6]Benjamin Przybocki, Clark W. Barrett:
The termination of Nielsen transformations applied to word equations with length constraints. CoRR abs/2501.11789 (2025) - [i5]Guilherme Vicentin de Toledo, Benjamin Przybocki, Yoni Zohar:
Being polite is not enough (and other limits of theory combination). CoRR abs/2505.04870 (2025) - [i4]Benjamin Przybocki, Guilherme Vicentin de Toledo, Yoni Zohar:
Shininess, strong politeness, and unicorns. CoRR abs/2507.04445 (2025) - [i3]Andrew Krapivin, Benjamin Przybocki, Nicolás Sanhueza-Matamala, Bernardo Subercaseaux:
Optimal and Efficient Partite Decompositions of Hypergraphs. CoRR abs/2511.11855 (2025) - [i2]Benjamin Przybocki, Guilherme Vicentin de Toledo, Yoni Zohar:
Characterizing Sets of Theories That Can Be Disjointly Combined. CoRR abs/2511.17374 (2025) - 2024
- [j4]Judy Hsin-Hui Chiang, Anh Trong Nam Hoang, Matthew Kendall, Ryan Lynch, Son Nguyen, Benjamin Przybocki, Janabel Xia:
Bender-Knuth involutions on linear extensions of posets. Discret. Math. 347(9): 114068 (2024) - [c1]Benjamin Przybocki, Guilherme Vicentin de Toledo, Yoni Zohar, Clark W. Barrett:
The Nonexistence of Unicorns and Many-Sorted Löwenheim-Skolem Theorems. FM (1) 2024: 658-675 - [i1]Benjamin Przybocki, Guilherme Vicentin de Toledo, Yoni Zohar, Clark W. Barrett:
The nonexistence of unicorns and many-sorted Löwenheim-Skolem theorems. CoRR abs/2406.18912 (2024) - 2023
- [j3]Ethan Pesikoff, Benjamin Przybocki, Janabel Xia:
The Maximum Hook Length of $d$-Distinct Simultaneous Core Partitions. Electron. J. Comb. 30(3) (2023) - 2022
- [j2]Xiaoyu He, Yuzu Ido, Benjamin Przybocki:
Hat Guessing on Books and Windmills. Electron. J. Comb. 29(1) (2022) - [j1]Benjamin Przybocki:
Lengths of Irreducible and Delicate Words. Electron. J. Comb. 29(3) (2022)
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 2026-06-27 06:54 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:
