default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoseph C. Culberson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c17]Yang Wang, Yong Zhang, Xinxin Han, Pengfei Wang, Chengzhong Xu
, Joseph Horton, Joseph C. Culberson:
Cost-Driven Data Caching in the Cloud: An Algorithmic Approach. INFOCOM 2021: 1-10
2010 – 2019
- 2017
- [c16]Yang Wang, Shuibing He, Xiaopeng Fan, Chengzhong Xu, Joseph C. Culberson, Joseph Horton:
Data Caching in Next Generation Mobile Cloud Services, Online vs. Off-Line. ICPP 2017: 412-421 - 2011
- [i5]Joseph C. Culberson, Basil Vandegriend:
The Gn,m Phase Transition is Not Hard for the Hamiltonian Cycle Problem. CoRR abs/1105.5443 (2011) - [i4]Joseph C. Culberson, Yong Gao:
An Analysis of Phase Transition in NK Landscapes. CoRR abs/1106.4575 (2011) - [i3]Joseph C. Culberson, Yong Gao:
Consistency and Random Constraint Satisfaction Models. CoRR abs/1110.2204 (2011) - [i2]Fan Yang, Joseph C. Culberson, Robert Holte, Uzi Zahavi, Ariel Felner:
A General Theory of Additive State Space Abstractions. CoRR abs/1111.0067 (2011)
2000 – 2009
- 2009
- [c15]Yi Cao, Joseph C. Culberson, Lorna Stewart:
DP-Complete Problems Derived from Extremal NP-Complete Properties. MFCS 2009: 199-210 - 2008
- [j22]Fan Yang, Joseph C. Culberson, Robert Holte, Uzi Zahavi, Ariel Felner:
A General Theory of Additive State Space Abstractions. J. Artif. Intell. Res. 32: 631-662 (2008) - 2007
- [j21]Yong Gao, Joseph C. Culberson:
Consistency and Random Constraint Satisfaction Models. J. Artif. Intell. Res. 28: 517-557 (2007) - [c14]Fan Yang, Joseph C. Culberson, Robert Holte:
Using Infeasibility to Improve Abstraction-Based Heuristics. SARA 2007: 413-414 - 2005
- [j20]Adam Beacham, Joseph C. Culberson:
On the complexity of unfrozen problems. Discret. Appl. Math. 153(1-3): 3-24 (2005) - [j19]Paul Beame, Joseph C. Culberson, David G. Mitchell, Cristopher Moore:
The resolution complexity of random graph k-colorability. Discret. Appl. Math. 153(1-3): 25-47 (2005) - [j18]Yong Gao, Joseph C. Culberson:
Resolution complexity of random constraint satisfaction problems: Another half of the story. Discret. Appl. Math. 153(1-3): 124-140 (2005) - [j17]Nesrine Abbas, Joseph C. Culberson, Lorna Stewart:
Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-complete. Discret. Math. Theor. Comput. Sci. 7(1): 141-154 (2005) - [j16]Yong Gao, Joseph C. Culberson:
Space Complexity of Estimation of Distribution Algorithms. Evol. Comput. 13(1): 125-143 (2005) - [c13]Joseph C. Culberson, Yong Gao, Calin Anton:
Phase Transitions of Dominating Clique Problem and Their Implications to Heuristics in Satisfiability Search. IJCAI 2005: 78-83 - 2004
- [c12]Yong Gao, Joseph C. Culberson:
Consistency and Random Constraint Satisfaction Models with a High Constraint Tightness. CP 2004: 17-31 - [i1]Paul Beame, Joseph C. Culberson, David G. Mitchell, Cristopher Moore:
The Resolution Complexity of Random Graph k-Colorability. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j15]Yong Gao, Joseph C. Culberson:
Resolution Complexity of Random Constraint Satisfaction Problems: Another Half of the Story. Electron. Notes Discret. Math. 16: 15-20 (2003) - [c11]Yong Gao, Joseph C. Culberson:
On the Treewidth of NK Landscapes. GECCO 2003: 948-954 - 2002
- [j14]Yong Gao, Joseph C. Culberson:
An Analysis of Phase Transition in NK Landscapes. J. Artif. Intell. Res. 17: 309-332 (2002) - 2001
- [j13]Joseph C. Culberson, Ian P. Gent:
Frozen development in graph coloring. Theor. Comput. Sci. 265(1-2): 227-264 (2001)
1990 – 1999
- 1998
- [j12]Joseph C. Culberson, Jonathan Schaeffer:
Pattern Databases. Comput. Intell. 14(3): 318-334 (1998) - [j11]Joseph C. Culberson:
On the Futility of Blind Search: An Algorithmic View of "No Free Lunch". Evol. Comput. 6(2): 109-127 (1998) - [j10]Basil Vandegriend, Joseph C. Culberson:
The Gn, m Phase Transition is Not Hard for the Hamiltonian Cycle Problem. J. Artif. Intell. Res. 9: 219-245 (1998) - 1996
- [c10]Joseph C. Culberson, Jonathan Schaeffer:
Searching with Pattern Databases. AI 1996: 402-416 - [c9]Joseph C. Culberson, Jonathan Lichtner:
On Searching \alpha-ary Hypercubes and Related Graphs. FOGA 1996: 263-290 - 1995
- [j9]Ehab S. Elmallah, Joseph C. Culberson:
Multicommodity flows in simple multistage networks. Networks 25(1): 19-30 (1995) - 1994
- [j8]Joseph C. Culberson:
Mutation-Crossover Isomorphisms and the Construction of Discriminating Functions. Evol. Comput. 2(3): 279-311 (1994) - [j7]Joseph C. Culberson, Robert A. Reckhow:
Covering Polygons Is Hard. J. Algorithms 17(1): 2-44 (1994) - 1993
- [j6]Ricardo A. Baeza-Yates, Joseph C. Culberson, Gregory J. E. Rawlins:
Searching in the Plane. Inf. Comput. 106(2): 234-252 (1993) - [c8]Mark Brockington, Joseph C. Culberson:
Camouflaging independent sets in quasi-random graphs. Cliques, Coloring, and Satisfiability 1993: 75-88 - [c7]Joseph C. Culberson, Feng Luo:
Exploring the k-colorable landscape with Iterated Greedy. Cliques, Coloring, and Satisfiability 1993: 245-284 - [c6]Joseph C. Culberson:
Crossover versus Mutation: Fueling the Debate: TGA versus GIGA. ICGA 1993: 632 - 1992
- [j5]Jonathan Schaeffer, Joseph C. Culberson, Norman Treloar, Brent Knight, Paul Lu, Duane Szafron:
A World Championship Caliber Checkers Program. Artif. Intell. 53(2-3): 273-289 (1992) - 1990
- [j4]Joseph C. Culberson, J. Ian Munro:
Analysis of the Standard Deletion Algorithms in Exact Fit Domain Binary Search Trees. Algorithmica 5(3): 295-311 (1990)
1980 – 1989
- 1989
- [j3]Joseph C. Culberson, J. Ian Munro:
Explaining the Behaviour of Binary Search Trees Under Prolonged Updates: A Model and Simulations. Comput. J. 32(1): 68-75 (1989) - [j2]Joseph C. Culberson, Piotr Rudnicki:
A Fast Algorithm for Constructing Trees from Distance Matrices. Inf. Process. Lett. 30(4): 215-220 (1989) - [j1]Joseph C. Culberson, Robert A. Reckhow:
Orthogonally Convex Coverings of Orthogonal Polygons without Holes. J. Comput. Syst. Sci. 39(2): 166-204 (1989) - 1988
- [c5]Joseph C. Culberson, Robert A. Reckhow:
Covering Polygons Is Hard (Preliminary Abstract). FOCS 1988: 601-611 - [c4]Ricardo A. Baeza-Yates, Joseph C. Culberson, Gregory J. E. Rawlins:
Searching with Uncertainty (Extended Abstract). SWAT 1988: 176-189 - 1987
- [c3]Robert A. Reckhow, Joseph C. Culberson:
Covering a Simple Orthogonal Polygon with a Minimum Number of Orthogonally Convex Polygons. SCG 1987: 268-277 - 1985
- [c2]Joseph C. Culberson, Gregory J. E. Rawlins:
Turtlegons: generating simple polygons for sequences of angles. SCG 1985: 305-310 - [c1]Joseph C. Culberson:
The Effect of Updates in Binary Search Trees. STOC 1985: 205-212
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-09-21 01:41 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:
