default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRichard E. Korf
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j36]Richard E. Korf:
A Jeep Crossing a Desert of Unknown Width. Am. Math. Mon. 129(5): 435-444 (2022)- [c77]Zhaoxing Bu, Richard E. Korf:
A*+BFHS: A Hybrid Heuristic Search Algorithm. AAAI 2022: 10138-10145 - [c76]Zhaoxing Bu, Richard E. Korf:
Iterative-Deepening Uniform-Cost Heuristic Search. SOCS 2022: 20-28 - [c75]Richard E. Korf:
A Jeep Crossing a Desert of Unknown Width (Extended Abstract). SOCS 2022: 297-298 - 2021
- [c74]Richard E. Korf:
Finding the Exact Diameter of a Graph with Partial Breadth-First Searches. SOCS 2021: 73-78 - [i4]Zhaoxing Bu, Richard E. Korf:
A*+BFHS: A Hybrid Heuristic Search Algorithm. CoRR abs/2103.12701 (2021)
2010 – 2019
- 2019
- [c73]Zhaoxing Bu, Richard E. Korf:
A*+IDA*: A Simple Hybrid Search Algorithm. IJCAI 2019: 1206-1212 - 2018
- [j35]Ethan L. Schreiber, Richard E. Korf, Michael D. Moffitt:
Optimal Multi-Way Number Partitioning. J. ACM 65(4): 24:1-24:61 (2018) - 2016
- [c72]Richard E. Korf:
Comparing Search Algorithms Using Sorting and Hashing on Disk and in Memory. IJCAI 2016: 610-616 - 2015
- [c71]Joseph Kelly Barker, Richard E. Korf:
Limitations of Front-To-End Bidirectional Heuristic Search. AAAI 2015: 1086-1092 - 2014
- [j34]Daniel Borrajo
, Ariel Felner, Richard E. Korf, Maxim Likhachev, Carlos Linares López, Wheeler Ruml, Nathan R. Sturtevant:
The Fifth Annual Symposium on Combinatorial Search. AI Commun. 27(4): 327-328 (2014) - [c70]Ethan L. Schreiber, Richard E. Korf:
Cached Iterative Weakening for Optimal Multi-Way Number Partitioning. AAAI 2014: 2738-2745 - [c69]Richard E. Korf, Ethan L. Schreiber, Michael D. Moffitt:
Optimal Sequential Multi-Way Number Partitioning. ISAIM 2014 - [c68]Richard E. Korf:
How Do You Know Your Search Algorithm and Code Are Correct? SOCS 2014: 200-201 - [i3]Eric Huang, Richard E. Korf:
Optimal Rectangle Packing: An Absolute Placement Approach. CoRR abs/1402.0557 (2014) - 2013
- [j33]Eric Huang, Richard E. Korf:
Optimal Rectangle Packing: An Absolute Placement Approach. J. Artif. Intell. Res. 46: 47-87 (2013) - [c67]Richard E. Korf, Ethan L. Schreiber:
Optimally Scheduling Small Numbers of Identical Parallel Machines. ICAPS 2013 - [c66]Ethan L. Schreiber, Richard E. Korf:
Improved Bin Completion for Optimal Bin Packing and Number Partitioning. IJCAI 2013: 651-658 - 2012
- [c65]Joseph Kelly Barker, Richard E. Korf:
Solving Dots-And-Boxes. AAAI 2012: 414-419 - [c64]Joseph Kelly Barker, Richard E. Korf:
Solving Peg Solitaire with Bidirectional BFIDA. AAAI 2012: 420-426 - [c63]Richard E. Korf:
Research Challenges in Combinatorial Search. AAAI 2012: 2129-2133 - [e3]Daniel Borrajo, Ariel Felner, Richard E. Korf, Maxim Likhachev, Carlos Linares López, Wheeler Ruml, Nathan R. Sturtevant:
Proceedings of the Fifth Annual Symposium on Combinatorial Search, SOCS 2012, Niagara Falls, Ontario, Canada, July 19-21, 2012. AAAI Press 2012 [contents] - 2011
- [c62]Eric Huang, Richard E. Korf:
Optimal Packing of High-Precision Rectangles. AAAI 2011: 42-47 - [c61]Joseph Kelly Barker, Richard E. Korf:
Solving 4x5 Dots-And-Boxes. AAAI 2011: 1756-1757 - [c60]Ethan L. Schreiber, Richard E. Korf:
Using Partitions and Superstrings for Lossless Compression of Pattern Databases. AAAI 2011: 1814-1815 - [c59]Richard E. Korf:
A Hybrid Recursive Multi-Way Number Partitioning Algorithm. IJCAI 2011: 591-596 - [c58]Trevor Scott Standley, Richard E. Korf:
Complete Algorithms for Cooperative Pathfinding Problems. IJCAI 2011: 668-673 - [c57]Eric Huang, Richard E. Korf:
Optimal Packing of High-Precision Rectangles. SOCS 2011: 195-196 - [i2]Ariel Felner, Sarit Hanan, Richard E. Korf:
Additive Pattern Database Heuristics. CoRR abs/1107.0050 (2011) - [i1]Alex S. Fukunaga, Richard E. Korf:
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems. CoRR abs/1110.2209 (2011) - 2010
- [j32]Richard E. Korf, Michael D. Moffitt, Martha E. Pollack:
Optimal rectangle packing. Ann. Oper. Res. 179(1): 261-295 (2010) - [c56]Teresa Maria Breyer, Richard E. Korf:
Independent Additive Heuristics Reduce Search Multiplicatively. AAAI 2010: 33-38 - [c55]Teresa Maria Breyer, Richard E. Korf:
1.6-Bit Pattern Databases. AAAI 2010: 39-44 - [c54]Eric Huang, Richard E. Korf:
Optimal Rectangle Packing on Non-Square Benchmarks. AAAI 2010: 83-88 - [c53]Richard E. Korf:
Objective Functions for Multi-Way Number Partitioning. SOCS 2010: 71-72
2000 – 2009
- 2009
- [c52]P. Alex Dow, Richard E. Korf:
Duplicate Avoidance in Depth-First Search with Applications to Treewidth. IJCAI 2009: 480-485 - [c51]Eric Huang, Richard E. Korf:
New Improvements in Optimal Rectangle Packing. IJCAI 2009: 511-516 - [c50]Richard E. Korf:
Multi-Way Number Partitioning. IJCAI 2009: 538-543 - 2008
- [j31]Richard E. Korf:
Linear-time disk-based implicit graph search. J. ACM 55(6): 26:1-26:40 (2008) - [c49]Richard E. Korf:
Minimizing Disk I/O in Two-Bit Breadth-First Search. AAAI 2008: 317-324 - [c48]P. Alex Dow, Richard E. Korf:
Best-First Search with Maximum Edge Cost Functions. ISAIM 2008 - 2007
- [j30]Alex S. Fukunaga, Richard E. Korf:
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems. J. Artif. Intell. Res. 28: 393-429 (2007) - [j29]Ariel Felner, Richard E. Korf, Ram Meshulam, Robert C. Holte:
Compressed Pattern Databases. J. Artif. Intell. Res. 30: 213-247 (2007) - [c47]P. Alex Dow, Richard E. Korf:
Best-First Search for Treewidth. AAAI 2007: 1146-1151 - [c46]Richard E. Korf:
Analyzing the Performance of Pattern Database Heuristics. AAAI 2007: 1164-1170 - [c45]Richard E. Korf, Ariel Felner:
Recent Progress in Heuristic Search: A Case Study of the Four-Peg Towers of Hanoi Problem. IJCAI 2007: 2324-2329 - 2005
- [j28]Richard E. Korf, Weixiong Zhang, Ignacio Thayer, Heath Hohwald:
Frontier search. J. ACM 52(5): 715-748 (2005) - [c44]Richard E. Korf, Peter Schultze:
Large-Scale Parallel Breadth-First Search. AAAI 2005: 1380-1385 - [c43]Alex S. Fukunaga, Richard E. Korf:
Bin-Completion Algorithms for Multicontainer Packing and Covering Problems. IJCAI 2005: 117-124 - 2004
- [j27]Ariel Felner, Richard E. Korf, Sarit Hanan:
Additive Pattern Database Heuristics. J. Artif. Intell. Res. 22: 279-318 (2004) - [c42]Ariel Felner, Ram Meshulam, Robert C. Holte, Richard E. Korf:
Compressing Pattern Databases. AAAI 2004: 638-643 - [c41]Richard E. Korf:
Best-First Frontier Search with Delayed Duplicate Detection. AAAI 2004: 650-657 - [c40]Richard E. Korf:
Optimal Rectangle Packing: New Results. ICAPS 2004: 142-149 - 2003
- [j26]Ariel Felner, Sarit Kraus, Richard E. Korf:
KBFS: K-Best-First Search. Ann. Math. Artif. Intell. 39(1-2): 19-39 (2003) - [c39]Richard E. Korf:
Optimal Rectangle Packing: Initial Results. ICAPS 2003: 287-295 - [c38]Heath Hohwald, Ignacio Thayer, Richard E. Korf:
Comparing Best-First Search and Dynamic Programming for Optimal Multiple Sequence Alignment. IJCAI 2003: 1239-1245 - [c37]Richard E. Korf:
An Improved Algorithm for Optimal Bin Packing. IJCAI 2003: 1252-1258 - [c36]Richard E. Korf:
Delayed Duplicate Detection: Extended Abstract. IJCAI 2003: 1539-1541 - 2002
- [j25]Richard E. Korf, Ariel Felner:
Disjoint pattern database heuristics. Artif. Intell. 134(1-2): 9-22 (2002) - [c35]Richard E. Korf:
A New Algorithm for Optimal Bin Packing. AAAI/IAAI 2002: 731-736 - [p2]Richard E. Korf:
Search Techniques. Encyclopedia of Information Systems 2002: 31-43 - 2001
- [j24]Weixiong Zhang, Rina Dechter, Richard E. Korf:
Heuristic search in artificial intelligence. Artif. Intell. 129(1-2): 1-4 (2001) - [j23]Richard E. Korf, Michael Reid, Stefan Edelkamp:
Time complexity of iterative-deepening-A*. Artif. Intell. 129(1-2): 199-218 (2001) - 2000
- [c34]Nathan R. Sturtevant, Richard E. Korf:
On Pruning Techniques for Multi-Player Games. AAAI/IAAI 2000: 201-207 - [c33]Richard E. Korf, Weixiong Zhang:
Divide-and-Conquer Frontier Search Applied to Optimal Sequence Alignment. AAAI/IAAI 2000: 910-916 - [c32]Richard E. Korf:
Recent Progress in the Design and Analysis of Admissible Heuristic Functions. AAAI/IAAI 2000: 1165-1170 - [c31]Richard E. Korf:
Recent Progress in the Design and Analysis of Admissible Heuristic Functions. SARA 2000: 45-55
1990 – 1999
- 1999
- [c30]Richard E. Korf:
A Divide and Conquer Bidirectional Search: First Results. IJCAI 1999: 1184-1191 - [p1]Richard E. Korf:
Artificial Intelligence Search Algorithms. Algorithms and Theory of Computation Handbook 1999 - 1998
- [j22]Richard E. Korf:
A Complete Anytime Algorithm for Number Partitioning. Artif. Intell. 106(2): 181-203 (1998) - [c29]Stefan Edelkamp, Richard E. Korf:
The Branching Factor of Regular Search Spaces. AAAI/IAAI 1998: 299-304 - [c28]Richard E. Korf, Michael Reid:
Complexity Analysis of Admissible Heuristic Search. AAAI/IAAI 1998: 305-310 - 1997
- [j21]Richard E. Korf:
Does Deep Blue use Artificial Intelligence? J. Int. Comput. Games Assoc. 20(4): 243-245 (1997) - [c27]Richard E. Korf:
Does Deep Blue use AI? Deep Blue Versus Kasparov: The Significance for Artificial Intelligence 1997: 1-2 - [c26]Richard E. Korf:
Finding Optimal Solutions to Rubik's Cube Using Pattern Databases. AAAI/IAAI 1997: 700-705 - 1996
- [j20]Weixiong Zhang, Richard E. Korf:
A Study of Complexity Transitions on the Asymmetric Traveling Salesman Problem. Artif. Intell. 81(1-2): 223-239 (1996) - [j19]Richard E. Korf, David Maxwell Chickering:
Best-First Minimax Search. Artif. Intell. 84(1-2): 299-337 (1996) - [j18]Richard E. Korf, David Maxwell Chickering:
Best-First Minimax Search. J. Int. Comput. Games Assoc. 19(3): 187 (1996) - [c25]Richard E. Korf:
Improved Limited Discrepancy Search. AAAI/IAAI, Vol. 1 1996: 286-291 - [c24]Richard E. Korf, Larry A. Taylor:
Finding Optimal Solutions to the Twenty-Four Puzzle. AAAI/IAAI, Vol. 2 1996: 1202-1207 - 1995
- [j17]Weixiong Zhang, Richard E. Korf:
Performance of Linear-Space Search Algorithms. Artif. Intell. 79(2): 241-292 (1995) - [j16]Richard E. Korf:
Space-Efficient Search Algorithms. ACM Comput. Surv. 27(3): 337-339 (1995) - [j15]Richard E. Korf:
Heuristic evaluation functions in artificial intelligence search algorithms. Minds Mach. 5(4): 489-498 (1995) - [j14]Toru Ishida, Richard E. Korf:
Moving-Target Search: A Real-Time Search for Changing Goals. IEEE Trans. Pattern Anal. Mach. Intell. 17(6): 609-619 (1995) - [c23]Richard E. Korf:
From Approximate to Optimal Solutions: A Case Study of Number Partitioning. IJCAI 1995: 266-272 - 1994
- [j13]Weixiong Zhang, Richard E. Korf:
Parallel Heap Operations on an EREW PRAM. J. Parallel Distributed Comput. 20(2): 248-255 (1994) - [c22]Richard E. Korf, David Maxwell Chickering:
Best-First Minimax Search: Othello Results. AAAI 1994: 1365-1370 - [c21]Joseph C. Pemberton, Richard E. Korf:
Incremental Search Algorithms for Real-time Decision Making. AIPS 1994: 140-145 - [e2]Barbara Hayes-Roth, Richard E. Korf:
Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, WA, USA, July 31 - August 4, 1994, Volume 1. AAAI Press / The MIT Press 1994, ISBN 0-262-61102-3 [contents] - [e1]Barbara Hayes-Roth, Richard E. Korf:
Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, WA, USA, July 31 - August 4, 1994, Volume 2. AAAI Press / The MIT Press 1994 [contents] - 1993
- [j12]Curt Powley, Chris Ferguson, Richard E. Korf:
Depth-First Heuristic Search on a SIMD Machine. Artif. Intell. 60(2): 199-242 (1993) - [j11]Richard E. Korf:
Linear-Space Best-First Search. Artif. Intell. 62(1): 41-78 (1993) - [j10]Benjamin W. Wah, Thomas S. Huang, Aravind K. Joshi, Dan I. Moldovan, Yiannis Aloimonos, Ruzena Bajcsy, Dana H. Ballard, Doug DeGroot, Kenneth A. De Jong, Charles R. Dyer, Scott E. Fahlman, Ralph Grishman, Lynette Hirschman, Richard E. Korf, Stephen E. Levinson, Daniel P. Miranker, N. H. Morgan, Sergei Nirenburg, Tomaso A. Poggio, Edward M. Riseman, Craig Stanfil, Salvatore J. Stolfo, Steven L. Tanimoto, Charles C. Weems:
Report on Workshop on High Performance Computing and Communications for Grand Challenge Applications: Computer Vision, Speech and Natural Language Processing, and Artificial Intelligence. IEEE Trans. Knowl. Data Eng. 5(1): 138-154 (1993) - [c20]Larry A. Taylor, Richard E. Korf:
Pruning Duplicate Nodes in Depth-First Search. AAAI 1993: 756-761 - [c19]Weixiong Zhang, Richard E. Korf:
Depth-First vs. Best-First Search: New Results. AAAI 1993: 769-775 - 1992
- [c18]Richard E. Korf:
Linear-Space Best-First Search: Summary of Results. AAAI 1992: 533-538 - [c17]Weixiong Zhang, Richard E. Korf:
An Average-Case Analysis of Branch-and-Bound with Applications: Summary of Results. AAAI 1992: 545-550 - [c16]Weixiong Zhang, Richard E. Korf:
Parallel Heap Operations on EREW PRAM: Summary of Results. IPPS 1992: 315-318 - 1991
- [j9]Richard E. Korf:
Multi-Player Alpha-Beta Pruning. Artif. Intell. 48(1): 99-111 (1991) - [j8]Richard E. Korf:
Artificial Intelligence as information science. Inf. Sci. 57-58: 131-134 (1991) - [j7]Curt Powley, Richard E. Korf:
Single-Agent Parallel Window Search. IEEE Trans. Pattern Anal. Mach. Intell. 13(5): 466-477 (1991) - [c15]Nageshwara Rao Vempaty, Vipin Kumar, Richard E. Korf:
Depth-First Versus Best-First Search. AAAI 1991: 434-440 - [c14]Toru Ishida, Richard E. Korf:
Moving Target Search. IJCAI 1991: 204-211 - [c13]Curt Powley, Chris Ferguson, Richard E. Korf:
Parallel tree search on a SIMD machine. SPDP 1991: 249-256 - 1990
- [j6]Richard E. Korf:
Real-Time Heuristic Search. Artif. Intell. 42(2-3): 189-211 (1990) - [j5]Richard E. Korf:
Depth-Limited Search for Real-Time Problem Solving. Real Time Syst. 2(1-2): 7-24 (1990)
1980 – 1989
- 1989
- [c12]Curt Powley, Richard E. Korf:
Single-Agent Parallel Window Search: A Summary of Results. IJCAI 1989: 36-41 - [c11]Richard E. Korf:
Generalized Game Trees. IJCAI 1989: 328-333 - 1988
- [c10]Chris Ferguson, Richard E. Korf:
Distributed Tree Search and Its Application to Alpha-Beta Pruning. AAAI 1988: 128-132 - [c9]Richard E. Korf:
Real-Tme Heuristic Search: New Results. AAAI 1988: 139-144 - 1987
- [j4]Richard E. Korf:
Planning as Search: A Quantitative Approach. Artif. Intell. 33(1): 65-88 (1987) - [c8]Bruce Abramson, Richard E. Korf:
A Model of Two-Player Evaluation Functions. AAAI 1987: 90-94 - [c7]Richard E. Korf:
Real-Time Heuristic Search: First Results. AAAI 1987: 133-138 - 1986
- [c6]Jens Christensen, Richard E. Korf:
A Unified Theory of Heuristic Evaluation Functions and its Application to Learning. AAAI 1986: 148-152 - 1985
- [j3]Richard E. Korf:
Macro-Operators: A Weak Method for Learning. Artif. Intell. 26(1): 35-77 (1985) - [j2]Richard E. Korf:
Depth-First Iterative-Deepening: An Optimal Admissible Tree Search. Artif. Intell. 27(1): 97-109 (1985) - [c5]Richard E. Korf:
Iterative-Deepening-A*: An Optimal Admissible Tree Search. IJCAI 1985: 1034-1036 - 1983
- [c4]Richard E. Korf:
Operator Decomposability: A New Type of Problem Structure. AAAI 1983: 206-209 - [c3]Richard E. Korf:
A computer science syllabus for gifted pre-college students. SIGCSE 1983: 237-240 - 1982
- [c2]Richard E. Korf:
A Program That Learns to Solve Rubik's Cube. AAAI 1982: 164-167 - 1981
- [c1]Richard E. Korf:
Inversion of Applicative Programs. IJCAI 1981: 1007-1009 - 1980
- [j1]Richard E. Korf:
Toward a Model of Representation Changes. Artif. Intell. 14(1): 41-78 (1980)
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-04-25 05:51 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:
