default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHenning Thomas
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2013
[b1]Henning Thomas:
Aspects of games on random graphs. ETH Zurich, Zürich, Switzerland, 2013
Journal Articles
- 2016
- [j10]Benjamin Doerr, Carola Doerr
, Reto Spöhel, Henning Thomas:
Playing Mastermind With Many Colors. J. ACM 63(5): 42:1-42:23 (2016) - 2013
- [j9]Konstantinos Panagiotou, Reto Spöhel, Angelika Steger, Henning Thomas:
Explosive Percolation in Erdős-Rényi-Like Random Graph Processes. Comb. Probab. Comput. 22(1): 133-145 (2013) - 2012
- [j8]Luca Gugelmann, Yury Person, Angelika Steger, Henning Thomas:
A randomized version of Ramsey's theorem. Random Struct. Algorithms 41(4): 488-505 (2012) - 2011
- [j7]Luca Gugelmann, Yury Person, Angelika Steger, Henning Thomas:
A Randomized Version of Ramsey's Theorem. Electron. Notes Discret. Math. 38: 431-436 (2011) - [j6]Konstantinos Panagiotou, Reto Spöhel, Angelika Steger, Henning Thomas:
Explosive Percolation in Erdős-Rényi-Like Random Graph Processes. Electron. Notes Discret. Math. 38: 699-704 (2011) - [j5]Torsten Mütze, Reto Spöhel, Henning Thomas:
Small subgraphs in random graphs and the power of multiple choices. J. Comb. Theory B 101(4): 237-268 (2011) - 2010
- [j4]Reto Spöhel, Angelika Steger, Henning Thomas:
Coloring the Edges of a Random Graph without a Monochromatic Giant Component. Electron. J. Comb. 17(1) (2010) - 2009
- [j3]Anupam Prakash, Reto Spöhel, Henning Thomas:
Balanced Online Ramsey Games in Random Graphs. Electron. J. Comb. 16(1) (2009) - [j2]Reto Spöhel, Angelika Steger, Henning Thomas:
Coloring the edges of a random graph without a monochromatic giant component. Electron. Notes Discret. Math. 34: 615-619 (2009) - 2008
- [j1]Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle, Henning Thomas:
Approximation Algorithms for 3D Orthogonal Knapsack. J. Comput. Sci. Technol. 23(5): 749-762 (2008)
Conference and Workshop Papers
- 2014
- [c4]Karl Bringmann, Fabian Kuhn, Konstantinos Panagiotou, Ueli Peter, Henning Thomas:
Internal DLA: Efficient Simulation of a Physical Growth Model - (Extended Abstract). ICALP (1) 2014: 247-258 - 2013
- [c3]Benjamin Doerr, Reto Spöhel, Henning Thomas, Carola Winzen:
Playing Mastermind with Many Colors. SODA 2013: 695-704 - 2012
- [c2]Benjamin Doerr, Reto Spöhel, Henning Thomas, Carola Winzen:
Playing Mastermind with Many Colors. CTW 2012: 108-111 - 2007
- [c1]Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle, Henning Thomas:
Approximation Algorithms for 3D Orthogonal Knapsack. TAMC 2007: 34-45
Informal and Other Publications
- 2012
- [i2]Benjamin Doerr, Reto Spöhel, Henning Thomas, Carola Winzen:
Playing Mastermind with Many Colors. CoRR abs/1207.0773 (2012) - 2011
- [i1]Konstantinos Panagiotou, Reto Spöhel, Angelika Steger, Henning Thomas:
Explosive Percolation in Erdös-Rényi-Like Random Graph Processes. CoRR abs/1104.1309 (2011)
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-09 13:15 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:
