The SCEAS System
Navigation Menu

Search the dblp DataBase


Stefan Edelkamp: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Stefan Edelkamp, Shahid Jabbar
    Cost-Optimal External Planning. [Citation Graph (0, 0)][DBLP]
    AAAI, 2006, pp:- [Conf]
  2. Stefan Edelkamp, Shahid Jabbar, Alberto Lluch-Lafuente
    Cost-Algebraic Heuristic Search. [Citation Graph (0, 0)][DBLP]
    AAAI, 2005, pp:1362-1367 [Conf]
  3. Stefan Edelkamp, Richard E. Korf
    The Branching Factor of Regular Search Spaces. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 1998, pp:299-304 [Conf]
  4. Stefan Edelkamp, Stefan Schrödl
    Localizing A*. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 2000, pp:885-890 [Conf]
  5. Stefan Edelkamp
    Symbolic Pattern Databases in Heuristic Search Planning. [Citation Graph (0, 0)][DBLP]
    AIPS, 2002, pp:274-283 [Conf]
  6. Stefan Edelkamp
    Mixed Propositional and Numeric Planning in the Model Checking Integrated Planning System. [Citation Graph (0, 0)][DBLP]
    AIPS Workshop on Planning for Temporal Domains, 2002, pp:47-55 [Conf]
  7. Stefan Edelkamp
    External Symbolic Heuristic Search with Pattern Databases. [Citation Graph (0, 0)][DBLP]
    ICAPS, 2005, pp:51-60 [Conf]
  8. Stefan Edelkamp, Stefan Schrödl
    Route Planning and Map Inference with Global Positioning Traces. [Citation Graph (0, 0)][DBLP]
    Computer Science in Perspective, 2003, pp:128-151 [Conf]
  9. Stefan Edelkamp
    Memory Limitations in Artificial Intelligence. [Citation Graph (0, 0)][DBLP]
    Algorithms for Memory Hierarchies, 2002, pp:233-250 [Conf]
  10. Stefan Edelkamp
    Cost-Optimal Symbolic Planning with State Trajectory and Preference Constraints. [Citation Graph (0, 0)][DBLP]
    ECAI, 2006, pp:841-842 [Conf]
  11. Stefan Edelkamp
    Updating Shortest Paths. [Citation Graph (0, 0)][DBLP]
    ECAI, 1998, pp:655-559 [Conf]
  12. Stefan Edelkamp, Malte Helmert
    Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length. [Citation Graph (0, 0)][DBLP]
    ECP, 1999, pp:135-147 [Conf]
  13. Frank Reffel, Stefan Edelkamp
    Error Detection with Directed Symbolic Model Checking. [Citation Graph (0, 0)][DBLP]
    World Congress on Formal Methods, 1999, pp:195-211 [Conf]
  14. Stefan Edelkamp, Shahid Jabbar, Alberto Lluch-Lafuente
    Heuristic Search for the Analysis of Graph Transition Systems. [Citation Graph (0, 0)][DBLP]
    ICGT, 2006, pp:414-429 [Conf]
  15. Stefan Edelkamp
    Prediction of Regular Search Tree Growth by Spectral Analysis. [Citation Graph (0, 0)][DBLP]
    KI/ÖGAI, 2001, pp:154-168 [Conf]
  16. Stefan Edelkamp
    Generalizing the Relaxed Planning Heuristic to Non-linear Tasks. [Citation Graph (0, 0)][DBLP]
    KI, 2004, pp:198-212 [Conf]
  17. Stefan Edelkamp
    Suffix Tree Automata in State Space Search. [Citation Graph (0, 0)][DBLP]
    KI, 1997, pp:381-384 [Conf]
  18. Stefan Edelkamp, Shahid Jabbar, Stefan Schrödl
    External A*. [Citation Graph (0, 0)][DBLP]
    KI, 2004, pp:226-240 [Conf]
  19. Stefan Edelkamp, Ulrich Meyer
    Theory and Practice of Time-Space Trade-Offs in Memory Limited Search. [Citation Graph (0, 0)][DBLP]
    KI/ÖGAI, 2001, pp:169-184 [Conf]
  20. Stefan Edelkamp, Frank Reffel
    OBDDs in Heuristic Search. [Citation Graph (0, 0)][DBLP]
    KI, 1998, pp:81-92 [Conf]
  21. Falk Hüffner, Stefan Edelkamp, Henning Fernau, Rolf Niedermeier
    Finding Optimal Solutions to Atomix. [Citation Graph (0, 0)][DBLP]
    KI/ÖGAI, 2001, pp:229-243 [Conf]
  22. Stefan Schrödl, Stefan Edelkamp
    Inferring Flow of Control in Program Synthesis by Example. [Citation Graph (0, 0)][DBLP]
    KI, 1999, pp:171-182 [Conf]
  23. Stefan Edelkamp, Peter Leven
    Directed Automated Theorem Proving. [Citation Graph (0, 0)][DBLP]
    LPAR, 2002, pp:145-159 [Conf]
  24. Stefan Edelkamp
    Heuristic Search Planning with BDDs. [Citation Graph (0, 0)][DBLP]
    PuK, 2000, pp:- [Conf]
  25. Stefan Edelkamp
    Taming Numbers and Durations in the Model Checking Integrated Planning System. [Citation Graph (0, 0)][DBLP]
    PuK, 2002, pp:- [Conf]
  26. Stefan Edelkamp, Shahid Jabbar, Thomas Willhalm
    Accelerating Heuristic Search in Spatial Domains. [Citation Graph (0, 0)][DBLP]
    PuK, 2003, pp:- [Conf]
  27. Peter Leven, Tilman Mehler, Stefan Edelkamp
    Directed Error Detection in C++ with the Assembly-Level Model Checker StEAM. [Citation Graph (0, 0)][DBLP]
    SPIN, 2004, pp:39-56 [Conf]
  28. Alberto Lluch-Lafuente, Stefan Edelkamp, Stefan Leue
    Partial Order Reduction in Directed Model Checking. [Citation Graph (0, 0)][DBLP]
    SPIN, 2002, pp:112-127 [Conf]
  29. Stefan Edelkamp
    Promela Planning. [Citation Graph (0, 0)][DBLP]
    SPIN, 2003, pp:197-212 [Conf]
  30. Stefan Edelkamp, Shahid Jabbar
    Large-Scale Directed Model Checking LTL. [Citation Graph (0, 0)][DBLP]
    SPIN, 2006, pp:1-18 [Conf]
  31. Stefan Edelkamp, Alberto Lluch-Lafuente, Stefan Leue
    Directed Explicit Model Checking with HSF-SPIN. [Citation Graph (0, 0)][DBLP]
    SPIN, 2001, pp:57-79 [Conf]
  32. Stefan Edelkamp, Ingo Wegener
    On the Performance of WEAK-HEAPSORT. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:254-266 [Conf]
  33. Shahid Jabbar, Stefan Edelkamp
    I/O Efficient Directed Model Checking. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2005, pp:313-329 [Conf]
  34. Shahid Jabbar, Stefan Edelkamp
    Parallel External Directed Model Checking with Linear I/O. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2006, pp:237-251 [Conf]
  35. Stefan Edelkamp, Patrick Stiegeler
    Pushing the Limits in Sequential Sorting. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 2000, pp:39-50 [Conf]
  36. 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]
  37. Stefan Edelkamp, Malte Helmert
    MIPS: The Model-Checking Integrated Planning System. [Citation Graph (0, 0)][DBLP]
    AI Magazine, 2001, v:22, n:3, pp:67-72 [Journal]
  38. Stefan Edelkamp, Shahid Jabbar
    Action Planning for Directed Model Checking of Petri Nets. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:149, n:2, pp:3-18 [Journal]
  39. Stefan Edelkamp, Alberto Lluch-Lafuente, Stefan Leue
    Trail-directed model checking. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:55, n:3, pp:- [Journal]
  40. Tilman Mehler, Stefan Edelkamp
    Dynamic Incremental Hashing in Program Model Checking. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:149, n:2, pp:51-69 [Journal]
  41. Stefan Edelkamp
    Taming Numbers and Durations in the Model Checking Integrated Planning System. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 2003, v:20, n:, pp:195-238 [Journal]
  42. Stefan Edelkamp, Patrick Stiegeler
    Implementing HEAPSORT with (n logn - 0.9n) and QUICKSORT with (n logn + 0.2n) Comparisons. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2002, v:7, n:, pp:5- [Journal]
  43. Stefan Edelkamp
    Datenstrukturen und Lernverfahren in der Zustandsraumsuche. [Citation Graph (0, 0)][DBLP]
    KI, 1999, v:13, n:3, pp:49-51 [Journal]
  44. Stefan Edelkamp, Stefan Leue, Alberto Lluch-Lafuente
    Directed explicit-state model checking in the validation of communication protocols. [Citation Graph (0, 0)][DBLP]
    STTT, 2004, v:5, n:2-3, pp:247-267 [Journal]
  45. Stefan Edelkamp, Stefan Leue, Alberto Lluch-Lafuente
    Partial-order reduction and trail improvement in directed model checking. [Citation Graph (0, 0)][DBLP]
    STTT, 2004, v:6, n:4, pp:277-301 [Journal]
  46. Stefan Edelkamp
    On the Compilation of Plan Constraints and Preferences. [Citation Graph (0, 0)][DBLP]
    ICAPS, 2006, pp:374-377 [Conf]
  47. Stefan Edelkamp, Peter Kissmann
    Externalizing the Multiple Sequence Alignment Problem with Affine Gap Costs. [Citation Graph (0, 0)][DBLP]
    KI, 2007, pp:444-447 [Conf]
  48. Kenneth Kahl, Stefan Edelkamp, Lars Hildebrand
    Learning How to Play Hex. [Citation Graph (0, 0)][DBLP]
    KI, 2007, pp:382-396 [Conf]
  49. Stefan Edelkamp
    Automated Creation of Pattern Database Search Heuristics. [Citation Graph (0, 0)][DBLP]
    MoChArt, 2006, pp:35-50 [Conf]
  50. Stefan Edelkamp, Shahid Jabbar
    Real-Time Model Checking on Secondary Storage. [Citation Graph (0, 0)][DBLP]
    MoChArt, 2006, pp:67-83 [Conf]
  51. Jörg Hoffmann, Stefan Edelkamp
    The Deterministic Part of IPC-4: An Overview. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 2005, v:24, n:, pp:519-579 [Journal]
  52. Jörg Hoffmann, Stefan Edelkamp, Sylvie Thiébaux, Roman Englert, Frederico dos S. Liporace, Sebastian Trüg
    Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 2006, v:26, n:, pp:453-541 [Journal]

  53. Optimal Metric Planning with State Sets in Automata Representation. [Citation Graph (, )][DBLP]

  54. Limits and Possibilities of BDDs in State Space Search. [Citation Graph (, )][DBLP]

  55. External Memory Value Iteration. [Citation Graph (, )][DBLP]

  56. Perfect Hashing for State Space Exploration on the GPU. [Citation Graph (, )][DBLP]

  57. Semi-external LTL Model Checking. [Citation Graph (, )][DBLP]

  58. 06172 Abstracts Collection -- Directed Model Checking. [Citation Graph (, )][DBLP]

  59. 06172 Executive Summary -- Directed Model Checking. [Citation Graph (, )][DBLP]

  60. Symbolic Classification of General Multi-Player Games. [Citation Graph (, )][DBLP]

  61. Optimal Symbolic Planning with Action Costs and Preferences. [Citation Graph (, )][DBLP]

  62. Symbolic Classification of General Two-Player Games. [Citation Graph (, )][DBLP]

  63. Limits and Possibilities of BDDs in State Space Search. [Citation Graph (, )][DBLP]

  64. Partial Symbolic Pattern Databases for Optimal Sequential Planning. [Citation Graph (, )][DBLP]

  65. Perfect Hashing for State Spaces in BDD Representation. [Citation Graph (, )][DBLP]

  66. Solving Fully-Observable Non-deterministic Planning Problems via Translation into a General Game. [Citation Graph (, )][DBLP]

  67. Strongly Solving Fox-and-Geese on Multi-core CPU. [Citation Graph (, )][DBLP]

  68. Instantiating General Games Using Prolog or Dependency Graphs. [Citation Graph (, )][DBLP]

  69. Flash-Efficient LTL Model Checking with Minimal Counterexamples. [Citation Graph (, )][DBLP]

  70. Efficient Probabilistic Model Checking on General Purpose Graphics Processors. [Citation Graph (, )][DBLP]

  71. Policy-Based Benchmarking of Weak Heaps and Their Relatives, . [Citation Graph (, )][DBLP]

  72. Survey on Directed Model Checking. [Citation Graph (, )][DBLP]

  73. Scaling Search with Pattern Databases. [Citation Graph (, )][DBLP]

  74. Solving µ-Calculus Parity Games by Symbolic Planning. [Citation Graph (, )][DBLP]

  75. Can Flash Memory Help in Model Checking? [Citation Graph (, )][DBLP]

  76. Distributed Verification of Multi-threaded C++ Programs. [Citation Graph (, )][DBLP]

Search in 0.006secs, Finished in 0.008secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002