Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Stefan Edelkamp
2010 – today
- 2013
[c88]Álvaro Torralba, Stefan Edelkamp, Peter Kissmann: Transition Trees for Cost-Optimal Symbolic Planning. ICAPS 2013- [c87]Stefan Edelkamp, Max Gath: Optimal Decision Making in Agent-based Autonomous Groupage Traffic. ICAART (1) 2013: 248-254
- [c86]Christoph Greulich, Stefan Edelkamp, Max Gath, Tobias Warden, Malte Humann, Otthein Herzog, T. G. Sitharam: Enhanced Shortest Path Computation for Multiagent-based Intermodal Transport Planning in Dynamic Environments. ICAART (2) 2013: 324-329
- [c85]Christoph Greulich, Stefan Edelkamp, Max Gath: Agent-Based Multimodal Transport Planning in Dynamic Environments. KI 2013: 74-85
- [c84]Carsten Elfers, Stefan Edelkamp, Hartmut Messerschmidt: Combining Conditional Random Fields and Background Knowledge for Improved Cyber Security. KI 2013: 284-287
- [i5]Stefan Edelkamp, Armin Weiß: QuickXsort: Efficient Sorting with n log n - 1.399n +o(n) Comparisons on Average. CoRR abs/1307.3033 (2013)
- 2012
- [b2]Stefan Edelkamp, Stefan Schrödl: Heuristic Search - Theory and Applications. Academic Press 2012, ISBN 978-0-12-372512-7, pp. I_XXIV, 1-836
- [j24]Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen: The weak-heap data structure: Variants and applications. J. Discrete Algorithms 16: 187-205 (2012)
- [c83]Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen: The Weak-Heap Family of Priority Queues in Theory and Praxis. CATS 2012: 103-112
- [c82]Stefan Edelkamp, Peter Kissmann, Álvaro Torralba: Symbolic A* Search with Pattern Databases and the Merge-and-Shrink Abstraction. ECAI 2012: 306-311
- [c81]Carsten Elfers, Stefan Edelkamp, Otthein Herzog: Efficient Tolerant Pattern Matching with Constraint Abstractions in Description Logic. ICAART (1) 2012: 256-261
- [c80]Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen: A Catalogue of Algorithms for Building Weak Heaps. IWOCA 2012: 249-262
- [c79]Stefan Edelkamp, Tim Federholzner, Peter Kissmann: Searching with Partial Belief States in General Games with Incomplete Information. KI 2012: 25-36
- [c78]
- [c77]Jingsen Chen, Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen: In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses. MFCS 2012: 259-270
- [c76]Stefan Edelkamp, Martin Stommel: The Bitvector Machine: A Fast and Robust Machine Learning Algorithm for Non-linear Problems. ECML/PKDD (1) 2012: 175-190
- [c75]Stefan Edelkamp, Peter Kissmann, Álvaro Torralba: Lex-Partitioning: A New Option for BDD Search. GRAPHITE 2012: 66-82
- [e6]Anton Wijs, Dragan Bosnacki, Stefan Edelkamp (Eds.): Proceedings First Workshop on GRAPH Inspection and Traversal Engineering. EPTCS 99, 2012
- 2011
- [j23]
- [j22]Stefan Edelkamp, Damian Sulewski, Jiri Barnat, Lubos Brim, Pavel Simecek: Flash memory efficient LTL model checking. Sci. Comput. Program. 76(2): 136-157 (2011)
- [j21]Dragan Bosnacki, Stefan Edelkamp, Damian Sulewski, Anton Wijs: Parallel probabilistic model checking on general purpose graphics processors. STTT 13(1): 21-35 (2011)
- [c74]Stefan Edelkamp, Peter Kissmann: On the Complexity of BDDs for State Space Search: A Case Study in Connect Four. AAAI 2011
- [c73]Peter Kissmann, Stefan Edelkamp: Improving Cost-Optimal Domain-Independent Symbolic Planning. AAAI 2011
- [c72]Damian Sulewski, Stefan Edelkamp, Peter Kissmann: Exploiting the Computational Power of the Graphics Card: Optimal State Space Planning on the GPU. ICAPS 2011
- [c71]Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen: Two Constant-Factor-Optimal Realizations of Adaptive Heapsort. IWOCA 2011: 195-208
- [e5]Fahiem Bacchus, Carmel Domshlak, Stefan Edelkamp, Malte Helmert (Eds.): Proceedings of the 21st International Conference on Automated Planning and Scheduling, ICAPS 2011, Freiburg, Germany June 11-16, 2011. AAAI 2011
- [e4]Joscha Bach, Stefan Edelkamp (Eds.): KI 2011: Advances in Artificial Intelligence, 34th Annual German Conference on AI, Berlin, Germany, October 4-7,2011. Proceedings. Lecture Notes in Computer Science 7006, Springer 2011, ISBN 978-3-642-24454-4
- [i4]Stefan Edelkamp: Taming Numbers and Durations in the Model Checking Integrated Planning System. CoRR abs/1107.0025 (2011)
- [i3]Stefan Edelkamp, Jörg Hoffmann: The Deterministic Part of IPC-4: An Overview. CoRR abs/1109.5663 (2011)
- [i2]Stefan Edelkamp, Roman Englert, Jörg Hoffmann, Frederico dos S. Liporace, Sylvie Thiébaux, Sebastian Trüg: Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4. CoRR abs/1110.1016 (2011)
- 2010
- [j20]David W. Aha, Mark S. Boddy, Vadim Bulitko, Artur S. d'Avila Garcez, Prashant Doshi, Stefan Edelkamp, Christopher W. Geib, Piotr J. Gmytrasiewicz, Robert P. Goldman, Pascal Hitzler, Charles L. Isbell, Darsana P. Josyula, Leslie Pack Kaelbling, Kristian Kersting, Maithilee Kunda, Luís C. Lamb, Bhaskara Marthi, Keith McGreggor, Vivi Nastase, Gregory Provan, Anita Raja, Ashwin Ram, Mark O. Riedl, Stuart J. Russell, Ashish Sabharwal, Jan-Georg Smaus, Gita Sukthankar, Karl Tuyls, Ron van der Meyden, Alon Y. Halevy, Lilyana Mihalkova, Sriraam Natarajan: Reports of the AAAI 2010 Conference Workshops. AI Magazine 31(4): 95-108 (2010)
- [j19]Dragan Bosnacki, Stefan Edelkamp: Model checking software: on some new waves and some evergreens. STTT 12(2): 89-95 (2010)
- [c70]Stefan Edelkamp, Damian Sulewski, Cengizhan Yücel: Perfect Hashing for State Space Exploration on the GPU. ICAPS 2010: 57-64
- [c69]Peter Kissmann, Stefan Edelkamp: Instantiating General Games Using Prolog or Dependency Graphs. KI 2010: 255-262
- [c68]Stefan Edelkamp, Hartmut Messerschmidt: Strongly Solving Fox-and-Geese on Multi-core CPU. KI 2010: 291-298
- [c67]
- [c66]Stefan Edelkamp, Peter Kissmann, Damian Sulewski, Hartmut Messerschmidt: Finding the Needle in the Haystack with Heuristically Guided Swarm Tree Search. MKWI 2010: 2295-2308
- [c65]Stefan Edelkamp, Damian Sulewski: External Memory Breadth-First Search with Delayed Duplicate Detection on the GPU. MoChArt 2010: 12-31
- [c64]Stefan Edelkamp, Mark Kellershoff, Damian Sulewski: Program Model Checking via Action Planning. MoChArt 2010: 32-51
- [c63]Stefan Edelkamp, Damian Sulewski, Cengizhan Yücel: GPU Exploration of Two-Player Games with Perfect Hash Functions. SOCS 2010
- [c62]Peter Kissmann, Stefan Edelkamp: Layer-Abstraction for Symbolically Solving General Two-Player Games. SOCS 2010
- [c61]Stefan Edelkamp, Damian Sulewski: Efficient Explicit-State Model Checking on General Purpose Graphics Processors. SPIN 2010: 106-123
- [c60]Asger Bruun, Stefan Edelkamp, Jyrki Katajainen, Jens Rasmussen: Policy-Based Benchmarking of Weak Heaps and Their Relatives, . SEA 2010: 424-435
2000 – 2009
- 2009
- [c59]Stefan Edelkamp, Peter Kissmann: Optimal Symbolic Planning with Action Costs and Preferences. IJCAI 2009: 1690-1695
- [c58]Peter Kissmann, Stefan Edelkamp: Solving Fully-Observable Non-deterministic Planning Problems via Translation into a General Game. KI 2009: 1-8
- [c57]Martin Dietzfelbinger, Stefan Edelkamp: Perfect Hashing for State Spaces in BDD Representation. KI 2009: 33-40
- [c56]Dragan Bosnacki, Stefan Edelkamp, Damian Sulewski: Efficient Probabilistic Model Checking on General Purpose Graphics Processors. SPIN 2009: 32-49
- [r2]Stefan Edelkamp, Shahid Jabbar: Disk-Based Search. Encyclopedia of Artificial Intelligence 2009: 501-506
- [r1]
- 2008
- [j18]Stefan Edelkamp, Shahid Jabbar, Damian Sulewski: Distributed Verification of Multi-threaded C++ Programs. Electr. Notes Theor. Comput. Sci. 198(1): 33-46 (2008)
- [j17]Stefan Edelkamp, Shahid Jabbar, Dino Midzic, Daniel Rikowski, Damian Sulewski: External Memory Search for Verification of Multi-threaded C++ Programs. KI 22(2): 44-50 (2008)
- [c55]Björn Ulrich Borowsky, Stefan Edelkamp: Optimal Metric Planning with State Sets in Automata Representation. AAAI 2008: 874-879
- [c54]Stefan Edelkamp, Peter Kissmann: Limits and Possibilities of BDDs in State Space Search. AAAI 2008: 1452-1453
- [c53]
- [c52]Peter Kissmann, Stefan Edelkamp: Symbolic Classification of General Multi-Player Games. ECAI 2008: 905-906
- [c51]Jiri Barnat, Lubos Brim, Stefan Edelkamp, Damian Sulewski, Pavel Simecek: Can Flash Memory Help in Model Checking? FMICS 2008: 150-165
- [c50]Stefan Edelkamp, Peter Kissmann: Limits and Possibilities of BDDs in State Space Search. KI 2008: 46-53
- [c49]Stefan Edelkamp, Peter Kissmann: Symbolic Classification of General Two-Player Games. KI 2008: 185-192
- [c48]Stefan Edelkamp, Peter Kissmann: Partial Symbolic Pattern Databases for Optimal Sequential Planning. KI 2008: 193-200
- [c47]Marco Bakera, Stefan Edelkamp, Peter Kissmann, Clemens D. Renner: Solving µ-Calculus Parity Games by Symbolic Planning. MoChArt 2008: 15-33
- [c46]Stefan Edelkamp, Shahid Jabbar, Peter Kissmann: Scaling Search with Pattern Databases. MoChArt 2008: 49-64
- [c45]Stefan Edelkamp, Viktor Schuppan, Dragan Bosnacki, Anton Wijs, Ansgar Fehnker, Husain Aljazzar: Survey on Directed Model Checking. MoChArt 2008: 65-89
- [c44]Stefan Edelkamp, Damian Sulewski: Flash-Efficient LTL Model Checking with Minimal Counterexamples. SEFM 2008: 73-82
- 2007
- [j16]
- [j15]
- [j14]
- [c43]
- [c42]
- [c41]Stefan Edelkamp, Peter Kissmann: Externalizing the Multiple Sequence Alignment Problem with Affine Gap Costs. KI 2007: 444-447
- [e3]Stefan Edelkamp, Stefan Leue, Willem Visser (Eds.): Directed Model Checking, 26.04. - 29.04.2006. Dagstuhl Seminar Proceedings 06172, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007
- [e2]Stefan Edelkamp, Alessio Lomuscio (Eds.): Model Checking and Artificial Intelligence, 4th Workshop, MoChArt IV, Riva del Garda, Italy, August 29, 2006, Revised Selected and Invited Papers. Lecture Notes in Computer Science 4428, Springer 2007, ISBN 978-3-540-74127-5
- [e1]Dragan Bosnacki, Stefan Edelkamp (Eds.): Model Checking Software, 14th International SPIN Workshop, Berlin, Germany, July 1-3, 2007, Proceedings. Lecture Notes in Computer Science 4595, Springer 2007, ISBN 978-3-540-73369-0
- 2006
- [j13]Stefan Edelkamp, Shahid Jabbar: Action Planning for Directed Model Checking of Petri Nets. Electr. Notes Theor. Comput. Sci. 149(2): 3-18 (2006)
- [j12]Tilman Mehler, Stefan Edelkamp: Dynamic Incremental Hashing in Program Model Checking. Electr. Notes Theor. Comput. Sci. 149(2): 51-69 (2006)
- [j11]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. J. Artif. Intell. Res. (JAIR) 26: 453-541 (2006)
- [c40]
- [c39]
- [c38]Stefan Edelkamp, Stefan Leue, Willem Visser: 06172 Executive Summary -- Directed Model Checking. Directed Model Checking 2006
- [c37]Stefan Edelkamp, Stefan Leue, Willem Visser: 06172 Abstracts Collection -- Directed Model Checking. Directed Model Checking 2006
- [c36]Stefan Edelkamp: Cost-Optimal Symbolic Planning with State Trajectory and Preference Constraints. ECAI 2006: 841-842
- [c35]Stefan Edelkamp, Shahid Jabbar, Alberto Lluch-Lafuente: Heuristic Search for the Analysis of Graph Transition Systems. ICGT 2006: 414-429
- [c34]
- [c33]
- [c32]
- [c31]Shahid Jabbar, Stefan Edelkamp: Parallel External Directed Model Checking with Linear I/O. VMCAI 2006: 237-251
- 2005
- [j10]Jörg Hoffmann, Stefan Edelkamp: The Deterministic Part of IPC-4: An Overview. J. Artif. Intell. Res. (JAIR) 24: 519-579 (2005)
- [j9]Stefan Edelkamp, Shahid Jabbar, Thomas Willhalm: Geometric travel planning. IEEE Transactions on Intelligent Transportation Systems 6(1): 5-16 (2005)
- [c30]Stefan Edelkamp, Shahid Jabbar, Alberto Lluch-Lafuente: Cost-Algebraic Heuristic Search. AAAI 2005: 1362-1367
- [c29]
- [c28]
- 2004
- [j8]Stefan Edelkamp, Stefan Leue, Alberto Lluch-Lafuente: Directed explicit-state model checking in the validation of communication protocols. STTT 5(2-3): 247-267 (2004)
- [j7]Stefan Edelkamp, Stefan Leue, Alberto Lluch-Lafuente: Partial-order reduction and trail improvement in directed model checking. STTT 6(4): 277-301 (2004)
- [c27]
- [c26]
- [c25]Peter Leven, Tilman Mehler, Stefan Edelkamp: Directed Error Detection in C++ with the Assembly-Level Model Checker StEAM. SPIN 2004: 39-56
- 2003
- [j6]Stefan Edelkamp: Taming Numbers and Durations in the Model Checking Integrated Planning System. J. Artif. Intell. Res. (JAIR) 20: 195-238 (2003)
- [c24]Stefan Edelkamp, Stefan Schrödl: Route Planning and Map Inference with Global Positioning Traces. Computer Science in Perspective 2003: 128-151
- [c23]Stefan Edelkamp, Shahid Jabbar, Thomas Willhalm: Accelerating Heuristic Search in Spatial Domains. PuK 2003
- [c22]
- 2002
- [j5]Stefan Edelkamp, Patrick Stiegeler: Implementing HEAPSORT with (n logn - 0.9n) and QUICKSORT with (n logn + 0.2n) Comparisons. ACM Journal of Experimental Algorithmics 7: 5 (2002)
- [c21]Stefan Edelkamp: Mixed Propositional and Numeric Planning in the Model Checking Integrated Planning System. AIPS Workshop on Planning for Temporal Domains 2002: 47-55
- [c20]
- [c19]Stefan Edelkamp: Memory Limitations in Artificial Intelligence. Algorithms for Memory Hierarchies 2002: 233-250
- [c18]
- [c17]Stefan Edelkamp: Taming Numbers and Durations in the Model Checking Integrated Planning System. PuK 2002
- [c16]Alberto Lluch-Lafuente, Stefan Edelkamp, Stefan Leue: Partial Order Reduction in Directed Model Checking. SPIN 2002: 112-127
- 2001
- [j4]Richard E. Korf, Michael Reid, Stefan Edelkamp: Time complexity of iterative-deepening-A*. Artif. Intell. 129(1-2): 199-218 (2001)
- [j3]Stefan Edelkamp, Malte Helmert: MIPS: The Model-Checking Integrated Planning System. AI Magazine 22(3): 67-72 (2001)
- [j2]Stefan Edelkamp, Alberto Lluch-Lafuente, Stefan Leue: Trail-directed model checking. Electr. Notes Theor. Comput. Sci. 55(3): 343-356 (2001)
- [c15]Stefan Edelkamp: Prediction of Regular Search Tree Growth by Spectral Analysis. KI/ÖGAI 2001: 154-168
- [c14]Stefan Edelkamp, Ulrich Meyer: Theory and Practice of Time-Space Trade-Offs in Memory Limited Search. KI/ÖGAI 2001: 169-184
- [c13]Falk Hüffner, Stefan Edelkamp, Henning Fernau, Rolf Niedermeier: Finding Optimal Solutions to Atomix. KI/ÖGAI 2001: 229-243
- [c12]Stefan Edelkamp, Alberto Lluch-Lafuente, Stefan Leue: Directed Explicit Model Checking with HSF-SPIN. SPIN 2001: 57-79
- 2000
- [c11]
- [c10]
- [c9]
- [c8]Stefan Edelkamp, Patrick Stiegeler: Pushing the Limits in Sequential Sorting. Algorithm Engineering 2000: 39-50
1990 – 1999
- 1999
- [b1]Stefan Edelkamp: Datenstrukturen und Lernverfahren in der Zustandsraumsuche. DISKI 201, Infix 1999, ISBN 978-3-89601-201-2, pp. I-VIII, 1-192
- [j1]
- [c7]Stefan Edelkamp, Malte Helmert: Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length. ECP 1999: 135-147
- [c6]Frank Reffel, Stefan Edelkamp: Error Detection with Directed Symbolic Model Checking. World Congress on Formal Methods 1999: 195-211
- [c5]Stefan Schrödl, Stefan Edelkamp: Inferring Flow of Control in Program Synthesis by Example. KI 1999: 171-182
- [i1]Stefan Edelkamp, Ingo Wegener: On the performance of WEAK-HEAPSORT. Electronic Colloquium on Computational Complexity (ECCC) 6(28) (1999)
- 1998
- [c4]Stefan Edelkamp, Richard E. Korf: The Branching Factor of Regular Search Spaces. AAAI/IAAI 1998: 299-304
- [c3]
- [c2]
- 1997
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:17 CEST by the dblp team