Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Joseph C. Culberson
@inproceedings{DBLP:conf/infocom/WangZHWXHC21, author = {Yang Wang and Yong Zhang and Xinxin Han and Pengfei Wang and Chengzhong Xu and Joseph Horton and Joseph C. Culberson}, title = {Cost-Driven Data Caching in the Cloud: An Algorithmic Approach}, booktitle = {40th {IEEE} Conference on Computer Communications, {INFOCOM} 2021, Vancouver, BC, Canada, May 10-13, 2021}, pages = {1--10}, publisher = {{IEEE}}, year = {2021}, url = {https://doi.org/10.1109/INFOCOM42981.2021.9488820}, doi = {10.1109/INFOCOM42981.2021.9488820}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/infocom/WangZHWXHC21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icpp/WangHFXCH17, author = {Yang Wang and Shuibing He and Xiaopeng Fan and Chengzhong Xu and Joseph C. Culberson and Joseph Horton}, title = {Data Caching in Next Generation Mobile Cloud Services, Online vs. Off-Line}, booktitle = {46th International Conference on Parallel Processing, {ICPP} 2017, Bristol, United Kingdom, August 14-17, 2017}, pages = {412--421}, publisher = {{IEEE} Computer Society}, year = {2017}, url = {https://doi.org/10.1109/ICPP.2017.50}, doi = {10.1109/ICPP.2017.50}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icpp/WangHFXCH17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1105-5443, author = {Joseph C. Culberson and Basil Vandegriend}, title = {The Gn,m Phase Transition is Not Hard for the Hamiltonian Cycle Problem}, journal = {CoRR}, volume = {abs/1105.5443}, year = {2011}, url = {http://arxiv.org/abs/1105.5443}, eprinttype = {arXiv}, eprint = {1105.5443}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1105-5443.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1106-4575, author = {Joseph C. Culberson and Yong Gao}, title = {An Analysis of Phase Transition in {NK} Landscapes}, journal = {CoRR}, volume = {abs/1106.4575}, year = {2011}, url = {http://arxiv.org/abs/1106.4575}, eprinttype = {arXiv}, eprint = {1106.4575}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1106-4575.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1110-2204, author = {Joseph C. Culberson and Yong Gao}, title = {Consistency and Random Constraint Satisfaction Models}, journal = {CoRR}, volume = {abs/1110.2204}, year = {2011}, url = {http://arxiv.org/abs/1110.2204}, eprinttype = {arXiv}, eprint = {1110.2204}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1110-2204.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1111-0067, author = {Fan Yang and Joseph C. Culberson and Robert Holte and Uzi Zahavi and Ariel Felner}, title = {A General Theory of Additive State Space Abstractions}, journal = {CoRR}, volume = {abs/1111.0067}, year = {2011}, url = {http://arxiv.org/abs/1111.0067}, eprinttype = {arXiv}, eprint = {1111.0067}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1111-0067.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/CaoCS09, author = {Yi Cao and Joseph C. Culberson and Lorna Stewart}, editor = {Rastislav Kr{\'{a}}lovic and Damian Niwinski}, title = {DP-Complete Problems Derived from Extremal NP-Complete Properties}, booktitle = {Mathematical Foundations of Computer Science 2009, 34th International Symposium, {MFCS} 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5734}, pages = {199--210}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-03816-7\_18}, doi = {10.1007/978-3-642-03816-7\_18}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/CaoCS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jair/YangCHZF08, author = {Fan Yang and Joseph C. Culberson and Robert Holte and Uzi Zahavi and Ariel Felner}, title = {A General Theory of Additive State Space Abstractions}, journal = {J. Artif. Intell. Res.}, volume = {32}, pages = {631--662}, year = {2008}, url = {https://doi.org/10.1613/jair.2486}, doi = {10.1613/JAIR.2486}, timestamp = {Mon, 21 Jan 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jair/YangCHZF08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jair/GaoC07, author = {Yong Gao and Joseph C. Culberson}, title = {Consistency and Random Constraint Satisfaction Models}, journal = {J. Artif. Intell. Res.}, volume = {28}, pages = {517--557}, year = {2007}, url = {https://doi.org/10.1613/jair.2155}, doi = {10.1613/JAIR.2155}, timestamp = {Mon, 21 Jan 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jair/GaoC07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sara/YangCH07, author = {Fan Yang and Joseph C. Culberson and Robert Holte}, editor = {Ian Miguel and Wheeler Ruml}, title = {Using Infeasibility to Improve Abstraction-Based Heuristics}, booktitle = {Abstraction, Reformulation, and Approximation, 7th International Symposium, {SARA} 2007, Whistler, Canada, July 18-21, 2007, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4612}, pages = {413--414}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-73580-9\_41}, doi = {10.1007/978-3-540-73580-9\_41}, timestamp = {Tue, 14 May 2019 10:00:38 +0200}, biburl = {https://dblp.org/rec/conf/sara/YangCH07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/BeachamC05, author = {Adam Beacham and Joseph C. Culberson}, title = {On the complexity of unfrozen problems}, journal = {Discret. Appl. Math.}, volume = {153}, number = {1-3}, pages = {3--24}, year = {2005}, url = {https://doi.org/10.1016/j.dam.2005.05.003}, doi = {10.1016/J.DAM.2005.05.003}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/BeachamC05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/BeameCMM05, author = {Paul Beame and Joseph C. Culberson and David G. Mitchell and Cristopher Moore}, title = {The resolution complexity of random graph \emph{k}-colorability}, journal = {Discret. Appl. Math.}, volume = {153}, number = {1-3}, pages = {25--47}, year = {2005}, url = {https://doi.org/10.1016/j.dam.2005.05.004}, doi = {10.1016/J.DAM.2005.05.004}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/BeameCMM05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/GaoC05, author = {Yong Gao and Joseph C. Culberson}, title = {Resolution complexity of random constraint satisfaction problems: Another half of the story}, journal = {Discret. Appl. Math.}, volume = {153}, number = {1-3}, pages = {124--140}, year = {2005}, url = {https://doi.org/10.1016/j.dam.2005.05.009}, doi = {10.1016/J.DAM.2005.05.009}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/GaoC05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmtcs/AbbasCS05, author = {Nesrine Abbas and Joseph C. Culberson and Lorna Stewart}, title = {Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-complete}, journal = {Discret. Math. Theor. Comput. Sci.}, volume = {7}, number = {1}, pages = {141--154}, year = {2005}, url = {https://doi.org/10.46298/dmtcs.345}, doi = {10.46298/DMTCS.345}, timestamp = {Tue, 24 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dmtcs/AbbasCS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ec/GaoC05, author = {Yong Gao and Joseph C. Culberson}, title = {Space Complexity of Estimation of Distribution Algorithms}, journal = {Evol. Comput.}, volume = {13}, number = {1}, pages = {125--143}, year = {2005}, url = {https://doi.org/10.1162/1063656053583423}, doi = {10.1162/1063656053583423}, timestamp = {Fri, 13 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ec/GaoC05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ijcai/CulbersonGA05, author = {Joseph C. Culberson and Yong Gao and Calin Anton}, editor = {Leslie Pack Kaelbling and Alessandro Saffiotti}, title = {Phase Transitions of Dominating Clique Problem and Their Implications to Heuristics in Satisfiability Search}, booktitle = {IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30 - August 5, 2005}, pages = {78--83}, publisher = {Professional Book Center}, year = {2005}, url = {http://ijcai.org/Proceedings/05/Papers/1308.pdf}, timestamp = {Tue, 20 Aug 2019 16:16:29 +0200}, biburl = {https://dblp.org/rec/conf/ijcai/CulbersonGA05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cp/GaoC04, author = {Yong Gao and Joseph C. Culberson}, editor = {Mark Wallace}, title = {Consistency and Random Constraint Satisfaction Models with a High Constraint Tightness}, booktitle = {Principles and Practice of Constraint Programming - {CP} 2004, 10th International Conference, {CP} 2004, Toronto, Canada, September 27 - October 1, 2004, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3258}, pages = {17--31}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30201-8\_5}, doi = {10.1007/978-3-540-30201-8\_5}, timestamp = {Fri, 27 Mar 2020 09:00:36 +0100}, biburl = {https://dblp.org/rec/conf/cp/GaoC04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR04-012, author = {Paul Beame and Joseph C. Culberson and David G. Mitchell and Cristopher Moore}, title = {The Resolution Complexity of Random Graph k-Colorability}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR04-012}}, year = {2004}, url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-012/index.html}, eprinttype = {ECCC}, eprint = {TR04-012}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-012.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/GaoC03, author = {Yong Gao and Joseph C. Culberson}, title = {Resolution Complexity of Random Constraint Satisfaction Problems: Another Half of the Story}, journal = {Electron. Notes Discret. Math.}, volume = {16}, pages = {15--20}, year = {2003}, url = {https://doi.org/10.1016/S1571-0653(04)00460-3}, doi = {10.1016/S1571-0653(04)00460-3}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/GaoC03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/gecco/GaoC03, author = {Yong Gao and Joseph C. Culberson}, editor = {Erick Cant{\'{u}}{-}Paz and James A. Foster and Kalyanmoy Deb and Lawrence Davis and Rajkumar Roy and Una{-}May O'Reilly and Hans{-}Georg Beyer and Russell K. Standish and Graham Kendall and Stewart W. Wilson and Mark Harman and Joachim Wegener and Dipankar Dasgupta and Mitchell A. Potter and Alan C. Schultz and Kathryn A. Dowsland and Natasa Jonoska and Julian F. Miller}, title = {On the Treewidth of {NK} Landscapes}, booktitle = {Genetic and Evolutionary Computation - {GECCO} 2003, Genetic and Evolutionary Computation Conference, Chicago, IL, USA, July 12-16, 2003. Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {2723}, pages = {948--954}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/3-540-45105-6\_106}, doi = {10.1007/3-540-45105-6\_106}, timestamp = {Tue, 14 May 2019 10:00:35 +0200}, biburl = {https://dblp.org/rec/conf/gecco/GaoC03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jair/GaoC02, author = {Yong Gao and Joseph C. Culberson}, title = {An Analysis of Phase Transition in {NK} Landscapes}, journal = {J. Artif. Intell. Res.}, volume = {17}, pages = {309--332}, year = {2002}, url = {https://doi.org/10.1613/jair.1081}, doi = {10.1613/JAIR.1081}, timestamp = {Mon, 21 Jan 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jair/GaoC02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CulbersonG01, author = {Joseph C. Culberson and Ian P. Gent}, title = {Frozen development in graph coloring}, journal = {Theor. Comput. Sci.}, volume = {265}, number = {1-2}, pages = {227--264}, year = {2001}, url = {https://doi.org/10.1016/S0304-3975(01)00164-5}, doi = {10.1016/S0304-3975(01)00164-5}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CulbersonG01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ci/CulbersonS98, author = {Joseph C. Culberson and Jonathan Schaeffer}, title = {Pattern Databases}, journal = {Comput. Intell.}, volume = {14}, number = {3}, pages = {318--334}, year = {1998}, url = {https://doi.org/10.1111/0824-7935.00065}, doi = {10.1111/0824-7935.00065}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ci/CulbersonS98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ec/Culberson98, author = {Joseph C. Culberson}, title = {On the Futility of Blind Search: An Algorithmic View of "No Free Lunch"}, journal = {Evol. Comput.}, volume = {6}, number = {2}, pages = {109--127}, year = {1998}, url = {https://doi.org/10.1162/evco.1998.6.2.109}, doi = {10.1162/EVCO.1998.6.2.109}, timestamp = {Fri, 13 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ec/Culberson98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jair/VandegriendC98, author = {Basil Vandegriend and Joseph C. Culberson}, title = {The Gn, m Phase Transition is Not Hard for the Hamiltonian Cycle Problem}, journal = {J. Artif. Intell. Res.}, volume = {9}, pages = {219--245}, year = {1998}, url = {https://doi.org/10.1613/jair.512}, doi = {10.1613/JAIR.512}, timestamp = {Mon, 21 Jan 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jair/VandegriendC98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ai/CulbersonS96, author = {Joseph C. Culberson and Jonathan Schaeffer}, editor = {Gordon I. McCalla}, title = {Searching with Pattern Databases}, booktitle = {Advances in Artificial Intelligence, 11th Biennial Conference of the Canadian Society for Computational Studies of Intelligence, {AI} '96, Toronto, Ontario, Canada, May 21-24, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1081}, pages = {402--416}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-61291-2\_68}, doi = {10.1007/3-540-61291-2\_68}, timestamp = {Thu, 28 Sep 2023 12:27:06 +0200}, biburl = {https://dblp.org/rec/conf/ai/CulbersonS96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/foga/CulbersonL96, author = {Joseph C. Culberson and Jonathan Lichtner}, editor = {Richard K. Belew and Michael D. Vose}, title = {On Searching {\textbackslash}alpha-ary Hypercubes and Related Graphs}, booktitle = {Proceedings of the 4th Workshop on Foundations of Genetic Algorithms. San Diego, CA, USA, August 5 1996}, pages = {263--290}, publisher = {Morgan Kaufmann}, year = {1996}, timestamp = {Mon, 02 Jun 2003 08:31:01 +0200}, biburl = {https://dblp.org/rec/conf/foga/CulbersonL96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/ElmallahC95, author = {Ehab S. Elmallah and Joseph C. Culberson}, title = {Multicommodity flows in simple multistage networks}, journal = {Networks}, volume = {25}, number = {1}, pages = {19--30}, year = {1995}, url = {https://doi.org/10.1002/net.3230250104}, doi = {10.1002/NET.3230250104}, timestamp = {Sat, 01 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/networks/ElmallahC95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ec/Culberson94, author = {Joseph C. Culberson}, title = {Mutation-Crossover Isomorphisms and the Construction of Discriminating Functions}, journal = {Evol. Comput.}, volume = {2}, number = {3}, pages = {279--311}, year = {1994}, url = {https://doi.org/10.1162/evco.1994.2.3.279}, doi = {10.1162/EVCO.1994.2.3.279}, timestamp = {Fri, 13 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ec/Culberson94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/CulbersonR94, author = {Joseph C. Culberson and Robert A. Reckhow}, title = {Covering Polygons Is Hard}, journal = {J. Algorithms}, volume = {17}, number = {1}, pages = {2--44}, year = {1994}, url = {https://doi.org/10.1006/jagm.1994.1025}, doi = {10.1006/JAGM.1994.1025}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/CulbersonR94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/Baeza-YatesCR93, author = {Ricardo A. Baeza{-}Yates and Joseph C. Culberson and Gregory J. E. Rawlins}, title = {Searching in the Plane}, journal = {Inf. Comput.}, volume = {106}, number = {2}, pages = {234--252}, year = {1993}, url = {https://doi.org/10.1006/inco.1993.1054}, doi = {10.1006/INCO.1993.1054}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/Baeza-YatesCR93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dimacs/BrockingtonC93, author = {Mark Brockington and Joseph C. Culberson}, editor = {David S. Johnson and Michael A. Trick}, title = {Camouflaging independent sets in quasi-random graphs}, booktitle = {Cliques, Coloring, and Satisfiability, Proceedings of a {DIMACS} Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993}, series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science}, volume = {26}, pages = {75--88}, publisher = {{DIMACS/AMS}}, year = {1993}, url = {https://doi.org/10.1090/dimacs/026/05}, doi = {10.1090/DIMACS/026/05}, timestamp = {Mon, 22 May 2023 16:07:35 +0200}, biburl = {https://dblp.org/rec/conf/dimacs/BrockingtonC93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dimacs/CulbersonL93, author = {Joseph C. Culberson and Feng Luo}, editor = {David S. Johnson and Michael A. Trick}, title = {Exploring the k-colorable landscape with Iterated Greedy}, booktitle = {Cliques, Coloring, and Satisfiability, Proceedings of a {DIMACS} Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993}, series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science}, volume = {26}, pages = {245--284}, publisher = {{DIMACS/AMS}}, year = {1993}, url = {https://doi.org/10.1090/dimacs/026/13}, doi = {10.1090/DIMACS/026/13}, timestamp = {Thu, 09 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/dimacs/CulbersonL93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icga/Culberson93, author = {Joseph C. Culberson}, editor = {Stephanie Forrest}, title = {Crossover versus Mutation: Fueling the Debate: {TGA} versus {GIGA}}, booktitle = {Proceedings of the 5th International Conference on Genetic Algorithms, Urbana-Champaign, IL, USA, June 1993}, pages = {632}, publisher = {Morgan Kaufmann}, year = {1993}, timestamp = {Wed, 04 Sep 2002 07:32:18 +0200}, biburl = {https://dblp.org/rec/conf/icga/Culberson93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ai/SchaefferCTKLS92, author = {Jonathan Schaeffer and Joseph C. Culberson and Norman Treloar and Brent Knight and Paul Lu and Duane Szafron}, title = {A World Championship Caliber Checkers Program}, journal = {Artif. Intell.}, volume = {53}, number = {2-3}, pages = {273--289}, year = {1992}, url = {https://doi.org/10.1016/0004-3702(92)90074-8}, doi = {10.1016/0004-3702(92)90074-8}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ai/SchaefferCTKLS92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/CulbersonM90, author = {Joseph C. Culberson and J. Ian Munro}, title = {Analysis of the Standard Deletion Algorithms in Exact Fit Domain Binary Search Trees}, journal = {Algorithmica}, volume = {5}, number = {3}, pages = {295--311}, year = {1990}, url = {https://doi.org/10.1007/BF01840390}, doi = {10.1007/BF01840390}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/CulbersonM90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cj/CulbersonM89, author = {Joseph C. Culberson and J. Ian Munro}, title = {Explaining the Behaviour of Binary Search Trees Under Prolonged Updates: {A} Model and Simulations}, journal = {Comput. J.}, volume = {32}, number = {1}, pages = {68--75}, year = {1989}, url = {https://doi.org/10.1093/comjnl/32.1.68}, doi = {10.1093/COMJNL/32.1.68}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cj/CulbersonM89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/CulbersonR89, author = {Joseph C. Culberson and Piotr Rudnicki}, title = {A Fast Algorithm for Constructing Trees from Distance Matrices}, journal = {Inf. Process. Lett.}, volume = {30}, number = {4}, pages = {215--220}, year = {1989}, url = {https://doi.org/10.1016/0020-0190(89)90216-0}, doi = {10.1016/0020-0190(89)90216-0}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/CulbersonR89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/CulbersonR89, author = {Joseph C. Culberson and Robert A. Reckhow}, title = {Orthogonally Convex Coverings of Orthogonal Polygons without Holes}, journal = {J. Comput. Syst. Sci.}, volume = {39}, number = {2}, pages = {166--204}, year = {1989}, url = {https://doi.org/10.1016/0022-0000(89)90043-3}, doi = {10.1016/0022-0000(89)90043-3}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/CulbersonR89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/CulbersonR88, author = {Joseph C. Culberson and Robert A. Reckhow}, title = {Covering Polygons Is Hard (Preliminary Abstract)}, booktitle = {29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988}, pages = {601--611}, publisher = {{IEEE} Computer Society}, year = {1988}, url = {https://doi.org/10.1109/SFCS.1988.21976}, doi = {10.1109/SFCS.1988.21976}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/CulbersonR88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/swat/Baeza-YatesCR88, author = {Ricardo A. Baeza{-}Yates and Joseph C. Culberson and Gregory J. E. Rawlins}, editor = {Rolf G. Karlsson and Andrzej Lingas}, title = {Searching with Uncertainty (Extended Abstract)}, booktitle = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad, Sweden, July 5-8, 1988, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {318}, pages = {176--189}, publisher = {Springer}, year = {1988}, url = {https://doi.org/10.1007/3-540-19487-8\_20}, doi = {10.1007/3-540-19487-8\_20}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/swat/Baeza-YatesCR88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/compgeom/ReckhowC87, author = {Robert A. Reckhow and Joseph C. Culberson}, editor = {D. Soule}, title = {Covering a Simple Orthogonal Polygon with a Minimum Number of Orthogonally Convex Polygons}, booktitle = {Proceedings of the Third Annual Symposium on Computational Geometry, Waterloo, Ontario, Canada, June 8-10, 1987}, pages = {268--277}, publisher = {{ACM}}, year = {1987}, url = {https://doi.org/10.1145/41958.41987}, doi = {10.1145/41958.41987}, timestamp = {Mon, 14 Jun 2021 16:25:05 +0200}, biburl = {https://dblp.org/rec/conf/compgeom/ReckhowC87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/compgeom/CulbersonR85, author = {Joseph C. Culberson and Gregory J. E. Rawlins}, editor = {Joseph O'Rourke}, title = {Turtlegons: generating simple polygons for sequences of angles}, booktitle = {Proceedings of the First Annual Symposium on Computational Geometry, Baltimore, Maryland, USA, June 5-7, 1985}, pages = {305--310}, publisher = {{ACM}}, year = {1985}, url = {https://doi.org/10.1145/323233.323272}, doi = {10.1145/323233.323272}, timestamp = {Wed, 16 Jun 2021 12:03:34 +0200}, biburl = {https://dblp.org/rec/conf/compgeom/CulbersonR85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Culberson85, author = {Joseph C. Culberson}, editor = {Robert Sedgewick}, title = {The Effect of Updates in Binary Search Trees}, booktitle = {Proceedings of the 17th Annual {ACM} Symposium on Theory of Computing, May 6-8, 1985, Providence, Rhode Island, {USA}}, pages = {205--212}, publisher = {{ACM}}, year = {1985}, url = {https://doi.org/10.1145/22145.22168}, doi = {10.1145/22145.22168}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Culberson85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.