The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Richard E. Korf: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jens Christensen, Richard E. Korf
    A Unified Theory of Heuristic Evaluation Functions and its Application to Learning. [Citation Graph (1, 0)][DBLP]
    AAAI, 1986, pp:148-152 [Conf]
  2. Richard E. Korf
    A Program That Learns to Solve Rubik's Cube. [Citation Graph (1, 0)][DBLP]
    AAAI, 1982, pp:164-167 [Conf]
  3. Richard E. Korf
    Depth-First Iterative-Deepening: An Optimal Admissible Tree Search. [Citation Graph (1, 0)][DBLP]
    Artif. Intell., 1985, v:27, n:1, pp:97-109 [Journal]
  4. Richard E. Korf
    Macro-Operators: A Weak Method for Learning. [Citation Graph (1, 0)][DBLP]
    Artif. Intell., 1985, v:26, n:1, pp:35-77 [Journal]
  5. Richard E. Korf
    Planning as Search: A Quantitative Approach. [Citation Graph (1, 0)][DBLP]
    Artif. Intell., 1987, v:33, n:1, pp:65-88 [Journal]
  6. Richard E. Korf
    Real-Time Heuristic Search. [Citation Graph (1, 0)][DBLP]
    Artif. Intell., 1990, v:42, n:2-3, pp:189-211 [Journal]
  7. Richard E. Korf
    Linear-Space Best-First Search. [Citation Graph (1, 0)][DBLP]
    Artif. Intell., 1993, v:62, n:1, pp:41-78 [Journal]
  8. Bruce Abramson, Richard E. Korf
    A Model of Two-Player Evaluation Functions. [Citation Graph (0, 0)][DBLP]
    AAAI, 1987, pp:90-94 [Conf]
  9. Stefan Edelkamp, Richard E. Korf
    The Branching Factor of Regular Search Spaces. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 1998, pp:299-304 [Conf]
  10. Ariel Felner, Ram Meshulam, Robert C. Holte, Richard E. Korf
    Compressing Pattern Databases. [Citation Graph (0, 0)][DBLP]
    AAAI, 2004, pp:638-643 [Conf]
  11. Chris Ferguson, Richard E. Korf
    Distributed Tree Search and Its Application to Alpha-Beta Pruning. [Citation Graph (0, 0)][DBLP]
    AAAI, 1988, pp:128-132 [Conf]
  12. Richard E. Korf
    Recent Progress in the Design and Analysis of Admissible Heuristic Functions. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 2000, pp:1165-1170 [Conf]
  13. Richard E. Korf
    A New Algorithm for Optimal Bin Packing. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 2002, pp:731-726 [Conf]
  14. Richard E. Korf
    Best-First Frontier Search with Delayed Duplicate Detection. [Citation Graph (0, 0)][DBLP]
    AAAI, 2004, pp:650-657 [Conf]
  15. Richard E. Korf
    Operator Decomposability: A New Type of Problem Structure. [Citation Graph (0, 0)][DBLP]
    AAAI, 1983, pp:206-209 [Conf]
  16. Richard E. Korf
    Real-Time Heuristic Search: First Results. [Citation Graph (0, 0)][DBLP]
    AAAI, 1987, pp:133-138 [Conf]
  17. Richard E. Korf
    Real-Tme Heuristic Search: New Results. [Citation Graph (0, 0)][DBLP]
    AAAI, 1988, pp:139-144 [Conf]
  18. Richard E. Korf
    Linear-Space Best-First Search: Summary of Results. [Citation Graph (0, 0)][DBLP]
    AAAI, 1992, pp:533-538 [Conf]
  19. Richard E. Korf
    Improved Limited Discrepancy Search. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, Vol. 1, 1996, pp:286-291 [Conf]
  20. Richard E. Korf
    Finding Optimal Solutions to Rubik's Cube Using Pattern Databases. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 1997, pp:700-705 [Conf]
  21. Richard E. Korf
    Does Deep Blue use AI? [Citation Graph (0, 0)][DBLP]
    Deep Blue Versus Kasparov: The Significance for Artificial Intelligence, 1997, pp:1-2 [Conf]
  22. Richard E. Korf, David Maxwell Chickering
    Best-First Minimax Search: Othello Results. [Citation Graph (0, 0)][DBLP]
    AAAI, 1994, pp:1365-1370 [Conf]
  23. Richard E. Korf, Michael Reid
    Complexity Analysis of Admissible Heuristic Search. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 1998, pp:305-310 [Conf]
  24. Richard E. Korf, Peter Schultze
    Large-Scale Parallel Breadth-First Search. [Citation Graph (0, 0)][DBLP]
    AAAI, 2005, pp:1380-1385 [Conf]
  25. Richard E. Korf, Larry A. Taylor
    Finding Optimal Solutions to the Twenty-Four Puzzle. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, Vol. 2, 1996, pp:1202-1207 [Conf]
  26. Richard E. Korf, Weixiong Zhang
    Divide-and-Conquer Frontier Search Applied to Optimal Sequence Alignment. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 2000, pp:910-916 [Conf]
  27. Nathan R. Sturtevant, Richard E. Korf
    On Pruning Techniques for Multi-Player Games. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 2000, pp:201-207 [Conf]
  28. Larry A. Taylor, Richard E. Korf
    Pruning Duplicate Nodes in Depth-First Search. [Citation Graph (0, 0)][DBLP]
    AAAI, 1993, pp:756-761 [Conf]
  29. Nageshwara Rao Vempaty, Vipin Kumar, Richard E. Korf
    Depth-First Versus Best-First Search. [Citation Graph (0, 0)][DBLP]
    AAAI, 1991, pp:434-440 [Conf]
  30. Weixiong Zhang, Richard E. Korf
    Depth-First vs. Best-First Search: New Results. [Citation Graph (0, 0)][DBLP]
    AAAI, 1993, pp:769-775 [Conf]
  31. Weixiong Zhang, Richard E. Korf
    An Average-Case Analysis of Branch-and-Bound with Applications: Summary of Results. [Citation Graph (0, 0)][DBLP]
    AAAI, 1992, pp:545-550 [Conf]
  32. Richard E. Korf
    Optimal Rectangle Packing: Initial Results. [Citation Graph (0, 0)][DBLP]
    ICAPS, 2003, pp:287-295 [Conf]
  33. Richard E. Korf
    Optimal Rectangle Packing: New Results. [Citation Graph (0, 0)][DBLP]
    ICAPS, 2004, pp:142-149 [Conf]
  34. Joseph C. Pemberton, Richard E. Korf
    Incremental Search Algorithms for Real-time Decision Making. [Citation Graph (0, 0)][DBLP]
    AIPS, 1994, pp:140-145 [Conf]
  35. Alex S. Fukunaga, Richard E. Korf
    Bin-Completion Algorithms for Multicontainer Packing and Covering Problems. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2005, pp:117-124 [Conf]
  36. Heath Hohwald, Ignacio Thayer, Richard E. Korf
    Comparing Best-First Search and Dynamic Programming for Optimal Multiple Sequence Alignment. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2003, pp:1239-1245 [Conf]
  37. Toru Ishida, Richard E. Korf
    Moving Target Search. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1991, pp:204-211 [Conf]
  38. Richard E. Korf
    An Improved Algorithm for Optimal Bin Packing. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2003, pp:1252-1258 [Conf]
  39. Richard E. Korf
    Delayed Duplicate Detection: Extended Abstract. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2003, pp:1539-1541 [Conf]
  40. Richard E. Korf
    Inversion of Applicative Programs. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1981, pp:1007-1009 [Conf]
  41. Richard E. Korf
    Iterative-Deepening-A*: An Optimal Admissible Tree Search. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1985, pp:1034-1036 [Conf]
  42. Richard E. Korf
    Generalized Game Trees. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1989, pp:328-333 [Conf]
  43. Richard E. Korf
    From Approximate to Optimal Solutions: A Case Study of Number Partitioning. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1995, pp:266-272 [Conf]
  44. Richard E. Korf
    A Divide and Conquer Bidirectional Search: First Results. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1999, pp:1184-1191 [Conf]
  45. Curt Powley, Richard E. Korf
    Single-Agent Parallel Window Search: A Summary of Results. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1989, pp:36-41 [Conf]
  46. Richard E. Korf, Ariel Felner
    Recent Progress in Heuristic Search: A Case Study of the Four-Peg Towers of Hanoi Problem. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:2324-2329 [Conf]
  47. Weixiong Zhang, Richard E. Korf
    Parallel Heap Operations on EREW PRAM: Summary of Results. [Citation Graph (0, 0)][DBLP]
    IPPS, 1992, pp:315-318 [Conf]
  48. Richard E. Korf
    Recent Progress in the Design and Analysis of Admissible Heuristic Functions. [Citation Graph (0, 0)][DBLP]
    SARA, 2000, pp:45-55 [Conf]
  49. Richard E. Korf
    Toward a Model of Representation Changes. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1980, v:14, n:1, pp:41-78 [Journal]
  50. Richard E. Korf
    Multi-Player Alpha-Beta Pruning. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1991, v:48, n:1, pp:99-111 [Journal]
  51. Richard E. Korf
    A Complete Anytime Algorithm for Number Partitioning. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1998, v:106, n:2, pp:181-203 [Journal]
  52. Richard E. Korf, David Maxwell Chickering
    Best-First Minimax Search. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1996, v:84, n:1-2, pp:299-337 [Journal]
  53. Richard E. Korf, Ariel Felner
    Disjoint pattern database heuristics. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2002, v:134, n:1-2, pp:9-22 [Journal]
  54. Richard E. Korf, Michael Reid, Stefan Edelkamp
    Time complexity of iterative-deepening-A*. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2001, v:129, n:1-2, pp:199-218 [Journal]
  55. Curt Powley, Chris Ferguson, Richard E. Korf
    Depth-First Heuristic Search on a SIMD Machine. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1993, v:60, n:2, pp:199-242 [Journal]
  56. Weixiong Zhang, Rina Dechter, Richard E. Korf
    Heuristic search in artificial intelligence. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2001, v:129, n:1-2, pp:1-4 [Journal]
  57. Weixiong Zhang, Richard E. Korf
    Performance of Linear-Space Search Algorithms. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1995, v:79, n:2, pp:241-292 [Journal]
  58. Weixiong Zhang, Richard E. Korf
    A Study of Complexity Transitions on the Asymmetric Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1996, v:81, n:1-2, pp:223-239 [Journal]
  59. Ariel Felner, Sarit Kraus, Richard E. Korf
    KBFS: K-Best-First Search. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2003, v:39, n:1-2, pp:19-39 [Journal]
  60. Richard E. Korf
    Space-Efficient Search Algorithms. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1995, v:27, n:3, pp:337-339 [Journal]
  61. Richard E. Korf
    Artificial Intelligence as information science. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1991, v:57, n:, pp:131-134 [Journal]
  62. Richard E. Korf, Weixiong Zhang, Ignacio Thayer, Heath Hohwald
    Frontier search. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2005, v:52, n:5, pp:715-748 [Journal]
  63. Ariel Felner, Richard E. Korf, Sarit Hanan
    Additive Pattern Database Heuristics. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 2004, v:22, n:, pp:279-318 [Journal]
  64. Weixiong Zhang, Richard E. Korf
    Parallel Heap Operations on an EREW PRAM. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1994, v:20, n:2, pp:248-255 [Journal]
  65. Toru Ishida, Richard E. Korf
    Moving-Target Search: A Real-Time Search for Changing Goals. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 1995, v:17, n:6, pp:609-619 [Journal]
  66. Curt Powley, Richard E. Korf
    Single-Agent Parallel Window Search. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 1991, v:13, n:5, pp:466-477 [Journal]
  67. Richard E. Korf
    Depth-Limited Search for Real-Time Problem Solving. [Citation Graph (0, 0)][DBLP]
    Real-Time Systems, 1990, v:2, n:1-2, pp:7-24 [Journal]
  68. Benjamin W. Wah, Thomas S. Huang, Aravind K. Joshi, Dan I. Moldovan, Yiannis Aloimonos, Ruzena Bajcsy, Dana H. Ballard, Doug DeGroot, Kenneth DeJong, 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 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. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Knowl. Data Eng., 1993, v:5, n:1, pp:138-154 [Journal]
  69. P. Alex Dow, Richard E. Korf
    Best-First Search for Treewidth. [Citation Graph (0, 0)][DBLP]
    AAAI, 2007, pp:1146-1151 [Conf]
  70. Richard E. Korf
    Analyzing the Performance of Pattern Database Heuristics. [Citation Graph (0, 0)][DBLP]
    AAAI, 2007, pp:1164-1170 [Conf]
  71. Alex S. Fukunaga, Richard E. Korf
    Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 2007, v:28, n:, pp:393-429 [Journal]

  72. Minimizing Disk I/O in Two-Bit Breadth-First Search. [Citation Graph (, )][DBLP]


  73. Independent Additive Heuristics Reduce Search Multiplicatively. [Citation Graph (, )][DBLP]


  74. Optimal Rectangle Packing on Non-Square Benchmarks. [Citation Graph (, )][DBLP]


  75. 1.6-Bit Pattern Databases. [Citation Graph (, )][DBLP]


  76. Multi-Way Number Partitioning. [Citation Graph (, )][DBLP]


  77. New Improvements in Optimal Rectangle Packing. [Citation Graph (, )][DBLP]


  78. Duplicate Avoidance in Depth-First Search with Applications to Treewidth. [Citation Graph (, )][DBLP]


  79. Parallel tree search on a SIMD machine. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.009secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002