| # |  | Year | | Title | AG Editor Comment | Type | |
|---|
| 4 |
 | Fellows, Michael R. |
| |
| 2 |
| |
| 2 |
| Fernandes, Cristina G. |
| |
| 2 |
| |
| 9 |
| Ferragina, Paolo |
| |
| 1 |
| |
| 3 |
| Fialko, Sergej |
| |
| 1 |
| |
| 5 |
| Finkler, Ulrich |
| |
| 2 |
| |
| 5 |
| Fishkin, Aleksei V. |
| |
| 2 |
| |
| 1 |
| Flato, Eyal |
| |
| 2 |
| |
| 23 |
| Fleischer, Rudolf |
| |
| 1 |
| |
| 9 |
| Fogel, Efi |
| |
| 1 |
| |
| 2 |
| Follert, Frank |
| |
| 4 |
| |
| 1 |
| Fontaine, Marc |
| |
| 1 |
| |
| 8 |
| Fotakis, Dimitris |
| |
| 1 |
| |
| 20 |
| Fountoulakis, Nikolaos |
| |
| 1 |
| |
| 19 |
| Fouz, Mahmoud |
| |
| 5 |
| |
| 1 |
| Frank, Da |
| |
| 2 |
| |
| 1 |
| Fredman, Michael |
| |
| 2 |
| |
| 3 |
| Friedrichs, Stephan |
| |
| 80 |
| |
| 2 |
| Fries, Markus |
| |
| 1 |
| |
| 3 |
| Fries, O. |
| |
| 2 |
| |
| 1 |
| Frigioni, Daniele |
| |
| 1 |
| |
| 1 |
| Fuhrmann, Artur |
| |
| 57 |
| |
| 5 |
| Fürer, Martin |
| |
| 3 |
| |
| 2 |
| Gairing, Martin |
| |
| 3 |
| |
| 1 |
| Gandhi, Rajiv |
| |
| 2 |
| |
| 2 |
| Gao, Shaodi |
| |
| 1 |
| |
| 15 |
| Garg, Naveen |
| |
| 1 |
| |
| 1 |
| Gärtner, Tobias |
| |
| 18 |
| |
| 1 |
| Gast, Christoph |
| |
| 17 |
| |
| 1 |
| Geerke, Daan P. |
| |
| 1 |
| |
| 2 |
| Geismann, Nicola |
| |
| 2 |
| |
| 4 |
| Gergov, Jordan |
| |
| 1 |
| |
| 1 |
| Ghandar, Adam |
| |
| 2 |
| |
| 2 |
| Giannopoulos, Panos |
| |
| 5 |
| |
| 10 |
| Giesen, Joachim |
| |
| 3 |
| |
| 11 |
| Gnewuch, Michael |
| |
| 2 |
| |
| 1 |
| Goesele, Michael |
| |
| 6 |
| |
| 7 |
| Golin, Mordecai J. |
| |
| 1 |
| |
| 1 |
| Gonnet, Gaston H. |
| |
| 6 |
| |
| 1 |
| Gotsman, Craig |
| |
| 1 |
| |
| 1 |
| Goumopoulos, Christos |
| |
| 1 |
| |
| 1 |
| Gouyou-Beauchamps, Dominique |
| |
| 4 |
| |
| 1 |
| Goyal, Vishrut |
| |
| 1 |
| |
| 1 |
| Grammatikakis, M.D. |
| |
| 2 |
| |
| 1 |
| Grandoni, Fabrizio |
| |
| 2 |
| |
| 3 |
| Grigoriev, Alexander |
| |
| 1 |
| |
| 1 |
| Gross, Roberto |
| |
| 5 |
| |
| 1 |
| Guez, Dan |
| |
| 1 |
| |
| 2 |
| Guibas, Leonidas |
| |
| 2 |
| |
| 3 |
| Guillaume, Frank |
| |
| 3 |
| |
| 2 |
| Günther, Elisabeth |
| |
| 1 |
| |
| 2 |
| Guo, Zeyu |
| |
| 3 |
| |
| 2 |
| Gupta, Arvind |
| |
| 1 |
| |
| 8 |
| Gupta, Prosenjit |
| |
| 45 |
| |
| 3 |
| Güttler, Reiner |
| |
| 4 |
| |
| 6 |
| Hachenberger, Peter |
| |
| 2 |
| |
| 2 |
| Hagen, Matthias |
| |
| 37 |
| |
| 1 |
| Hagerup,Torben |
| |
| 1 |
| Hajiaghayi, MohammadTaghi |
| |
| 2 |
| Hales, David |
| |
| 2 |
| |
| 13 |
| Halperin, Dan |
| |
| 1 |
| |
| 1 |
| Haltner, Elleonore |
| |
| 1 |
| |
| 1 |
| Hammad, Abdelrahman |
| |
| 1 |
| |
| 1 |
| Hanniel, Iddo |
| |
| 1 |
| |
| 1 |
| Han, Xiaofeng |
| |
| 1 |
| |
| 7 |
| Happ, Edda |
| |
| 2 |
| |
| 9 |
| Hariharan, Ramesh |
| |
| 1 |
| |
| 2 |
| Harks, Tobias |
| |
| 12 |
| |
| 1 |
| Hartman, Tzvika |
| |
| 1 |
| |
| 1 |
| Hazboun, Jack |
| |
| 1 |
| |
| 20 |
| Hebbinghaus, Nils |
| |
| 1 |
| |
| 1 |
| Heinz, Jeffrey |
| |
| 1 |
| |
| 37 |
| Hemmer, Michael |
| |
| 1 |
| |
| 2 |
| Henzinger, Monika R. |
| |
| 1 |
| |
| 19 |
| Hermelin, Danny |
| |
| 1 |
| |
| 1 |
| Herrmann, Thomas |
| |
| 4 |
| |
| 1 |
| Hertel, S. |
| |
| 14 |
| |
| 3 |
| Heydrich, Sandy |
| |
| 2 |
| |
| 4 |
| He, Jun |
| |
| 1 |
| |
| 1 |
| Hilpert, Peter |
| |
| 1 |
| |
| 1 |
| Hirsch, Shai |
| |
| 1 |
| |
| 15 |
| Hoefer, Martin |
| |
| 1 |
| |
| 1 |
| Hoffmann, K |
| |
| 3 |
| |
| 3 |
| Hoffmann, Michael |
| |
| 1 |
| |
| 1 |
| Höhn, Wiebke |
| |
| 1 |
| |
| 3 |
| Hong, Jia-Wei |
| |
| 1 |
| |
| 1 |
| Hornby, Gergory (ed.) |
| |
| 1 |
| |
| 5 |
| Horoba, Christian |
| |
| 1 |
| |
| 1 |
| Hotz, Günter |
| |
| 1 |
| |
| 1 |
| Hoy, Darrell |
| |
| 1 |
| |
| 11 |
| Huang, Chien-Chung |
| |
| 8 |
| |
| 1 |
| Huddleston, Scott |
| |
| 1 |
| |
| 1 |
| Hüffner, Falk |
| |
| 2 |
| |
| 1 |
| Humble, Monika |
| |
| 2 |
| |
| 3 |
| Hutchinson, David A. |
| |
| 1 |
| |
| 1 |
| H., Chintan Rao |
| |
| 1 |
| |
| 1 |
| Iacono, G. |
| |
| 2 |
| |
| 1 |
| Immich, Stefan |
| |
| 1 |
| |
| 2 |
| Indyk, Piotr |
| |
| 1 |
| |
| 1 |
| Ingalalli, Vijay |
| |
| 4 |
| |
| 1 |
| Isopi, Marc |
| |
| 1 |
| |
| 1 |
| Italiano, Giuseppe |
| |
| 2 |
| |
| 1 |
| Jacobs, Tobias |
| |
| 1 |
| |
| 9 |
| Janardan, Ravi |
| |
| 11 |
| |
| 5 |
| Jansen, Thomas |
| |
| 1 |
| |
| 1 |
| Jansson, Jesper |
| |
| 1 |
| |
| 1 |
| Jeli´c, Slobodan |
| |
| 4 |
| |
| 2 |
| Jerrum, Mark |
| |
| 13 |
| |
| 2 |
| Jez, Lukasz |
| |
| 1 |
| |
| 1 |
| Jiang, Zhigen |
| |
| 21 |
| |
| 1 |
| Johnson, Aaron |
| |
| 19 |
| |
| 4 |
| Jung, Bernd |
| |
| 6 |
| |
| 2 |
| Jung, Hermann (ed.) |
| |
| 1 |
| |
| 6 |
| Jurkiewicz, Tomasz |
| |
| 4 |
| |
| 3 |
| Kagaris, Dimitrios |
| |
| 1 |
| |
| 2 |
| Kaklamanis, Christos |
| |
| 6 |
| |
| 1 |
| Kaller, Damon |
| |
| 4 |
| |
| 1 |
| Kammenhuber, Nils |
| |
| 1 |
| |
| 1 |
| Kane, Daniel |
| |
| 1 |
| |
| 1 |
| Kang, Ross |
| |
| 1 |
| |
| 1 |
| Kannan, Ravi |
| |
| 3 |
| |
| 5 |
| Kapoor, Sanjiv |
| |
| 1 |
| |
| 1 |
| Karamanis, Nikiforos |
| |
| 4 |
| |
| 2 |
| Karavelas, Menelaos I. |
| |
| 10 |
| |
| 3 |
| Karlin, Anna |
| |
| 2 |
| |
| 3 |
| Karpinski, Marek |
| |
| 1 |
| |
| 2 |
| Karp, Richard M. |
| |
| 17 |
| |
| 1 |
| Kasan, Binaman |
| |
| 1 |
| |
| 2 |
| Kasprzik, Anna |
| |
| 8 |
| |
| 3 |
| Katoh, Naoki |
| |
| 18 |
| |
| 26 |
| Kaufmann, Michael |
| |
| 1 |
| |
| 1 |
| Kautz, Jan |
| |
| 19 |
| |
| 5 |
| Kavitha, T. |
| |
| 1 |
| |
| 2 |
| Kayal, Neeraj |
| |
| 4 |
| |
| 1 |
| Kedem, Klara |
| |
| 1 |
| |
| 1 |
| Keizer, Marten (ed.) |
| |
| 1 |
| |
| 4 |
| Kelsen, Pierre |
| |
| 1 |
| |
| 26 |
| Kerber, Michael |
| |
| 1 |
| |
| 1 |
| Kern, Walter |
| |
| 1 |
| |
| 3 |
| Kesselheim, Thomas |
| |
| 11 |
| |
| 1 |
| Kessler, Harald |
| |
| 2 |
| |
| 1 |
| Kettner, Björn |
| |
| 40 |
| |
| 1 |
| Kettner, Lutz (ed.) |
| |
| 33 |
| |
| 1 |
| Khandekar, Rohit |
| |
| 1 |
| |
| 2 |
| Khosla, Megha |
| |
| 2 |
| |
| 1 |
| Kim, Eun Jung |
| |
| 1 |
| |
| 1 |
| Kirousis, Lefteris |
| |
| 1 |
| |
| 1 |
| Klauk, Mathias |
| |
| 13 |
| |
| 3 |
| Kleiman, Elena |
| |
| 1 |
| |
| 19 |
| Klein, Christian |
| |
| 2 |
| |
| 5 |
| Klein, Rolf |
| |
| 2 |
| |
| 1 |
| Klimm, Max |
| |
| 1 |
| |
| 2 |
| Knauer, Christian |
| |
| 1 |
| |
| 1 |
| Knowles, Joshua D. (ed.) |
| |
| 7 |
| |
| 1 |
| Koch, Gunter |
| |
| 1 |
| |
| 1 |
| Kociumaka, Tomasz |
| |
| 1 |
| |
| 1 |
| Kogan, Kirill |
| |
| 2 |
| |
| 7 |
| Kohlbacher, Oliver |
| |
| 1 |
| |
| 1 |
| Koldehofe, Boris |
| |
| 4 |
| |
| 1 |
| Kollias, Konstantinos |
| |
| 4 |
| |
| 1 |
| Konidaris, G. |
| |
| 1 |
| |
| 1 |
| Konjevod, Goran |
| |
| 3 |
| |
| 1 |
| Konwar, Kishori |
| |
| 1 |
| |
| 1 |
| Korst, Jan |
| |
| 2 |
| |
| 1 |
| Kortsarz, Guy |
| |
| 29 |
| |
| 8 |
| Koutsoupias, Elias |
| |
| 11 |
| |
| 1 |
| Kovacs, Tim (ed.) |
| |
| 7 |
| |
| 22 |
| Kowalski, Dariusz |
| |
| 1 |
| |
| 1 |
| Kowaluk, Miroslaw |
| |
| 1 |
| |
| 1 |
| Kranakis, Evangelos |
| |
| 3 |
| |
| 4 |
| Kratsch, Dieter |
| |
| 14 |
| |
| 1 |
| Kreveld, Marc van |
| |
| 1 |
| |
| 2 |
| Krishnan, P. |
| |
| 2 |
| |
| 2 |
| Kritzer, Peter |
| |
| 1 |
| |
| 1 |
| Krizanc, Danny |
| |
| 1 |
| |
| 1 |
| Kroeske, Jense |
| |
| 3 |
| |
| 3 |
| Krohn, Erik |
| |
| 1 |
| |
| 1 |
| Krüger, Michael |
| |
| 1 |
| |
| 1 |
| Krumke, Sven Oliver |
| |
| 15 |
| |
| 1 |
| Ksinsik, Patric |
| |
| 1 |
| |
| 1 |
| Kucherov, Gregory |
| |
| 4 |
| |
| 2 |
| Kuhn, Fabian |
| |
| 1 |
| |
| 4 |
| Kumar, Amit |
| |
| 1 |
| |
| 2 |
| Kumar, Sanjeev (ed.) |
| |
| 5 |
| |
| 7 |
| Künnemann, Marvin |
| |
| 1 |
| |
| 1 |
| Kurowski, Maciej |
| |
| 3 |
| |
| 1 |
| Kurur, Piyush P. |
| |
| 1 |
| |
| 16 |
| Kutz, Martin |
| |
| 2 |
| |
| 1 |
| Kwek, St. |
| |
| 1 |
| |
| 1 |
| Lambert, Georg |
| |
| 2 |
| |
| 7 |
| Lam, Tak-Wah |
| |
| 2 |
| |
| 2 |
| Landau, Gad M. |
| |
| 4 |
| |
| 1 |
| Langkau, Katharina |
| |
| 1 |
| |
| 1 |
| Lang, Jochen |
| |
| 3 |
| |
| 1 |
| Larsen, Kasper Green |
| |
| 1 |
| |
| 1 |
| Lars, Arge (ed.) |
| |
| 1 |
| |
| 1 |
| Laue, Soeren |
| |
| 4 |
| |
| 2 |
| Laura, Luigi |
| |
| 1 |
| |
| 5 |
| Lee, Jae-Ha |
| |
| 7 |
| |
| 1 |
| Lehnert, Jörg |
| |
| 1 |
| |
| 3 |
| Lehre, Per Kristian |
| |
| 2 |
| |
| 1 |
| Leinenbach, Stefan |
| |
| 4 |
| |
| 1 |
| Leiserson, Charles (ed.) |
| |
| 1 |
| |
| 8 |
| Lengauer, Thomas |
| |
| 4 |
| |
| 33 |
| Lenhof, Hans-Peter |
| |
| 3 |
| |
| 1 |
| Lensch, Hendrik P. A. |
| |
| 11 |
| |
| 2 |
| Lermen, Martin |
| |
| 1 |
| |
| 2 |
| Levavi, Ariel |
| |
| 9 |
| |
| 1 |
| Levy, Avivit |
| |
| 2 |
| |
| 1 |
| Liberty, Edo |
| |
| 1 |
| |
| 1 |
| Liebchen, Ch. |
| |
| 1 |
| |
| 2 |
| Ligett, Katrina |
| |
| 5 |
| |
| 3 |
| Lingas, Andrzej |
| |
| 2 |
| |
| 1 |
| Li, Jian |
| |
| 1 |
| |
| 1 |
| Lodha, Sachin |
| |
| 1 |
| |
| 2 |
| Loeckx, Jacques |
| |
| 1 |
| |
| 5 |
| Lokshtanov, Daniel |
| |
| 1 |
| |
| 4 |
| Lopez-Ortiz, Alejandro |
| |
| 1 |
| |
| 1 |
| Lorys, Krzysztof |
| |
| 8 |
| |
| 1 |
| Lumelsky, Vladimir |
| |
| 1 |
| |
| 1 |
| Lüttke-Hüttmann, Dirk |
| |
| 1 |
| |
| 1 |
| MacKenzie, Philip D. |
| |
| 1 |
| |
| 2 |
| Mahajan, Meena |
| |
| 8 |
| |
| 2 |
| Maheshwari, Anil |
| |
| 1 |
| |
| 7 |
| Majumdar, Debapriyo |
| |
| 1 |
| |
| 26 |
| Makino, Kazuhisa |
| |
| 10 |
| |
| 1 |
| Malde, Alpeshkumar K. |
| |
| 1 |
| |
| 1 |
| Maletti, Andreas |
| |
| 1 |
| |
| 3 |
| Mandoiu, Ion |
| |
| 3 |
| |
| 7 |
| Manjunath, Madhusudan |
| |
| 1 |
| |
| 1 |
| Manlove, David F. |
| |
| 2 |
| |
| 1 |
| Manolache, Gabriel |
| |
| 2 |
| |
| 1 |
| Manss, Christian |
| |
| 2 |
| |
| 1 |
| Mantler, Andrea |
| |
| 2 |
| |
| 2 |
| Marathe, Madhav V. |
| |
| 19 |
| Marchetti-Spaccamela, Alberto |
| |
| 1 |
| Margewitsch, Erwin |
| |
| 2 |
| |
| 2 |
| Marks, Joe |
| |
| 1 |
| |
| 1 |
| Marshall, Alan |
| |
| 1 |
| |
| 4 |
| Marx, Daniel |
| |
| 16 |
| |
| 1 |
| Matijevi`c, Domagoj |
| |
| 2 |
| |
| 1 |
| Maurer, Olaf |
| |
| 1 |
| |
| 2 |
| Mavronicolas, Marios |
| |
| 1 |
| |
| 1 |
| McConnella, Ross M. |
| |
| 3 |
| |
| 1 |
| McDiarmid, Colin |
| |
| 1 |
| |
| 21 |
| Megow, Nicole |
| |
| 419 |
| |
| | 2013 | | A Framework for the Verification of Certifying Computations | noch nicht erschienen 4.2.13 sm | Unpublished/Draft | |
| | 2013 | | Certifying 3-Edge-Connectivity
In: 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'13), 358-369 | | Proceedings Article | |
| | 2013 | | Every DFS tree of a 3-connected graph contains a contractible edge
In: Journal of Graph Theory [72], 112-121 | | Journal Article | |
| | 2013 | | From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic Decomposition
In: arXiv [abs/1301.4870], | | Electronic Journal Article | |
| | 2013 | | On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets
In: 19th Annual International Computing and Combinatorics Conference (COCOON-13), 65-76 | | Proceedings Article | |
| | 2013 | | The cost of address translation
In: Proceedings of the Meeting on Algorithm Engineering & Experiments, | noch nicht erschienen 4.2.13 sm | Proceedings Article | |
| | 2013 | | The Query Complexity of Finding a Hidden Permutation
In: Space-Efficient Data Structures, Streams, and Algorithms, 1-11 | | Part of a Book | |
| | 2012 | | A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market
In: arXiv [abs/1212.0979v1], 1-8 | | Electronic Journal Article | |
| | 2012 | | An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs
In: Algorithmica [62], 754-766 | | Journal Article | |
| | 2012 |  | Certifying 3-Edge-Connectivity | | Unpublished/Draft | |
| | 2012 | | Counting Arbitrary Subgraphs in Data Streams
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 598-609 | | Proceedings Article | |
| | 2012 | | Online Graph Exploration: New Results on Old and New Algorithms
In: Theoretical Computer Science [463], 62-72 | | Journal Article | |
| | 2012 | | Physarum Can Compute Shortest Paths
In: Journal of Theoretical Biology [309], 121-133 | | Journal Article | |
| | 2012 | | Physarum Can Compute Shortest Paths
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 233-240 | | Proceedings Article | |
| | 2012 | | Remarks on Category-Based Routing in Social Networks | | Unpublished/Draft | |
| | 2012 | | The Query Complexity of Finding a Hidden Permutation
In: Electronic Colloquium on Computational Complexity (ECCC): Report Series [87 (Revision 1)], 1-36 | | Electronic Journal Article | |
| | 2011 | | A deterministic algorithm for isolating real roots of a real polynomial
In: Journal of Symbolic Computation [46], 70-90 | | Journal Article | |
| | 2011 | | A General Approach to the Analysis of Controlled Perturbation Algorithms
In: Computational Geometry [44], 507-528 | | Journal Article | |
| | 2011 | | Additive Spanners and (α, β)-Spanners
In: ACM Transactions on Algorithms [7], 5:1-5:26 | | Journal Article | |
| | 2011 | | Approximate Counting of Cycles in Streams
In: 19th Annual European Symposium on Algorithms (ESA-11), 677-688 | | Proceedings Article | |
| | 2011 | | Certifying algorithms
In: Computer Science Review [5], 119-161 | | Journal Article | |
| | 2011 | | Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 119-130 | Falsch: Halldórsson, Mangús M. - richtig: Halldórsson, Magnús M. | Proceedings Article | |
| | 2011 | | New Approximation Algorithms for Minimum Cycle Bases of Graphs
In: Algorithmica [59], 471-488 | | Journal Article | |
| | 2011 | | Online Graph Exploration: New Results on Old and New Algorithms
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 478-489 | | Proceedings Article | |
| | 2011 | | Verification of Certifying Computations
In: Computer Aided Verification : 23rd International Conference, CAV 2011, 67-82 | | Proceedings Article | |
| | 2011 | | Weisfeiler-Lehman graph kernels
In: Journal of Machine Learning Research [12], 2539-2561 | | Journal Article | |
| | 2010 | | An $O(m+n)$ Certifying Triconnectivity Algorithm for Hamiltonian Graphs
In: Algorithmica [Online First], 1-13 | | Electronic Journal Article | |
| | 2010 | | Arrangements on Parametric Surfaces I: General Framework and Infrastructure
In: Mathematics in Computer Science [4], 45-66 | | Journal Article | |
| | 2010 | | Assigning Papers to Referees
In: Algorithmica [58], 119-136 | Online First Januar 2010 | Journal Article | |
| | 2010 | | Certifying algorithms
In: Computer Science Review [Article in Press], 1-43 | | Electronic Journal Article | |
| | 2010 | | Faster algorithms for computing Hong's bound on absolute positiveness
In: Journal of Symbolic Computation [45], 677-683 | | Journal Article | |
| | 2010 | | Progress on Certifying Algorithms
In: Frontiers in Algorithmics : 4th International Workshop, FAW 2010, 1-5 | | Proceedings Article | |
| | 2010 | | Reliable and Efficient Geometric Computing
In: Mathematical Software, ICMS 2010 : Third International Congress
on Mathematical Software, 10-11 | | Proceedings Article | |
| | 2009 | | A Separation Bound for Real Algebraic Expressions
In: Algorithmica [55], 14-28 | | Journal Article | |
| | 2009 | | Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 301-312 | | Proceedings Article | |
| | 2009 | | Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, 301-312 | | Proceedings Article | |
| | 2009 | | Efficient Graphlet Kernels for Large Graph Comparison
In: Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics (AISTATS), 488-495 | | Electronic Proceedings Article | |
| | 2009 | | Isolating real roots of real polynomials
In: Proceedings of the 2009 international symposium on Symbolic and algebraic computation (ISSAC), 247-254 | | Proceedings Article | |
| | 2008 | | A deterministic Bitstream Descartes Algorithm | | Report | |
| | 2008 | | A General Approach to the Analysis of Controlled Perturbation Algorithms | | Report | |
| | 2008 | | Algorithms and Data Structures: The Basic Toolbox | | Book | |
| | 2008 | | Assigning Papers to Referees | | Unpublished/Draft | |
| | 2008 | | Classroom Examples of Robustness Problems in Geometric Computations
In: Computational Geometry: Theory and Applications [40], 61-78 | in Press, online bereits ersch. 05.02.08/bc | Journal Article | |
| | 2008 | | Faster Deterministic and Randomized Algorithms for Minimum Cycle Basis in Directed Graphs
In: SIAM Journal of Computing [38], 1430-1447 | | Journal Article | |
| | 2007 | | Algorithms to compute minimum cycle basis in directed graphs
In: Theory of Computing Systems [40], 485-505 | | Journal Article | |
| | 2007 | | Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, Optimized Implementation and Experiments
In: Computational Geometry: Theory and Applications [38], 64-99 | | Journal Article | |
| | 2007 | | Cycle Bases of Graphs and Sampled Manifolds
In: Computer Aided Geometric Design [24], 464 | | Journal Article | |
| | 2007 | | Implementing Minimum Cycle Basis Algorithms
In: Journal of Experimental Algorithmics [11], 1-14 | ok - export0707 / ch
- Abgleich mit Webseiten
- Not MPII Author / Editor
- urls
- abstract
- pdf
- laut EZB nur online => electronic article
ok / ch 070312
- im Web gefunden und von dort die Angaben übernommen. | Electronic Journal Article | |
| | 2007 | | Matchings in Graphs Variations of the Problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 1-2 | | Proceedings Article | |
| | 2007 | | Minimum Cycle Bases in Graphs Algorithms and Applications
In: Mathematical Foundations of Computer Science 2007 : 32nd International Symposium, MFCS 2007, 13-14 | | Proceedings Article | |
| | 2007 | | New Approximation Algorithms for Minimum Cycle Bases of Graphs
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 512-523 | ok - export0707 / ch
- Abgleich mit BiVis
- Abgleich mit Papierfassung
- Abgleich mit Webseiten
- Not MPII Author / Editor
- urls
- abstract
- pdf
ok / ch 070604 | Proceedings Article | |
| | 2007 | | Popular Matchings
In: SIAM Journal on Computing [37], 1030-1045 | | Journal Article | |
| | 2007 | | Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem
In: ACM Transactions on Algorithms [3], 15.1-15.18 | | Journal Article | |
| | 2007 | | Sweeping and Maintaining Two-Dimensional Arrangements on Quadrics | | Report | |
| | 2007 | | Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
In: Algorithms - ESA 2007, 15th Annual European Symposium, 645-656 | | Proceedings Article | |
| | 2006 | | A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs
In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, 250-261 | ok / ch 070604
- abgeglichen + pdf eingesetzt
Non-Mpi-ler? (von mir aber auch bereits gemäß Springer-Webseite eingetragen)
ansonsten ok / ch 070207
- aus Webseite aufergänzt
übertragen von Springer-Sites und Books-DB / ch 060814 | Proceedings Article | |
| | 2006 | | Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
In: Siam Journal on Computing, 326-353
In: SIAM Journal on Computing [36], 326-353 | ok - abgeglichen mit web-Eintrag / ch 060911 | Journal Article | |
| | 2006 | | Controlled Perturbation for Delaunay Triangulations | | Report | |
| | 2006 | | Implementing Minimum Cycle Basis Algorithms
In: ACM Journal of Experimental Algorithmics [11], 1-14 | ok / ch 070312
- mit der Webseite abgeglichen | Electronic Journal Article | |
| | 2006 | | Matching Algorithms are Fast in Sparse Random Graphs
In: Theory of Computing Systems [39], 3-14 | ok - pdf eingefügt / 061004
ok / ch060416 | Journal Article | |
| | 2006 | | New bounds for the Descartes method
In: Journal of Symbolic Computation [41], 49-66 | ok - aus dem Journal übertragen / ch 060914 | Journal Article | |
| | 2006 | | Polyline Fitting of Planar Points under Min-sum Criteria
In: International Journal of Computational Geometry and Applications [16], 97-116 | ok / ch 070408
Non-MPII-ler gemäß download article.
ch 060922:
- http://dblp.uni-trier.de/rec/bibtex/journals/ijcga/AronovAKMT06
- Abgleich mit Journal-Webseite | Journal Article | |
| | 2006 | | Rank-Maximal Matchings
In: ACM Transactions on Algorithms [2], 602-610 | ok / ch 070312
- mit Webseite abgeglichen | Journal Article | |
| | 2006 | | Reliable and Efficient Computational Geometry Via Controlled Perturbation
In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, 299-310 | ch 061004: pdf nicht möglich herunterzuladen, login wird verlangt
ch 060814:
From DBLP (2006):
@InProceedings{conf/icalp/MehlhornOS06,
title = "Reliable and Efficient Computational Geometry Via
Controlled Perturbation",
author = "Kurt Mehlhorn and Ralf Osbild and Michael Sagraloff",
bibdate = "2006-07-03",
bibsource ="DBLP,
http://dblp.uni-trier.de/db/conf/icalp/icalp2006-1.html#MehlhornOS06",
booktitle ="ICALP (1)",
booktitle ="Automata, Languages and Programming, 33rd
International Colloquium, {ICALP} 2006, Venice, Italy,
July 10-14, 2006, Proceedings, Part {I}",
publisher = "Springer",
year = "2006",
volume = "4051",
editor = "Michele Bugliesi and Bart Preneel and Vladimiro
Sassone and Ingo Wegener",
ISBN = "3-540-35904-4",
pages = "299--310",
series = "Lecture Notes in Computer Science",
URL = "http://dx.doi.org/10.1007/11786986_27",
} | Proceedings Article | |
| | 2006 | | Reliable and Efficient Geometric Computing
In: Algorithms and Complexity : 6th Italian Conference, CIAC 2006, 1-2 | ch 061004: pdf nicht möglich herunterzuladen, login wird verlangt
http://dblp.uni-trier.de/rec/bibtex/conf/ciac/Mehlhorn06 / ch 060922
ProcDaten mit Books-DB abgeglichen / ch 060922 | Proceedings Article | |
| | 2006 | | Reply to "Backward Error Analysis ..."
In: Computational Science and Its Applications - ICCSA 2006, I, 60-60 | ch 061004: pdf nicht möglich herunterzuladen, login wird verlangt
ok - ch 060922: http://dblp.uni-trier.de/rec/bibtex/conf/iccsa/KettnerMPSY06
Proc.Daten aus Books-DB | Proceedings Article | |
| | 2005 | | A Descartes algorithm for polynomials with bit-stream coefficients
In: Computer Algebra in Scientific Computing : 8th International Workshop, CASC 2005, 138-149 | ok / ch051114
paper eingefügt / ch061109 | Proceedings Article | |
| | 2005 | | A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs
In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science, 654-665 | ch - ok/ch050425 | Proceedings Article | |
| | 2005 | | Certifying Algorithms (draft) | Opus in der Entstehungsphase (Telefonat mit Arno Eigenwillig, eigentlich im Zusammenhang mit einem anderen paper mit ihm angesprochen) / ch060420 | Unpublished/Draft | |
| | 2005 | | Controlled Perturbation for Delaunay Triangulations
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 1047-1056 | ch - ok/ch050425 | Proceedings Article | |
| | 2005 | | EXACUS: Efficient and exact algorithms for curves and surfaces
In: 13th Annual European Symposium on Algorithms (ESA 2005), 155-166 | ok / ch051116
STATUS: accepted (01.08.05)
Copyright muss noch geklaert werden!
Botz, 22.07.05:
Die im CTA genannte URL der LNCS ist gar nicht mehr aktuell. Wahrscheinlich
handelt es sich auch um eine alte Copyright Form. Der Link zu LNCS lautet:
http://www.springerlink.com/openurl.asp?genre=journal&issn=0302-9743
Die von mir gefundene Copyright Policy von Springer ist hier
http://www.springeronline.com/sgw/cda/pageitems/document/cda_downloaddocumen
t/0,11996,0-0-45-69724-0,00.pdf
zu finden.
Dort steht ausdrücklich:
"An author may self-archive an author-created version of his/her article on
his/her own website and his/her institution’s repository, including his/her final
version"
Ich werde das Thema aber beim Treffen mit den Springer-Leuten nächste Woche
ansprechen.
Bib 01.08.05:
welche Version? - Springer will Link auf Orig.?
Bestimmungen fuer LNCS sind nicht identisch mit Journal CTA
Angegebene URL ist aktuell!!! (Mail an Herrn Botz 01.08.05) | Proceedings Article | |
| | 2005 | | Harald Ganzinger : 31.10.1950 - 3.6.2004
In: MPG-Jahrbuch, 107-108
In: Jahrbuch / Max-Planck-Gesellschaft [?], 107-108 | ch 061031 :
Achtung: mir lag das Jahrbuch noch nicht vor!
Quelle: http://bvba2.bib-bvb.de/V/P5AXT9U4MAAXL1PAPL261APFCPLI3XULQNYGXNBUSVJ1UDG2II-19380?func=full&set_number=039321&set_entry=000002&format=999
| Part of a Book | |
| | 2005 | | Implementing Minimum Cycle Basis Algorithms
In: Experimental and Efficient Algorithms, 4th InternationalWorkshop, WEA 2005, 32-43 | ok / ch051103
| Proceedings Article | |
| | 2005 | | Minimum Cycle Bases and Surface Reconstruction
In: Graph Drawing: 13th International Symposium, GD 2005, ,, 532-532 | ok - ch 060922:
- http://dblp.uni-trier.de/rec/bibtex/conf/gd/Mehlhorn05
- ProcDaten aus Books-DB | Proceedings Article | |
| | 2005 | | Network Problems with Non-Polynomial Weights and Applications | Titel existiert laut google nur am MPI => nirgends sonst erschienen. ch / 060619 | Unpublished/Draft | |
| | 2005 | | New Constructions of (alpha, beta)-Spanners and Purely Additive Spanners
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 672-681 | ok / ch051114
q/ch050425 - seitenzahl ergänzen! | Proceedings Article | |
| | 2005 | | Pareto Optimality in House Allocation Problems
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 1163-1175 | ok - ch 060922:
- http://dblp.uni-trier.de/rec/bibtex/conf/isaac/AbrahamCMM05
- gemäß Papierfassung korrigiert | Proceedings Article | |
| | 2005 | | Popular Matchings
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 424-432 | ch - ok/ch-050425 | Proceedings Article | |
| | 2005 | | Structural filtering: a paradigm for efficient and exact geometric programs
In: Computational Geometry [31], 179-194 | ch 060922:
- http://dblp.uni-trier.de/rec/bibtex/journals/comgeo/FunkeMN05 | Journal Article | |
| | 2005 | | Towards Optimal Multiple Selection
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 103-114 | ok - ProcDaten aus Books-DB übertragen, abstract + pdf-File übertragen / ch061004 | Proceedings Article | |
| | 2004 | | A Faster Algorithm for Minimum Cycle Basis of Graphs
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 846-857 | | Proceedings Article | |
| | 2004 | | An Empirical Comparison of Software for Constructing Arrangements of Curved Arcs | | Report | |
| | 2004 | | An optimal algorithm for finding edge segment adjacencies in configurations of convex polygons | ok - aus Kurts Publikationsliste, incl. attachment / ch 060914 | Unpublished/Draft | |
| | 2004 | | Classroom Examples of Robustness Problems in Geometric Computations | | Report | |
| | 2004 | | Classroom Examples of Robustness Problems in Geometric Computations
In: ESA 2004: 12th Annual European Symposium on Algorithms, 702-713 | ch - ok/ch050422 | Proceedings Article | |
| | 2004 | | EXACUS: Efficient and Exact Algorithms for Curves and Surfaces | | Report | |
| | 2004 | | Matching Algorithms Are Fast in Sparse Random Graphs
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 81-92 | ok/ch050523 | Proceedings Article | |
| | 2004 | | New Bounds for the Descartes Method | | Report | |
| | 2004 | | Pareto-optimality in house allocation problems
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 3-15 | to appear/ch050501
restl. daten eingetragen - ok / ch051103 | Proceedings Article | |
| | 2004 | | Point Containment in the Integer Hull of a Polyhedron
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 929-933 | | Proceedings Article | |
| | 2004 | | Polyline Fitting of Planar Points Under Min-sum Criteria
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 77-88 | ok/ch050501 | Proceedings Article | |
| | 2004 | | Rank-Maximal Matchings
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 68-75 | | Proceedings Article | |
| | 2004 | | Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 222-233 | | Proceedings Article | |
| | 2004 | | The LEDA class real number -- extended version | | Report | |
| | 2003 | | A Heuristic for Dijkstra's Algorithm With Many Targets and its Use in Weighted Matching Algorithms
In: Algorithmica [36], 75-88 | ok | Journal Article | |
| | 2003 | | An Efficient Algorithm for the Configuration Problem of Dominance Graphs
In: Journal of Algorithms [48], 194-219 | ok - 9.6.04 | Journal Article | |
| | 2003 | | Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation | | Report | |
| | 2003 | | Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation
In: Algorithms - ESA 2003: 11th Annual European Symposium, 654-666 | ok | Proceedings Article | |
| | 2003 | | Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 158-167 | Proc.Daten mit Books-DB abgeglichen + pdf übertragen / ch 060911 | Proceedings Article | |
| | 2003 | | Certifying and Repairing Solutions to Large LPs - How Good are LP-Solvers?
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 255-256 | ok | Proceedings Article | |
| | 2003 | | Infimaximal frames: A technique for making lines look like segments
In: International Journal of Computational Geometry & Applications [13], 241-255 | ok | Journal Article | |
| | 2003 | | Optimal Search for Rationals
In: Information Processing Letters [86], 23-26 | ok | Journal Article | |
| | 2003 | | Scanning Multiple Sequences via Cache Memory
In: Algorithmica [35], 75-93 | ok - ch 061004:
- Abstract eingefügt + pdf ausgetauscht
- mit Springer-Webseite abgeglichen
Mehlhorn_a_2003_i.pdf ist Verlagsversion | Journal Article | |
| | 2003 | | Smoothed Analysis of Three Combinatorial Problems
In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, 198-207 | ok | Proceedings Article | |
| | 2003 | | The Reliable Algorithmic Software Challenge RASC
In: Experimental and efficient algorithms : Second International Workshop, WEA 2003, 222-222 | 060925:
- aus DBLP; http://dblp.uni-trier.de/rec/bibtex/conf/wea/Mehlhorn03
- Abstract & Links zu Springer ergänzt | Proceedings Article | |
| | 2003 | | The reliable algorithmic software challenge RASC : dedicated to Thomas Ottmann on the occassion of his 60th birthday
In: Computer Science in Perspective : essays dedicated to Thomas Ottmann, 255-263 | ok | Part of a Book | |
| | 2002 | | A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 174-186 | erledigt / bc 09.05.03 | Proceedings Article | |
| | 2002 | | All-Pairs Shortest-Paths Computation in the Presence of Negative Cycles
In: Information Processing Letters [81], 341-343 | q | Journal Article | |
| | 2002 | | Exact geometric computation
In: HERCMA 2001 : proceedings of the 5th Hellenic-European Conference on Computer Mathematics and its Applications (HERCMA-01), 87-87 | q
http://www.informatik.uni-trier.de/~ley/db/conf/hercma/hercma2001.html#Mehlhorn01
http://dblp.uni-trier.de/rec/bibtex/conf/hercma/Mehlhorn01 | Proceedings Article | |
| | 2002 | | External-Memory Breadth-First Search with Sublinear I/O
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 723-735 | erledigt / bc 09.05.03 -- q | Proceedings Article | |
| | 2002 | | Implementation of $O(nm \log n)$ Weighted Matchings in General Graphs: The Power of Data Structures
In: Proceedings of the n?th Conference on,
In: Journal of Experimental Algorithmics [7], | q - 11.9.: no pages! deshalb bleibt das Feld leer. (ch)
-- bis auf: "pages: online" | Electronic Journal Article | |
| | 2002 | | LOOK - A Lazy Object-Oriented Kernel for Geometric Computation
In: Computational Geometry - Theory and Applications [22], 99-118 | q | Journal Article | |
| | 2002 | | SCIL - Symbolic Constraints in Integer Linear Programming.
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 75-87 | q | Proceedings Article | |
| | 2001 | | A Heuristic for Dijkstra's Algorithm With Many Targets and its Use in Weighted Matching Algorithms
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 242-253 | | Proceedings Article | |
| | 2001 | | A Remark on the Sign Variation Method for Real Root Isolation | ok - aus Kurts Publikationsliste, incl. attachment / ch 060914 | Unpublished/Draft | |
| | 2001 | | A Separation Bound for Real Algebraic Expressions
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 254-265 | | Proceedings Article | |
| | 2001 | | An Efficient Algorithm for the Configuration Problem of Dominance Graphs
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 815-824 | | Proceedings Article | |
| | 2001 | | CNOP - A Package for Constrained Network Optimization
In: Algorithm engineering and experimentation (ALENEX-01) :Third International Workshop ALENEX 2001 ; revised papers, 17-31 | ok - Eintrag nun korrekt; pdf ausgetauscht / ch 060831 | Proceedings Article | |
| | 2001 | | Exact computation with leda_real - Theory and geometric applications
In: Symbolic Algebraic Methods and Verification Methods, 163-172 | ch 060831: http://dblp.uni-trier.de/rec/bibtex/books/sp/alefeld01/MehlhornS01
2001/2002 (ich weiß nicht, wer das geschrieben hat / ch 060831):
laut Aussage von Kurt noch nicht erschienen | Part of a Book | |
| | 2001 | | From Algorithm to Program to Software Library
In: Informatics : 10 years back, 10 years ahead, 268-273 | ch 060901: Links zum Downloaden: http://www.springerlink.com/content/4t3axnl7w9uc9p53/fulltext.pdf | Part of a Book | |
| | 2001 | | Furthest site abstract Voronoi diagrams
In: International Journal of Computational Geometry & Applications [11], 583-616 | | Journal Article | |
| | 2001 | | Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems
In: International Journal of Computational Geometry & Applications [11], 305-337 | | Journal Article | |
| | 2001 | | Traveling Salesman-Based Curve Reconstruction in Polynomial Time
In: SIAM Journal on Computing [31], 27-66 | ok - Eintrag mit Webseite abgeglichen / ch 061004 | Journal Article | |
| | 2000 | | A polyhedral approach to sequence alignment problems
In: Discrete Applied Mathematics [104], 143-186 | | Journal Article | |
| | 2000 | | A Polynomial-Time Fragment of Dominance Constraints
In: Proceedings of the 38th Annual Meeting of the Association of Computational Linguistics (ACL-00), 368-375 | [Hauptbd.] aus Titel entfernt | Proceedings Article | |
| | 2000 | | A strong and easily computable separation bound for arithmetic expressions involving radicals
In: Algorithmica [27], 87-99 | | Journal Article | |
| | 2000 | | Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model
In: Random Structures & Algorithms [16], 33-46 | | Journal Article | |
| | 2000 | | Constraint Programming and Graph Algorithms
In: Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00), 571-575 | | Proceedings Article | |
| | 2000 | | Curve reconstruction: Connecting dots with good reason
In: Computational Geometry [15], 229-244 | Mehlhorn139.pdf=Verlagsversion
139.pdf=Autorenversion | Journal Article | |
| | 2000 | | Editorial
In: Computational Geometry [17], 1-2 | Vorwort d. Hrsg.??? | Journal Article | |
| | 2000 | | Experiments on curve reconstruction
In: Proceedings of 2nd Workshop on Algorithm Engineering and Experiments (ALENEX-00), 103-114 | ok - ch 061004: neue Links gefunden und eingesetzt.
ch 061004: falsche Links entfernt, nur zur Sicherheit hier vermerkt:
URL of the conference:
http://www.cs.unm.edu/Conferences/ALENEX00/
URL for downloading:
http://www.cs.unm.edu/Conferences/ALENEX00/proceedings.html
URL of the table of contents:
http://www.cs.unm.edu/Conferences/ALENEX00/proceedings.html
URL for Reference:
Table of Contents
ok / 060912 ch : http://www.cs.unm.edu/~moret/ALENEX00/proceedings.html
nur im Internet
URL ist falsch!!! und nun? Papers sollen auch in JEA ersch. (Online-Journal von ACM, Zugriff funktioniert nicht)
lt. Ernst Althaus nur online ersch.
URL wird geprueft | Electronic Proceedings Article | |
| | 2000 | | Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint
In: Principles and practice of constraint programming - CP 2000 (CP-00) : 6th international conference, CP 2000, 306-319 | | Proceedings Article | |
| | 2000 | | Geometric Computing with CGAL and LEDA
In: Curve and surface design, Saint-Malo 1999, 277-286 | | Proceedings Article | |
| | 2000 | | Implementation of $O(nm \log n)$ weighted matchings: The power of data structures
In: 4th International Workshop on Algorithm Engineering, 23-38 | | Proceedings Article | |
| | 2000 | | LOOK - a Lazy Object-Oriented Kernel for Geometric Computation
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 156-165 | | Proceedings Article | |
| | 2000 | | Resource Constrained Shortest Paths
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 326-337 | | Proceedings Article | |
| | 2000 | | TSP-Based Curve Reconstruction in Polynomial Time
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 686-695 | | Proceedings Article | |
| | 1999 | | A correctness certificate for the Stoer-Wagner min-cut algorithm
In: Information Processing Letters [70], 251-254 | ok - ch 061004 :
- der Titel ist wirklich auch auf der Webseite mit dem Artikel klein gedruckt
- abgeglichen mit Artikel auf der Webseite
- pdf eingesetzt
Aufergänzt aus dem Internet / ch060828 | Journal Article | |
| | 1999 | | An analysis of the highest-level selection rule in the preflow-push max-flow algorithm
In: Information Processing Letters [69], 239-242 | ok - ch 061004
Eintrag nun korrekt; pdf ausgetauscht / ch 060831
Aufergänzt aus dem Internet / ch 060828
Mehlhorn_a_1999_b.pdf=Verlagsversion
140.pdf=Autorenversion | Journal Article | |
| | 1999 | | Checking geometric programs or verification of geometric structures
In: Computational Geometry: Theory and Applications [12], 85-104 | | Journal Article | |
| | 1999 | | Checking Priority Queues
In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 901-902 | Proc.Daten aus der Books-DB / ch 060828 | Proceedings Article | |
| | 1999 | | Curve reconstruction: Connecting dots with good reason
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 197-206 | | Proceedings Article | |
| | 1999 | | Editorial
In: Computational Geometry [12], 153-154 | | Journal Article | |
| | 1999 | | Efficient exact geometric computation made easy
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 341-350 | | Proceedings Article | |
| | 1999 | | I/O-optimal computation of segment intersections
In: Proceedings of the DIMACS Workshop on External Algorithms and Visualization, 131-138 | | Proceedings Article | |
| | 1999 | | LEDA-SM : Extending LEDA to Secondary Memory
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 228-242 | ok / ch 061004
Eintrag nun korrekt; pdf ausgetauscht / ch 060831
aus Books-DB aufergänzt | Proceedings Article | |
| | 1999 | | LEDA: a platform for combinatorial and geometric computing | ch 060929: For a nice Review see http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6TYR-43T8SFG-1&_coverDate=11%2F30%2F2002&_alid=458295915&_rdoc=1&_fmt=&_orig=search&_qd=1&_cdi=5625&_sort=d&view=c&_acct=C000004638&_version=1&_urlVersion=0&_userid=43521&md5=d0fe1014ee023ed44d7a3310045103fb | Book | |
| | 1999 | | On the Expected Depth of Random Circuits
In: Combinatorics, Probability and Computing [8], 209-228 | gefunden: Collection of Computer Science Bibliographies; vervollständigt aus dem Internet / ch 060828 | Journal Article | |
| | 1999 | | Structural Filtering: a Paradigm for Efficient and Exact Geometric Programs
In: Abstracts for the 11th Canadian Conference on Computational Geometry (CCCG-99), 39-42 | | Proceedings Article | |
| | 1999 | | Ten Years of LEDA Some Thoughts (Abstract)
In: Algorithm engineering (WAE-99) : 3rd International Workshop, 14-14 | Übertrag aus DBLP und Books-DB / ch 060828 | Proceedings Article | |
| | 1999 | | The Engineering of Some Bipartite Matching Programs
In: Algorithms and computation : 10th International Symposium, ISAAC'99, 1-3 | | Proceedings Article | |
| | 1999 | | The Engineering of Some Bipartite Matching Programs
In: Foundations of software technology and theoretical computer science : 19th conference, 446-449 | ok - ch 060925:
- http://dblp.uni-trier.de/rec/bibtex/conf/fsttcs/Mehlhorn99
- ProcDaten aus BooksDB
- mit Papierfassung abgeglichen
@proceedings{DBLP:conf/fsttcs/1999,
editor = {C. Pandu Rangan and
Venkatesh Raman and
R. Ramanujam},
title = {Foundations of Software Technology and Theoretical Computer
Science, 19th Conference, Chennai, India, December 13-15,
1999, Proceedings},
booktitle = {FSTTCS},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {1738},
year = {1999},
isbn = {3-540-66836-5 | Proceedings Article | |
| | 1998 | | A computational basis for higher-dimensional computational geometry and applications
In: Computational Geometry: Theory and Applications [10], 289-304 | | Journal Article | |
| | 1998 | | A Parallelization of Dijkstra's Shortest Path Algorithm
In: Proceedings of the 23rd International Symposium on the Mathematical Foundations of Computer Science (MFCS-98), 722-731 | | Proceedings Article | |
| | 1998 | | Amortisierte Analyse
In: Prinzipien des Algorithmenentwurfs, 91-102 |
ch 060913 : gefunden in Kurts Publikationsliste, eingetragen gemäß GBV und
http://www.ubka.uni-karlsruhe.de/hylib-bin/suche.cgi?opacdb=UBKA_OPAC&simple_search=&field1=TI&name1=Prinzipien+des+Algorithmenentwurfs&opt1=AND&field2=AR&name2=Thomas+Ottmann&opt2=AND&field3=PY&name3=&Aktion=Suchen&Suchmodus=&SE_Fachgebiet=&seit=
Th. Ottmann: Prinzipien des Algorithmenentwurfs. Multimediales Buch mit Beiträgen von A. Brüggemann-Klein, J. Eckerle, A. Heinz, R. Klein, K. Mehlhorn,Th. Roos, S. Schuierer, P. Widmayer, Spektrum Akademischer Verlag, Bd. 244, Dezember 1997
Ottmann, Thomas [Hrsg.]
Prinzipien des Algorithmenentwurfs / Thomas Ottmann (Hrsg.). - Heidelberg [u.a.] : Spektrum, Akad. Verl., 1998. - XII, 228 S. : graph. Darst. & 2 CD-ROMs : 12 cm; (ger)
(Spektrum-Lehrbuch)
ISBN:
Schlagwörter: Algorithmus / Entwurf / Aufgabensammlung
Algorithmus / Entwurf / Aufgabensammlung / CD-ROM
| Part of a Book | |
| | 1998 | | From Algorithms to Working Programs on the Use of Program Checking in LEDA
In: Fundamentals - foundations of computer science : XV. IFIP world computer congress, 81-88 | Proc.Daten übertragen aus Books-DB / ch 060725 | Proceedings Article | |
| | 1998 | | From Algorithms to Working Programs: On the Use of Program Checking in LEDA
In: Mathematical foundations of computer science (MFCS-98) : 23rd international symposium, 84-93 | aus bib; not-mpi pruefen!
ansonsten: ok
ProcDaten aus der Books-DB + pdf übertragen / ch060906 | Proceedings Article | |
| | 1998 | | Maximum Network Flow with Floating Point Arithmetic
In: Information Processing Letters [66], 109-113 | Abgleich über die Internetseite / ch 060828
http://www.sciencedirect.com/science?_ob=MImg&_imagekey=B6V0F-3TP137J-1-6&_cdi=5645&_user=43521&_orig=browse&_coverDate=05%2F15%2F1998&_sk=999339996&view=c&wchp=dGLzVzz-zSkzV&md5=17c3790dbda005248c45d3174921510f&ie=/sdarticle.pdf | Journal Article | |
| | 1998 | | Randomized External-Memory Algorithms for some Geometric Problems
In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), 259-268 | | Proceedings Article | |
| | 1997 | | A Branch-And-Cut algorithm for multiple sequence alignment
In: Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB-97), 241-250 | | Proceedings Article | |
| | 1997 | | A complete roundness classification procedure
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 129-138 | | Proceedings Article | |
| | 1997 | | A Computational Basis for Higher-dimensional Computational Geometry and Applications
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 254-263 | | Proceedings Article | |
| | 1997 | | A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots
In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97), 702-709 | | Proceedings Article | |
| | 1997 | | Average-case complexity of shortest-paths problems in the vertex-potential model
In: International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-97), 15-26 | | Proceedings Article | |
| | 1997 | | Kürzeste-Wege-Berechnung bei sehr großen Datenmengen
In: Promotion tut not: Innovationsmotor "Graduiertenkolleg", 113-132 | | Proceedings Article | |
| | 1997 | | Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time
In: Algorithmica [17], 183-198 | | Journal Article | |
| | 1997 | | On the All-Pairs Shortest-Path Algorithm of Moffat and Takaoka
In: Random Structures Algorithms [10], 205-220 | ch 060828: http://dblp.uni-trier.de/db/journals/rsa/rsa10.html#MehlhornP97
http://dblp.uni-trier.de/rec/bibtex/journals/rsa/MehlhornP97 | Journal Article | |
| | 1997 | | Runtime Prediction of Real Programs on Real Machines
In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97), 380-389 | | Proceedings Article | |
| | 1997 | | The LEDA platform for combinatorial and geometric computing
In: Proceedings of the 24th International Colloquium on Automata, Languages, and Programming (ICALP-97), 7-16 | ch 060828 : http://dblp.uni-trier.de/db/conf/icalp/icalp97.html#MehlhornNU97
http://dblp.uni-trier.de/rec/bibtex/conf/icalp/MehlhornNU97
(uwe (?) : )
gefunden durch Bibliotheksabgleich | Proceedings Article | |
| | 1996 | | A Method for Obtaining Randomized Algorithms with Small Tail Probabilities
In: Algorithmica [16], 543-547 | ok - abgeglichen mit download-Datei von Springer / ch 060823
einfügen des pdf's / ch 060918
DB Books: Dokumentnummer: P-96-51 | Journal Article | |
| | 1996 | | Algorithms for Dense Graphs and Networks on the Random Access Computer
In: Algorithmica [15], 521-549 | | Journal Article | |
| | 1996 | | An o(n³)-Time Maximum-Flow-Algorithm: Can a Maximum Flow be Computed in o(nm) Time?
In: SIAM Journal on Computing [25], 1144-1170 | | Journal Article | |
| | 1996 | | Checking Geometric Programs or Verification of Geometric Structures
In: 12th Annual ACM Symposium on Computational Geometry (SCG 96), 159-165 | | Proceedings Article | |
| | 1996 | | Komplexitätstheorie und Algorithmik
In: Informatik : Grundlagen - Anwendungen - Perspektiven, 113-116 | | Proceedings Article | |
| | 1996 | | On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm
In: Algorithmica [16], 233-242 | | Journal Article | |
| | 1996 | | Position Paper for Panel Discussion
In: Applied Computational Geormetry, Towards Geometric Engineering, FCRC'96 Workshop, WACG'96, Selected Papers, 51-52 | ch 060823 - abgeglichen mit:
http://dblp.uni-trier.de/rec/bibtex/conf/wacg/Mehlhorn96 | Proceedings Article | |
| | 1996 | | The LEDA Platform for Combinatorial and Geometric Computing
In: Beherrschung von Informationssystemen : Tagungsband der Informatik '96 ; GI - 26. Jahrestagung, 43-50 | ok (nach bestem Wissen und Gewissen, soweit das bei verschiedenen Angaben möglich ist, ohne ein Papierfassung vorligen zu haben ... ) - ch 060925
Quellen:
- http://dblp.uni-trier.de/rec/bibtex/conf/gi/MehlhornNU96
- http://www.informatik.uni-trier.de/~ley/db/conf/gi/gi96.html
- GBV und SWB | Proceedings Article | |
| | 1996 | | The LEDA Platform of Combinatorial and Geometric Computing
In: Proceedings of Conference on Computing: The Australian Theory Symposium, 126-126 | | Proceedings Article | |
| | 1995 | | A communication-randomness tradeoff for two-processor systems
In: Information and Computation [116], 155-161 | | Journal Article | |
| | 1995 | | Exact Geometric Computation in LEDA
In: 11th ACM Symposium on Computational Geometry (SCG95), C18-C19 | http://doi.acm.org/10.1145/220279.220330 | Proceedings Article | |
| | 1995 | | Experiences with the implementation of geometric algorithms
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 518-518 | | Proceedings Article | |
| | 1995 | | Guest Editor's Foreword
In: Discrete and Computational Geometry [14], 363-363 | ch 060823: http://dblp.uni-trier.de/db/journals/dcg/dcg14.html#Mehlhorn95
http://dblp.uni-trier.de/rec/bibtex/journals/dcg/Mehlhorn95 | Journal Article | |
| | 1995 | | LEDA : A Platform for Combinatorial and Geometric Computing | ok - gefunden via Dagstuhl-Bib; Verfasser = Mehlhorn / ch 060927 | Report | |
| | 1995 | | LEDA: A Platform for Combinatorial and Geometric Computing
In: Communications of the ACM [38], 96-102 | | Journal Article | |
| | 1995 | | Lower bounds for set intersection queries
In: Algorithmica [14], 154-168 | | Journal Article | |
| | 1995 | | On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka
In: Algorithms - ESA'95: 3rd Annual European Symposium, 185-198 | | Proceedings Article | |
| | 1994 | | A linear-time algorithm for the homotopic routing problem in grid graphs
In: SIAM Journal on Computing [23], 227-246 | | Journal Article | |
| | 1994 | | A lower bound for area-universal graphs
In: Information Processing Letters [51], 101-105 | | Journal Article | |
| | 1994 | | Dynamic Perfect Hashing: Upper and Lower Bounds
In: SIAM Journal on Computing [23], 738-761 | | Journal Article | |
| | 1994 | | Dynamic point location in general subdivisions
In: Journal of Algorithms [3], 342-380 | | Journal Article | |
| | 1994 | | How to Compute the Voronoi Diagram of Line Segments:
Theoretical and Experimental Results
In: Algorithms (ESA-94) : 2nd annual European symposium, 227-239 |
booktitle = "",
editor = "Jan van Leeuwen",
address = "Utrecht, The Netherlands",
month = "26--28~" # sep,
year = "1994",
ISBN = "ISBN ",
pages = "" | Proceedings Article | |
| | 1994 | | Introduction
In: Journal of Symbolic Computation [17], 295-295 | ok - mit Journal überprüft / ch 060914
aus DB aufergänzt Aug 2005 /ch
"Special Issue on Algorithms: Implementation, Libraries and Use" | Journal Article | |
| | 1994 | | Maintaining dynamic sequences under equality-tests in polylogarithmic time
In: Discrete algorithms (SODA-94) : 5th annual ACM-SIAM symposium, 213-222 | | Proceedings Article | |
| | 1994 | | On degeneracy in geometric computations
In: Discrete algorithms (SODA-94) : 5th annual ACM-SIAM symposium, 16-23 | | Proceedings Article | |
| | 1994 | | The Implementation of Geometric Algorithms
In: Technology and foundations : Information Processing '94 ; proceedings of the IFIP 13th World Computer Congress, 223-231 | | Proceedings Article | |
| | 1993 | | A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron | ok - Papierfassung / ch 060920
übertragen aus der Books-DB / ch060726 | Report | |
| | 1993 | | A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron
In: Algorithms and data structures (WADS-93) : 3rd workshop, 314-324 | | Proceedings Article | |
| | 1993 | | Dynamic Interpolation Search
In: Journal of the ACM [40], 621-634 | | Journal Article | |
| | 1993 | | Exact Algorithms for a Geometric Packing Problem (Extended Abstract)
In: Theoretical aspects of computer science (STACS-93) : 10th annual symposium, 317-322 | | Proceedings Article | |
| | 1993 | | Four Results on Randomized Incremental Constructions
In: Computational Geometry: Theory and Applications [3], 185-212 | | Journal Article | |
| | 1993 | | Lower Bounds for Set Intersection queries
In: Discrete algorithms (SODA-93) : 4th annual ACM-SIAM symposium, 194-201 | | Proceedings Article | |
| | 1993 | | Maintaining Discrete Probability Distributions Optimally
In: Automata, languages and programming (ICALP-93) : 20th international colloquium, 253-264 | | Proceedings Article | |
| | 1993 | | Randomized incremental construction of abstract Voronoi diagrams
In: Computational Geometry: Theory and Applications [3], 157-184 | | Journal Article | |
| | 1993 | | Searching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets
In: Foundations of software technology and theoretical computer science (FSTTCS-93) : 13th conference, 436-443 | | Proceedings Article | |
| | 1993 | | Tail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection
In: Computational Geometry: Theory and Applications [3], 235-246 | | Journal Article | |
| | 1992 | | A lower bound for the nondeterministic space complexity of context-free recognition
In: Information Processing Letters [42], 25-27 | | Journal Article | |
| | 1992 | | Algorithm Design and Software Libraries: Recent Developments in the LEDA Project
In: Proceedings of the IFIP 12th World Computer Congress. Volume 1: Algorithms, Software, Architecture, 493-508 | | Proceedings Article | |
| | 1992 | | Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
In: Algorithmica [8], 391-408 | | Journal Article | |
| | 1992 | | Dynamic Point Location in General Subdivisions
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 250-258 | | Proceedings Article | |
| | 1992 | | Four Results on Randomized Incremental Constructions
In: Theoretical aspects of computer science (STACS-92) : 9th annual symposium, 463-474 | | Proceedings Article | |
| | 1992 | | On local routing of two-terminal nets
In: Journal of Combinatorial Theory / Series B [55], 33-72 | | Journal Article | |
| | 1992 | | Randomized incremental construction of abstract Voronoi diagrams
In: Informatik---Festschrift zum 60.~Geburtstag von Günter Hotz, 283-308 | series = "Teubner-Texte zur Informatik", | Part of a Book | |
| | 1992 | | Recent Developments in Algorithms for the Maximum Flow Problem (Abstract)
In: Proceedings of Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1992), 404-404 | | Proceedings Article | |
| | 1992 | | Selected Topics from Computational Geometry, Data Structures and Motion Planning
In: Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative, 25-43 | | Part of a Book | |
| | 1992 | | Simultaneous Inner and Outer Approximation of Shapes
In: Algorithmica [8], 365-389 | | Journal Article | |
| | 1992 | | Tail Estimates for the Space Complexity of Randomised Incremental Algorithms
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 89-93 | | Proceedings Article | |
| | 1992 | | $k$ versus $k+1$ Index Registers and Modifiable versus Non-modifiable Programs
In: Information and Computation [101], 123-129 | | Journal Article | |
| | 1991 | | A Method for Obtaining Randomized Algorithms with Small Tail Probabilities | ok - mit Papierfassung abgeglichen (dort ist der Titel nicht ganz korrekt) / ch 060925
ok - übertragen des pdf files / ch 060918
übertragen aus der Books-DB / ch 060726 | Report | |
| | 1991 | | A Time-Randomness Tradeoff for Communication Complexity
In: Distributed Algorithms, 4th International Workshop, 390-401 | | Proceedings Article | |
| | 1991 | | Computing a maximum cardinality matching in a bipartite graph in time $O(n^1.5 \sqrtm/\log n)$
In: Information Processing Letters [37], 237-240 | | Journal Article | |
| | 1991 | | Constructive Whitney-Graustein theorem, or how to untangle closed planar curves
In: SIAM Journal on Computing [20], 603-621 | | Journal Article | |
| | 1991 | | Dynamic Perfect Hashing: Upper and Lower Bounds | ok - aus dem Internet übertragen; kein pdf gefunden / ch 060918 | Report | |
| | 1991 | | On the construction of abstract Voronoi diagrams
In: Discrete & Computational Geometry [6], 211-224 | | Journal Article | |
| | 1990 | | A faster compaction algorithm with automatic jog insertion
In: IEEE Transactions on CAD of Integrated Circuits and Systems [9], 158-166 | ok - kein pdf-file online abrufbar, nur abstract / ch 060912 | Journal Article | |
| | 1990 | | Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures
In: Computational geometry (SCG-90) : 6th annual symposium, 281-289 | (ch 060324) noch zu prüfen: http://purl.org/CITIDEL/DBLP/db/conf/compgeom/compgeom90.html#AltFKMNSU90 | Proceedings Article | |
| | 1990 | | Bounded ordered dictionaries in $O(\log \log n)$ time and $O(n)$ space
In: Information Processing Letters [35], 183-189 | | Journal Article | |
| | 1990 | | Can A Maximum Flow be Computed in o(nm) Time?
In: Automata, languages and programming (ICALP-90) : 17th international colloquium, 235-248 | ProcDaten mit BooksDB abgeglichen / ch 060912 | Proceedings Article | |
| | 1990 | | Can a maximum flow be computed in $o(nm)$ time? | | Report | |
| | 1990 | | Compaction on the torus
In: IEEE Transactions on CAD of Integrated Circuits and Systems [9], 389-397 | ok - kein pdf-file online abrufbar / ch 060912 | Journal Article | |
| | 1990 | | Data Structures
In: Handbook of Theoretical Computer Science, 301-341 | wie einzusortieren? (ch 060324)
@InCollection{Mehlhorn$^+$90,
author = "Kurt Mehlhorn and A. Tsakalidis",
title = "Data Structures",
pages = "301--341",
>> booktitle = "Handbook of Theoretical Computer Science",
editor = "Jan van Leeuwen",
>> volume = "A: Algorithms and Complexity",
publisher = "Elsevier/MIT Press",
address = "Amsterdam",
year = "1990",
chapter = "6",
refersto = "See \cite{Leeuwen90}.",
} | Part of a Book | |
| | 1990 | | Dynamic deferred data structuring
In: Information Processing Letters [35], 37-40 | | Journal Article | |
| | 1990 | | Dynamic Fractional Cascading
In: Algorithmica [5], 215-241 | | Journal Article | |
| | 1990 | | Faster algorithms for the shortest path problem
In: Journal of the ACM [37], 213-223 | | Journal Article | |
| | 1990 | | Hidden line elimination for isooriented rectangles | gefunden via BVB / ch 061102 | Report | |
| | 1990 | | Hidden line elimination for isooriented rectangles
In: Information Processing Letters [35], 137-143 | (ch 060324) noch zu prüfen: http://purl.org/CITIDEL/DBLP/db/journals/ipl/ipl35.html#MehlhornNU90 | Journal Article | |
| | 1990 | | LEDA - A Library of Efficient Data Types and Algorithms
In: GI - 20. Jahrestagung I, Informatik auf dem Weg zum Anwender, 35-39 | | Proceedings Article | |
| | 1990 | | LEDA: A Library of Efficient Data Types and Algorithms
In: Automata, languages and programming (ICALP-90) : 17th international colloquium, 1-5 | (ch 23.3.06) falscher link: http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=443&spage=1 | Proceedings Article | |
| | 1990 | | On Simultaneous Inner and Outer Approximation of Shapes
In: Computational geometry (SCG-90) : 6th annual symposium, 216-224 | (ch 060324) noch zu prüfen: http://purl.org/CITIDEL/DBLP/db/conf/compgeom/compgeom90.html#FleischerMRWY90", | Proceedings Article | |
| | 1990 | | On the Complexity of a Game Related to the Dictionary Problem
In: SIAM Journal on Computing [19], 902-906 | | Journal Article | |
| | 1990 | | On the Construction of Abstract Voronoi Diagrams
In: Theoretical aspects of computer science (STACS-90) : 7th annual symposium, 227-239 | | Proceedings Article | |
| | 1990 | | On the Construction of Abstract Voronoi Diagrams, II
In: Algorithms (ISA-90) : 1st international symposium (SIGAL-90), 138-154 | ok / ch060324 | Proceedings Article | |
| | 1990 | | Routing problems in grid graphs
In: Paths, Flows, and VLSI-Layout, 165–184 | ok - aus Books-DB aufergänzt / ch 060918
Quelle: Kurts Literaturliste und http://www.springerlink.com/content/q047v021m52863h3/ ansonsten nicht via google zu finden, also auch kein pdf-file / ch 060912 | Part of a Book | |
| | 1989 | | A library of efficient data types and algorithms
In: Mathematical foundations of computer science (MFCS-89) : 14th international symposium, 88-106 | | Proceedings Article | |
| | 1989 | | AT$^2$-Optimal Galois Field Multiplier for VLSI
In: IEEE Transactions on Computers [38], 1333-1336 | | Journal Article | |
| | 1989 | | Data structures | gefunden via BVB / ch 061102 | Report | |
| | 1989 | | Foundations of Programming Languages | prüfen: URL = "http://www.mpi-sb.mpg.de/~mehlhorn/ProgLangBooks.html | Book | |
| | 1989 | | LEDA: A library of efficient data types and algorithms
In: Mathematical foundations of computer science (MFCS-89) : 14th international symposium, 88-106 | ok für Proceedings / ch 060327 | Proceedings Article | |
| | 1989 | | On the Complexity of a Game Related to the Dictionary Problem
In: 30th Annual Symposium on Foundations of Computer Science (FOCS 1989), 546-548 | Proc-Titel etc. aus dem GBV / ch 060405 | Proceedings Article | |
| | 1989 | | On the construction of abstract Voronoi diagrams | gefunden via KVK -> GBV / ch061102
Teil:
1: / K. Mehlhorn ; S. Meiser ; C. O'Dunlaing
Verfasser:
Mehlhorn, K. ; Meiser, S. ; O'Dunlaing, C.
Erschienen:
1989
Umfang:
14 S.
Schriftenreihe:
Reports / SAARBRUECKEN UNIV SAARLAND ; A 89/01
Report-Nr.:
A 89 01 | Report | |
| | 1989 | | On the construction of abstract Voronoi diagrams, II. | | Report | |
| | 1989 | | Routing Problems in Grid Graphs | ok - aus BiVis / Papierfassung / ch 060920 | Report | |
| | 1989 | | Routing problems in grid graphs | ch 061103:
- gefunden via BVB
- aufergänzt via KOBV (nach Suche im KVK) | Report | |
| | 1989 | | Two Versus One Index Register and Modifiable Versus Non-modifiable Programs
In: Automata, languages and programming (ICALP-89) : 16th international colloquium, 603-609 | | Proceedings Article | |
| | 1988 | | A faster approximation algorithm for the Steiner problem in graphs
In: Information Processing Letters [27], 125-128 | | Journal Article | |
| | 1988 | | A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphs | ok - aus BIVis / der Papierfassung / ch 060920 | Report | |
| | 1988 | | A Lower Bound on the Complexity of the Union-Split-Find Problem
In: SIAM Journal on Computing [17], 1093-1102 | | Journal Article | |
| | 1988 | | Compaction on the Torus | ok - aus BIVis / der Papierfassung / ch 060920 | Report | |
| | 1988 | | Compaction on the Torus
In: VLSI algorithms and architectures : 3rd Aegean Workshop on Computing, AWOC 88, 212-225 | | Proceedings Article | |
| | 1988 | | Congruence, Similarity, and Symmetries of Geometric Objects
In: Discrete and Computational Geometry [3], 237-256 | prüfen: http://dblp.uni-trier.de/db/journals/dcg/dcg3.html#AltMWW88 | Journal Article | |
| | 1988 | | Constructive Hopf's theorem: or how to untangle closed planar curves | ok - aus der Papierfassung aufergänzt / ch 060918
übertragen aus Books-DB / ch 060806 | Report | |
| | 1988 | | Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves
In: Automata, languages and programming (ICALP-88) : 15th international colloquium, 410-423 | | Proceedings Article | |
| | 1988 | | Datenstrukturen und effiziente Algorithmen, Band 1: Sortieren und Suchen | übertragen z.T. aus Book-DB, z.T. KVK / ch 060725
DB aufergänzt Aug 2005 /ch:
Quelle: http://liinwww.ira.uka.de/cgi-bin/bibshow (ch/3.8.05) | Book | |
| | 1988 | | Dynamic Perfect Hashing: Upper and Lower Bounds
In: 29th Annual Symposium on Foundations of Computer Science (FOCS 1988), 524-531 | prüfen: wirklich ohne editor? | Proceedings Article | |
| | 1988 | | Faster Algorithms for the Shortest Path Problem | ok - aufergänzt aus Papierfassung / ch 060920
übertragen aus der Book -DB / ch 060803 | Report | |
| | 1988 | | Faster Algorithms for the Shortest Path Problem | ok - 060927:
- gefunden via http://liinwww.ira.uka.de/bibliography/index.html
- http://72.14.221.104/search?q=cache:gXfS6FAu490J:www.mit.edu/~orc/research/reports/tr_1980s.html+193+%22Faster+Algorithms+for+the+Shortest+Path+Problem%22+Massachusetts&hl=de&gl=de&ct=clnk&cd=1 | Report | |
| | 1988 | | On Continuous Homotopic One Layer Routing
In: Computational geometry (SCG-88) : 4th symposium, 392-402 | ok - ch 061004 ; ProcDaten mit Books-DB abgeglichen.
Prüfen: Editor?
prüfen:
http://dblp.uni-trier.de/db/conf/compgeom/compgeom88.html#GaoJKMR89",
URL = "http://doi.acm.org/10.1145/73393.73433",
| Proceedings Article | |
| | 1988 | | On Continuous Homotopic One Layer Routing (Extended Abstract)
In: Computational geometry and its applications (CG-88) : international workshop, 55-70 | Proc aus Books-DB | Proceedings Article | |
| | 1988 | | Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees
In: Information Processing Letters [27], 227-236 | | Journal Article | |
| | 1988 | | SFB 124: VLSI-Entwurfsmethoden und Parallelität
In: GI - 18. Jahrestagung II, Vernetzte and komplexe Informatik-Systems, 3-29 | prüfen: http://dblp.uni-trier.de/db/conf/gi/gi88-2.html#MehlhornZ88 | Proceedings Article | |
| | 1988 | | Upper and Lower Bounds for the Dictionary Problem
In: Algorithm theory (SWAT-88) : 1st Scandinavian workshop, 214-215 | | Proceedings Article | |
| | 1987 | | A Faster Approximation Algorithm for the Steiner Problem in Graphs | ok - Seitenzahl aufergänzt aus Papierfassung / ch 060920
übertragen aus Books-DB / ch 060806 | Report | |
| | 1987 | | A faster compaction algorithm with automatic jog insertion | Seitenzahl fehlt!!!
übertragen aus der Books-DB / ch 060806 | Report | |
| | 1987 | | A Lower Bound for the Complexity of the Union-Split-Find Problem
In: Automata, Languages and Programming (ICALP-87) : 14th International Colloquium, 479-488 | ok - in DBLP gefunden, ProcDaten aus Books-DB, aus Papierfassung aufergänzt / ch 060921 | Proceedings Article | |
| | 1987 | | A $\log \log n$ data structure for three-sided range queries
In: Information Processing Letters [25], 269-273 | | Journal Article | |
| | 1987 | | Area-Time Optimal Division for $T=\Omega((\log n)^1+\epsilon)$
In: Information and Computation [72], 270-282 | nur abstract, kein pdf online erhältich; Titel wie im Paper siehe bei "Personal Comments", da der Titel nicht in dieser Form eingefügt werden kann / ch 060912 | Journal Article | |
| | 1987 | | Congruence, similarity and symmetries of geometric objects | | Report | |
| | 1987 | | Convergence, Similarity and Symmetries of Geometric Objects
In: Computational geometry (SCG-87) : 3rd symposium, 308-315 | SCG = Inv. 431
institution = "FU Berlin/U Saarlandes/TU Berlin/TU Graz",
Autoren korrigiert. UB | Proceedings Article | |
| | 1987 | | Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones
In: Parallel Algorithms and Architectures : International Workshop, 11-15 | in DBLP gefunden, aus Papierfassung aufergänzt / ch 060921
http://websok.libris.kb.se/websearch/showrecord;jsessionid=046CC02F4BAA278125C493CE4625A5D2?searchId=22729&nr=1 | Proceedings Article | |
| | 1987 | | Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: SIAM Journal on Computing [16], 808-835 | | Journal Article | |
| | 1987 | | On Local Routing of Two-Terminal Nets
In: STACS '87 : 4th Annual Symposium on Theoretical Aspects of Computer Science, 40-52 | | Proceedings Article | |
| | 1987 | | Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees | übertragen aus der SULB / ch 060806 | Report | |
| | 1986 | | A Lower Bound for the Complexity of the Union-Split-Find Problem | ok - aus Papierfassung die Seitenzahl aufergänzt / ch 060920
bei der SULB fehlt der 3. Autor ...
übertragen aus Books-DB / ch 060806 | Report | |
| | 1986 | | Algorithms for Routing in Planar Graphs
In: Acta Informatica [23], 163-176 | | Journal Article | |
| | 1986 | | An Amortized Analysis of Insertions into AVL-Trees
In: SIAM Journal on Computing [15], 22-33 | | Journal Article | |
| | 1986 | | Area-time Optimal Division for T=Omega(log n)$^1+epsilon$"
In: STACS 86, 3rd Annual Symposium on Theoretical Aspects of Computer Science, 341-352 | http://dblp.uni-trier.de/db/conf/stacs/stacs86.html#MehlhornP86", | Proceedings Article | |
| | 1986 | | AT$^2$-Optimal Galois Field Multiplier for VLSI
In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 217-225 | http://dblp.uni-trier.de/db/conf/awoc/awoc86.html#FurerM86 | Proceedings Article | |
| | 1986 | | Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proofs
In: Algorithmica [1], 213-221 | | Journal Article | |
| | 1986 | | Datenstrukturen und effiziente Algorithmen, Band 1: Sortieren und Suchen | übertragen z.T. aus Book-DB, z.T. KVK / ch 060725
DB aufergänzt Aug 2005 /ch:
Quelle: http://liinwww.ira.uka.de/cgi-bin/bibshow (ch/3.8.05) | Book | |
| | 1986 | | Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: Mathematical Foundations of Computer Science, 12th Symposium (MFCS 1986), 199-208 | | Proceedings Article | |
| | 1986 | | Dynamic fractional cascading | gefunden via BVB / ch 061102 | Report | |
| | 1986 | | Grundlagen der Programmiersprachen | aus Books-DB übertragen / ch060724 | Book | |
| | 1986 | | On BF-orderable graphs
In: Discrete Applied Mathematics [15], 315-327 | | Journal Article | |
| | 1986 | | On Local Routing of Two-Terminal Nets | ok - aus Papierfassung aufergänzt / ch 060922
aus BiVis übertragen / ch060920 | Report | |
| | 1986 | | Routing through a Generalized Switchbox
In: Journal of Algorithms [7], 510-531 | | Journal Article | |
| | 1986 | | Routing through a Rectangle
In: Journal of the ACM [33], 60-85 | ok - ch 061110 :
- abgeglichen mit http://portal.acm.org/citation.cfm?doid=4904.4994
- Abstract + keys + pdf eingefügt
| Journal Article | |
| | 1986 | | Sorting Jordan Sequences in Linear Time Using Level-Linked Search Trees
In: Information and Control [68], 170-184 | | Journal Article | |
| | 1986 | | Über Verdrahtungsalgorithmen
In: Informatik Spektrum [9], 227-234 | | Journal Article | |
| | 1986 | | VLSI Algorithms and Architectures, Aegean Workshop on Computing - >> Dublette
In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 328 | | Proceedings | |
| | 1986 | | VLSI Algorithms and Architectures, Aegean Workshop on Computing - >> Dublette
In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 328 | | Proceedings | |
| | 1986 | | VLSI complexity, efficient VLSI algorithms and the HILL design system
In: Algorithmics for VLSI, 33-89 | GBV: / ch 060809
Titel: Algorithmics for VLSI / edited by C. Trullemans
Sonst. Personen: Trullemans, C.
Erschienen: London ; Orlando : Academic Press, 1986
Umfang: xii, 131 p. : ill. ; 24 cm
Schriftenreihe: International lecture series in computer science
Anmerkung: Includes bibliographical references and index
ISBN: 0-12-701230-3 | Part of a Book | |
| | 1985 | | A fast algorithm for renaming a set of clauses as a Horn set
In: Information Processing Letters [21], 269-272 | | Journal Article | |
| | 1985 | | Area-time optimal division for T=omega((logn)1+epsilon) | ok - aus Papierfassung Seitenzahl aufergänzt / ch 060920
übertragen aus der Books-DB / ch 060806 | Report | |
| | 1985 | | Deterministic simulation of idealized parallel computers on more realistic ones | ok - Seitenzahl aus Papierfassung aufergänzt / ch 060920
übertragen aus der Books-DB / ch 060803 | Report | |
| | 1985 | | Dynamic Interpolation Search
In: Automata, languages and programming (ICALP-85) : 12th international colloquium, 424-434 | lncs-angaben aus books-DB übertragen / ch 200706 | Proceedings Article | |
| | 1985 | | Dynamization of geometric data structures | ok - gefunden via Dagstuhl - Suche nach Mehlhorn als Verfasser / ch 060927 | Report | |
| | 1985 | | Dynamization of geometric data structures
In: Computational geometry (SCG-85) : 1st symposium, 168-176 | Proc.Daten aus Book-DB übertragen/ ch 060721
allerdings steht -im Gegensatz zur Books-DB- in dblp ein editor:
editor = "Joseph O'Rourke" | Proceedings Article | |
| | 1985 | | Fast Triangulation of the Plane with Respect to Simple Polygons
In: Information and Control [64], 52-76 | | Journal Article | |
| | 1985 | | Intersecting two polyhedra one of which is convex
In: FCT '85: Fundamentals of Computation Theory, 534-542 | Proc.Angaben teils aus Books-DB, Proc.Titel von ACM, da wir keinExemplar haben (out of print) / ch060721 | Proceedings Article | |
| | 1985 | | On BF-perfect graphs | ok - aus BiVis übertragen, Seitenzahl aus Papierfassung ergänzt / ch060920 | Report | |
| | 1985 | | Routing Through a Generalized Switchbox
In: Automata, languages and programming (ICALP-85) : 12th international colloquium, 328-337 | lncs-angaben aus books-DB übertragen / ch 200706 | Proceedings Article | |
| | 1985 | | Searching Semisorted Tables
In: SIAM Journal on Computing [14], 840-848 | | Journal Article | |
| | 1985 | | Sorting Jordan sequences in linear time
In: Computational geometry (SCG-85) : 1st symposium, 196-203 | Proc.Daten aus Book-DB übertragen/ ch 060721
allerdings steht -im Gegensatz zur Books-DB- in dblp ein editor:
editor = "Joseph O'Rourke" | Proceedings Article | |
| | 1984 | | Algorithms for routing in planar graphs | ok - aus Papierfassung Number korrigiert + Seitenzahl ergänzt / ch 060920
übertragen aus der Books-DB / ch 060803 | Report | |
| | 1984 | | Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time
In: Automata, languages and programming (ICALP-84) : 11th colloquium, 347-357 | LNCS-Anteil aus Books-DB bzw. GBV / ch 060806 | Proceedings Article | |
| | 1984 | | Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proof | ok - aus Papierfassung Seitenzahl ergänzt / ch 060920
übertragen aus der Books-DB / ch 060803 | Report | |
| | 1984 | | Data structures and algorithms. Volume 1 : Sorting and searching | aus Books-DB übertragen / ch 060724 | Book | |
| | 1984 | | Data structures and algorithms. Volume 2 : Graph algorithms and NP-completeness | aus Books-DB übertragen / ch 060724 | Book | |
| | 1984 | | Data structures and algorithms. Volume 3 : Multi-dimensional searching and computational geometry | aus Books-DB übertragen / ch 060724 | Book | |
| | 1984 | | Four results on the complexity of VLSI computation
In: Advances in Computing Research [2], 1-22 | | Journal Article | |
| | 1984 | | Intersecting a line and a simple polygon
In: EATCS Bulletin [22], 120-121 | | Journal Article | |
| | 1984 | | Local routing of two-terminal nets is easy | | Report | |
| | 1984 | | On Optimal VLSI-Circuits for the Basic Arithmetic Functions
In: 9. Colloquium on Trees in Algebra and Programming (CAAP'84), 23-30 | Proc.Daten aus GBV übertragen / ch 060806 | Proceedings Article | |
| | 1984 | | On the complexity of partial match retrieval
In: Information Processing Letters [19], 61-65 | | Journal Article | |
| | 1984 | | Partial match retrieval in implicit data structures
In: Information Processing Letters [19], 61-65 | | Journal Article | |
| | 1984 | | Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
In: Acta Informatica [21], 339-374 | ok - mit Verlags-Webseite abgeglichen / ch060921 | Journal Article | |
| | 1984 | | Routing through a generalized switchbox | ok - mit Papierfassung abgeglichen / ch 060921
Achtung!! Fachbereich und MPI / SULB unterschiedliche Report Nummern ! / ch 060919
übertragen aus der Books-DB / ch 060804 | Report | |
| | 1984 | | Sorting Jordan sequences in linear time | Seitenzahl fehlt !!! / 060920
übertragen aus der Books-DB / ch 060803 | Report | |
| | 1984 | | Space Sweep Solves Intersection of Convex Polyhedra
In: Acta Informatica [21], 501-519 | ok - aus Journal aufergänzt und pdf eingefügt / ch 060907 | Journal Article | |
| | 1984 | | Space sweep solves intersection of two convex polyhedra elegantly | | Report | |
| | 1984 | | The HILL system: A design environment for the hierarchical spezification, compaction, and simulation of integrated circuit layouts
In: Proceedings, Conference on Advanced Research in VLSI, 139-149 | Proc.Daten aus GBV: / ch 060809
Proceedings, Conference on Advanced Research in VLSI : January 23 - 25, 1984, Cambridge, Mass. / Paul Penfield, ed. Massachusetts Institute of Technology
Sonst. Personen: Penfield, Paul [Hrsg.]
Körperschaft: Conference on Advanced Research in VLSI <6, 1984, Cambridge, Mass.>
Massachusetts Institute of Technology <Cambridge, Mass.>
Erschienen: Dedham, Mass. : Artech House, 1984
Umfang: 225 S. : Ill., graph. Darst.
ISBN: 0-89006-136-X | Proceedings Article | |
| | 1984 | | Über Verdrahtungsalgorithmen
In: GI Jahrestagung (Fachgespräche), 79-89 | GI-Daten aus DBLP übertragen / ch 060806 | Proceedings Article | |
| | 1984 | | $AT^2$-optimal VLSI integer division and integer square rooting
In: Integration, the VLSI Journal [2], 163-167 | http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6V1M-4CB7422-22&_user=43521&_handle=V-WA-A-W-AB-MsSAYZW-UUA-U-AACDDWCWZV-AACCBUZUZV-CBEEVWYY-AB-U&_fmt=summary&_coverDate=06%2F30%2F1984&_rdoc=6&_orig=browse&_srch=%23toc%235678%231984%23999979997%23500321!&_cdi=5678&view=c&_acct=C000004638&_version=1&_urlVersion=0&_userid=43521&md5=bb2923ecbe700b1f6be07530449f1bc0 | Journal Article | |
| | 1983 | | A Single Shortest Path Algorithm for Graphs with Separators
In: Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference (FCT 1983), 302-309 | Proc.Daten aus DBLP übertragen / ch 060806 | Proceedings Article | |
| | 1983 | | Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time | ok - gemäß Papierfassung / ch 060919 | Report | |
| | 1983 | | Area-Time Optimal VLSI Integer Mutliplier with Minimum Computation Time
In: Information and Control [58], 137-156 | | Journal Article | |
| | 1983 | | Cost Trade-offs in Graph Embeddings, with Applications
In: Journal of the ACM [30], 709-728 | ok - abgeglichen mit dem Volume/paper-Form / ch 060912
ok - ch 061109 :
- abgeglichen mit http://portal.acm.org/citation.cfm?doid=2157.322401
- pdf eingesetzt
- abstract + keywords eingesetzt + umformatiert | Journal Article | |
| | 1983 | | Fast Triangulation of Simple Polygons
In: Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference (FCT 1983), 207-218 | Proc.Daten aus DBLP übertragen / ch 060806 | Proceedings Article | |
| | 1983 | | Four results on the complexity of VLSI computations | ch 060922: Gemäß vorliegender SFB-Papierfassung:
Note: Also available as SFB Sonderforschungsbereich 124, Report No 1983/08
Number gemäß BiVis angepasst, Seitenzahl aus der SULB aufergänzt / ch 060919
übertragen aus der Books-DB / ch 060804 | Report | |
| | 1983 | | Granularity of parallel memories | ok - mit Papierfassung abgeglichen / ch 060921
(Titel ist wirklich komplett klein geschrieben)
Number gemäß BiVis angepasst, Seitenzahl aus der SULB aufergänzt / ch 060919
übertragen aus der Books-DB / ch 060806 | Report | |
| | 1983 | | Routing through a Rectangle | ok - aus BiVis übertragen, Seitenzahl aus SULB, mit Papierfassung abgeglichen / ch060919 | Report | |
| | 1983 | | The HILL System: A Design Environment for the Hierarchical Specification, Compaction, and Simulation of Integrated Circuit Layouts | ok - aufergänzt aus der Papierfassung / ch 060919
übertragen aus der Books-DB / ch 060804
UB: OCR über das Papier laufen gelassen | Report | |
| | 1983 | | The Recognition of Deterministic CFL's in Small Time and Space
In: Information and Control [56], 34-51 | kein Zugriff auf das pdf-file / ch 060912 | Journal Article | |
| | 1983 | | VLSI Complexity, Efficient VLSI Algorithms and the HILL Design System | aus der Papierfassung aufergänzt / 060919
übertragen aus der Books-DB / ch 060804 | Report | |
| | 1983 | | $AT^2$-optimal VLSI for integer division and integer square rooting | | Report | |
| | 1983 | | $AT^2$-optimal VLSI multipliers with minimum computation time
In: Information & Control [58], 137-196 | | Journal Article | |
| | 1982 | | A New Data Structure for Representing Sorted Lists
In: Acta Informatica [17], 157-184 | http://springerlink.metapress.com/openurl.asp?genre=article&issn=0001-5903&volume=17&issue=2&spage=157 | Journal Article | |
| | 1982 | | A Partial Analysis of Height-Balanced Trees Under Random Insertions and Deletions
In: SIAM Journal on Computing [11], 748-760 | | Journal Article | |
| | 1982 | | A Probabilistic Algorithm for Vertex Connectivity of Graphs
In: Information Processing Letters [15], 135-136 | | Journal Article | |
| | 1982 | | Cost tradeoffs in graph embeddings, with applications | | Report | |
| | 1982 | | Las Vegas Is better than Determinism in VLSI and Distributed Computing
In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing (STOC 1982), 330-337 | Proc.Titel teilweise aus dem Fachereichs-Volume aufergänzt / ch 060806 | Proceedings Article | |
| | 1982 | | On the Program Size of Perfect and Universal Hash Functions
In: 23th Annual Symposium on Foundations of Computer Science (FOCS 1982), 170-175 | | Proceedings Article | |
| | 1982 | | The Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees
In: Information and Control [55], 125-174 | | Journal Article | |
| | 1981 | | Arbitrary Weight Changes in Dynamic Trees
In: Revue française d'automatique, d'informatique et de recherche opérationnelle : RAIRO [15], 183-211 | ch 060809 : Journal Titel überprüfen! es gab 2x einen Wechsel ... also auch möglich:
RAIRO Theor. Inform. ?? | Journal Article | |
| | 1981 | | Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version)
In: Automata, languages and programming (ICALP-81) : 8th international colloquium, 41-55 | Proc.Daten aus Books-DB übertragen / ch 060806 | Proceedings Article | |
| | 1981 | | Lower bounds on the efficiency of transforming static data structures into dynamic structures
In: Mathematical Systems Theory [15], 1-16 | | Journal Article | |
| | 1981 | | On the Complexity of VLSI-Computations
In: VLSI Systems and Computations [??], 89-99 | | Journal Article | |
| | 1981 | | Optimal dynamization of decomposable searching problems
In: Information Processing Letters [12], 93-98 | | Journal Article | |
| | 1981 | | Partial Match Retrieval in Implicit Data Structures
In: Mathematical foundations of computer science (MFCS-81) : 10th symposium, ,, 156-161 | Proc.Daten aus Books-DB übertragen/ ch 060806 | Proceedings Article | |
| | 1981 | | Robust balancing in B-trees
In: Theoretical computer science : 5th GI-conference, 234-244 | Proc.Daten aus Books-DB übertragen / ch 060806 | Proceedings Article | |
| | 1980 | | A New Data Structure for Representing Sorted Lists
In: Graph-theoretic concepts in computer science (WG-80) : 6th international workshop, 90-112 | Proc.Daten aus Books-DB abgeglichen / ch 060807 | Proceedings Article | |
| | 1980 | | An Efficient Algorithm for Constructing Nearly Optimal Prefix Codes
In: IEEE Transactions on Information Theory [26], 513-517 | | Journal Article | |
| | 1980 | | Binary Search Trees: Average and Worst Case Behavior
In: Elektronische Informationsverarbeitung und Kybernetik [16], 41-61 | | Journal Article | |
| | 1980 | | Codes: Unequal Probabilities, Unequal Letter Cost
In: Journal of the ACM [27], 412-427 | ok - ch 061109:
- Abgleich mit der ACM-Webseite http://doi.acm.org/10.1145/322203.322205 (bibtex etc.)
- paper, abstract, keywords, links aufergänzt | Journal Article | |
| | 1980 | | Lower bounds on the efficiency of transforming static data structures into dynamic structures | gefunden via BVB / ch 061102 | Report | |
| | 1980 | | On the Average Number of Rebalancing Operations in Weight-Balanced Trees
In: Theoretical Computer Science [11], 303-320 | | Journal Article | |
| | 1980 | | Optimal dynamization of decomposable searching problems | gefunden via BVB / ch 061102 | Report | |
| | 1980 | | Pebbling Mountain Ranges and its Application of DCFL-Recognition
In: Automata, languages and programming (ICALP-80) : 7th annual international colloquium, 422-435 | Proc.Daten aus Books-DB übertragen / ch 060807 | Proceedings Article | |
| | 1979 | | Complexity arguments in algebraic language theory
In: Revue française d'automatique, d'informatique et de recherche opérationnelle : RAIRO / Association Française pour la Cybernétique Economique et Technique [13], 217-225 | http://dblp.uni-trier.de/db/journals/ita/ita13.html#AltM79 / ch 060807
Titel der Zeitschrift aus der ZDB / ch 060808 | Journal Article | |
| | 1979 | | Dynamic Binary Search
In: SIAM Journal on Computing [8], 175-198 | ok / ch 070104
- abgeglichen mit den Webseiten
- pdf + abstract eingetragen
| Journal Article | |
| | 1979 | | Dynamic data structures
In: Mathematical Centre Tracts [108], 71-96 | | Journal Article | |
| | 1979 | | Konzepte der Komplexitätstheorie illustriert am Beispiel des Sortierens
In: GI - 9. Jahrestagung, 16-22 | http://dblp.uni-trier.de/db/conf/gi/gi79.html#Mehlhorn79 / ch 060807 | Proceedings Article | |
| | 1979 | | Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen
In: Theoretical Computer Science, 4th GI-Conference, 67-78 | http://dblp.uni-trier.de/db/conf/tcs/tcs1979.html#BlumM79 / ch 060807 | Proceedings Article | |
| | 1979 | | On the isomorphism of two algorithms: Hu/Tucker and Garsia/Wachs
In: Colloque de Lille `Les Arbres en Algebre et en Programmation' [??], ?? | nur in Kurts Literaturverzeichnis gefunden / ch 060808 | Journal Article | |
| | 1979 | | Parsing Macro Grammars Top Down
In: Information and Control [40], 123-143 | | Journal Article | |
| | 1979 | | Searching, Sorting and Information Theory
In: Mathematical foundations of computer science (MFCS-79) : 8th symposium, 131-145 | J. Be{\v{c}}v{\'a}{\v{r}}
Proc.Daten übertragen aus Books-DB und DBLP / ch 060807 | Proceedings Article | |
| | 1979 | | Some Remarks on Boolean Sums
In: Acta Informatica [12], 371-375 | ok / 070104
- mit webseiten abgeglichen
- pdf + abstract eingefügt | Journal Article | |
| | 1979 | | Some Remarks on Boolean Sums
In: Mathematical foundations of computer science (MFCS-79) : 8th symposium, 375-380 | J. Be{\v{c}}v{\'a}{\v{r}}
Proc.Daten übertragen aus Books-DB und DBLP / ch 060807 | Proceedings Article | |
| | 1979 | | Sorting Presorted Files
In: Theoretical Computer Science, 4th GI-Conference, 199-212 | http://dblp.uni-trier.de/rec/bibtex/conf/tcs/Mehlhorn79 / ch 060807 | Proceedings Article | |
| | 1978 | | An efficient algorithm for constructing nearly optimal prefix codes | ok - mit Papierfassung abgeglichen / ch 060921
(der Titel ist wirklich komplett kleingeschrieben)
SULB, Number gemäß BiVis korrigiert / ch 060919 | Report | |
| | 1978 | | Arbitrary Weight Changes in Dynamic Trees | ok - mit Papierfassung abgeglichen / ch 060921
aus BiVis übertragen, Seitenzahl aus SULB / ch060919 | Report | |
| | 1978 | | Codes: Unequal Probabilities, Unequal Letter Cost | ok - aus BiVis und Papierfassung übertragen / ch060919 | Report | |
| | | | | | | |
| | 1978 | | Codes: Unequal Probabilities, Unequal Letter Cost
In: Automata, languages and programming (ICALP-78): 5th international colloquium, 15-25 | ok - aus Books-DB und DBLP übertragen / ch 060919 | Proceedings Article | |
| | 1978 | | Complexity Arguments in Algebraic Language Theory | ok - mit Papierfassung abgeglichen / ch 060921
aus BiVis übertragen, Seitenzahl & Bericht-Nr aus SULB / ch060919 | Report | |
| | 1978 | | Effiziente Algorithmen: Ein Beispiel | ok - mit Papierfassung abgeglichen / ch 060921
aus BiVis übertragen, Seitenzahl aus SULB / ch060919 | Report | |
| | 1978 | | Effiziente Algorithmen: Ein Beispiel
In: Informatik Spektrum [1], 81-89 | http://dblp.uni-trier.de/db/journals/insk/insk1.html#Mehlhorn78 / ch 060807 | Journal Article | |
| | 1978 | | On the Average Number of Rebalancing Operations in Weight-Balanced Trees | ok - mit Papierfassung abgeglichen / ch 060921
aus BiVis übertragen, Seitenzahl aus SULB / ch060919 | Report | |
| | 1978 | | Sorting Presorted Files | ok - mit Papierfassung abgeglichen / ch 060921
aus BiVis übertragen, Seitenzahl aus SULB / ch060919 | Report | |
| | 1977 | | A best possible bound for the weighted path length of binary search trees
In: SIAM Journal on Computing [6], 235-239 | DB Books: P-77-01
ok / ch 070104 :
- mit webseiten abgeglichen
- pdf + abstract eingesetzt | Journal Article | |
| | 1977 | | Dynamic Binary Search
In: Automata, Languages and Programming : Fourth Colloquium (ICALP-77), 323-336 | ok - aus Books-DB und DBLP übertragen und ergänzt / ch 060918 | Proceedings Article | |
| | 1977 | | Effiziente Algorithmen | | Book | |
| | 1977 | | Van Wijngaarden Grammars and Space Complexity Class EXSPACE
In: Acta Informatica [8], 193-199 | ok / ch 070103
- aus dem Internet aufgefüllt
- abstract + pdf eingesetzt | Journal Article | |
| | 1976 | | An improved lower bound on the formula complexity of context-free recognition | gefunden via BVB / ch 061103
Achtung: der BVB ist gemäß KVK ist die einzige Informationsquelle für diesen Eintrag. Und auch dort steht "circa 1976". | Report | |
| | 1976 | | An Improved Lower Bound on the Formula Complexity of Context-Free Recognition
In: Elektronische Informationsverarbeitung und Kybernetik [12], 523-524 | ok - mit pdf abgeglichen / ch 070109
DB Books: P-76-03
http://dblp.uni-trier.de/db/journals/eik/eik12.html#Mehlhorn76 | Journal Article | |
| | 1976 | | An O(n log n) lower bound for the synchronous circuit size of integer multiplication | ok - mit Papierfassung abgeglichen / ch 060921
aus BiVis übertragen, aus SULB Seitenzahl ergänzt / ch060919 | Report | |
| | 1976 | | Binary Search Trees: Average and Worst Case Behavior | ok - mit Papierfassung abgeglichen / ch 060921
erg!!! (Seitenzahl, Berichtnummer) - aus BiVis übertragen / ch060919 | Report | |
| | 1976 | | Binary Search Trees: Average and Worst Case Behavior
In: GI - 6. Jahrestagung, 301-313 | http://dblp.uni-trier.de/db/conf/gi/gi76.html#GuttlerMSW76 / ch 060807 | Proceedings Article | |
| | 1976 | | Bracket-languages are recognizable in logarithmic space
In: Information Processing Letters [5], 168-170 | ok / ch 070109
- mit Papierfassung abgeglichen
- pdf eingefügt | Journal Article | |
| | 1976 | | Dynamic Binary Search | ok - mit Papierfassung abgeglichen / ch 060921
erg!!! (Seitenzahl, Berichtnummer) - aus BiVis übertragen / ch060919 | Report | |
| | 1976 | | Dynamic Binary Search Trees : Extended Abstracts | gefunden via BVB / ch 061102 | Report | |
| | 1976 | | Lower Bounds for the Space Complexity of Context-Free Recognition
In: Third International Colloquium on Automata, Languages and Programming, 338-354 | | Proceedings Article | |
| | 1976 | | Monotone Switching Circuits and Boolean Matrix Product
In: Computing [16], 99-111 | ok / ch 061123 :
- mit webseiten abgeglichen rsp. aufergänzt:
-- pdf
-- abstract
-- alle Angaben
DB Books: P-76-01 /ch
http://www.springerlink.com/(5pyiyv554nrm4ieujaupllee)/app/home/contribution.asp?referrer=parent&backto=issue,9,14;journal,217,268;linkingpublicationresults,1:103076,1 | Journal Article | |
| | 1976 | | Polynomial and abstract subrecursive classes
In: Journal of Computer and System Sciences [12], 147-178 | DB Books: P-76-02 | Journal Article | |
| | 1976 | | Top Down Parsing of Macro Grammars
In: GI - 6. Jahrestagung, 95-108 | http://dblp.uni-trier.de/db/conf/gi/gi76.html#HeydthausenM76 / ch 060807 | Proceedings Article | |
| | 1976 | | Top down parsing of macro grammars (preliminary report) | ok - Abgleich mit Papierfassung / ch 060921
ok - aus BiVis übertragen, aus SULB Seitenzahl ergänzt / ch060919 | Report | |
| | 1975 | | A game on graphs | gefunden via BVB / ch 061103 | Report | |
| | 1975 | | A Language over a One Symbol Alphabet Requiring only O(log log n) Space
In: SIGACT News [7], 31-33 | ok - aufergänzt: pdf / ch 061109
- wir haben nicht den entsprechenden Zeitschriftenjahrgang, soweit so ok wie möglich.
ch 29.8.06 : aus computer bibliography ... ; aufergänzt aus: http://portal.acm.org/citation.cfm?id=990506&coll=portal&dl=ACM&CFID=41678957&CFTOKEN=20987220 | Journal Article | |
| | 1975 | | Best possible bounds for the weighted path length of optimum binary search trees
In: Automata Theory and Formal Languages, 2nd GI Conference, 31-41 | ok - ch 061109 - ok gemäß:
- Proc bei uns nicht vorhanden
- kein (fertiges) pdf gefunden,
- abgleich mit ACM-Portal: http://portal.acm.org/citation.cfm?id=646589.697335&coll=&dl=acm&CFID=15151515&CFTOKEN=6184618
Proc.Daten aus
http://dblp.uni-trier.de/rec/bibtex/conf/automata/Mehlhorn75
http://dblp.uni-trier.de/db/conf/automata/automata1975.html#Mehlhorn75
übertragen / ch 060807 | Proceedings Article | |
| | 1975 | | Bracket-Languages are Recognizable in Logarithmic Space | ok - mit Papierfassung abgeglichen / ch 060921
aus BiVis übertragen, Seitenzahl aus SULB / ch060919 | Report | |
| | 1975 | | Monotone Switching Circuits and Boolean Matrix Product
In: Mathematical foundations of computer science (MFCS-75) : 4th symposium, 315-319 | ok - Proc.Daten aus Books DB übertragen; Artikel Daten aus DBLP / ch 060918 | Proceedings Article | |
| | 1975 | | Nearly Optimal Binary Search Trees
In: Acta Informatica [5], 287-295 | ok - ch 061123 :
- via web summary eingesetzt
- pdf gefunden und eingesetzt
- mit web-article abgeglichen | Journal Article | |
| | 1975 | | Untere Schranken für den Platzbedarf bei der kontext-freien Analyse | ok - mit Papierfassung abgeglichen / ch 060921
aus BiVis übertragen, Seitenzahl aus SULB / ch060919 | Report | |
| | 1974 | | Polynomial and abstract subrecursive classes
Cornell University | ch 061031 Eintrag bei ACM entdeckt: http://portal.acm.org/citation.cfm?id=907269&coll=GUIDE&dl=GUIDE&CFID=3463240&CFTOKEN=85811342# | Thesis - PhD thesis | |
| | 1974 | | Polynomial and abstract subrecursive classes
In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 14 | ch 061031: Original nicht vorhanden, aber bestellbar: http://bvba2.bib-bvb.de/V/P5AXT9U4MAAXL1PAPL261APFCPLI3XULQNYGXNBUSVJ1UDG2II-48571?func=full&set_number=037870&set_entry=000001&format=999 | Report | |
| | 1974 | | Polynomial and Abstract Subrecursive Classes
In: Conference Record of Sixth Annual ACM Symposium on Theory of computing (STOC-74), 96-109
In: Informatik Spektrum, 96-109 | ch 061031:
- Eintrag korrigiert und vervollständigt anhand der Druckfassung
- abstract + paper aufergänzt
@InProceedings{STOC::Mehlhorn1974,
title = "",
author = "Kurt Mehlhorn",
pages = "96--109",
booktitle = "Conference Record of Sixth Annual {ACM} Symposium on
Theory of Computing",
month = "30 " # apr # "--2 " # may,
year = "1974",
address = "Seattle, Washington",
} | Proceedings Article | |
| | 1974 | | The 'almost all' theory of subrecursive degrees is decidable
In: Automata, languages and programming : 2nd colloquium (ICALP-74), 317-325 | DB Books: P-74-01
ok - ch 061109 :
- Proc-Daten mit Books-DB abgeglichen
- mit ACM- Eintrag abgeglichen (http://portal.acm.org/citation.cfm?id=646230.681879&coll=&dl=ACM&CFID=15151515&CFTOKEN=6184618)
- abgeglichen mit der paper-Fassung
pdf / ch 070109 | Proceedings Article | |
| | 1973 | | On the Size of Sets of Computable Functions
In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 190-196 | ok - ProcDaten aus Books-DB, Papierfassung in D1-Bib / ch 060921
ch 061109:
- abgeglichen mit paperfassung
- es gibt keine ISBN dort
- SSAT wurde später zu FOCS / SSAT : later known as FOCS
pdf / ch 070109 | Proceedings Article | |
| | 1973 | | On the Size of Sets of Computable Functions
In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 22 | ch 061031: Original nicht vorhanden, aber bestellbar: http://bvba2.bib-bvb.de/V/K7PBSYKF7QM3TEV4L8Y6R94V353DU2GSNLU8XTLJJG2J8JGAXS-09248?func=full&set_number=013839&set_entry=000001&format=999 | Report | |
| | 1973 | | The "almost all" theory of subrecursive degrees is decidable
In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 25 | ch 061103: Original nicht vorhanden, aber bestellbar: http://bvba2.bib-bvb.de/V/J6H72DLRPASEAGKSSE3GC3NGM6NMGCFS29IPPQNYSFJDAI6BAC-13245?func=full&set_number=025284&set_entry=000029&format=999 | Report | |
| 13 |
| |
| 2 |
| Mehlhorn, K. |
| |
| 3 |
| |
| 1 |
| Meinel, Christoph |
| |
| 9 |
| |
| 1 |
| Mercas, Robert |
| |
| 31 |
| |
| 1 |
| Metzler, Matthias |
| |
| 1 |
| |
| 5 |
| Meyer auf der Heide, Friedhelm |
| |
| 1 |
| |
| 2 |
| Meyerovitch, Michal |
| |
| 1 |
| |
| 46 |
| Meyer, Ulrich |
| |
| 1 |
| |
| 1 |
| Meyer, Ulrike |
| |
| 1 |
| |
| 15 |
| Michail, Dimitrios |
| |
| 2 |
| |
| 1 |
| Michalewicz, Zbigniew |
| |
| 1 |
| |
| 1 |
| Michel, Laurent |
| |
| 1 |
| |
| 1 |
| Miklos, Balint |
| |
| 1 |
| |
| 2 |
| Miller, Julian (ed.) |
| |
| 1 |
| |
| 3 |
| Miller, Tobias |
| |
| 2 |
| |
| 9 |
| Milosavljevic, Nikola |
| |
| 2 |
| |
| 1 |
| Mintz, Aviad |
| |
| 8 |
| |
| 1 |
| Mitchell, Joe (ed.) |
| |
| 1 |
| |
| 6 |
| Mitzenmacher, Michael |
| |
| 4 |
| |
| 1 |
| Moehring, Rolf H. |
| |
| 1 |
| |
| 1 |
| Mokbel, Mohamed F. |
| |
| 2 |
| |
| 2 |
| Moore, Jason (ed.) |
| |
| 2 |
| |
| 1 |
| Moran, Shlomo |
| |
| 1 |
| |
| 1 |
| Morgenstern, Burkhard |
| |
| 1 |
| |
| 1 |
| Morozov, Dmitriy |
| |
| 2 |
| Mortensen, Christian Worm |
| |
| 1 |
| Moser, Hannes |
| |
| 1 |
| |
| 10 |
| Mount, David M. |
| |
| 4 |
| |
| 1 |
| Mozes, Shay |
| |
| 1 |
| |
| 1 |
| Müller, Haiko |
| |
| 2 |
| |
| 2 |
| Müller, Matthias |
| |
| 3 |
| |
| 8 |
| Müller, Peter |
| |
| 2 |
| |
| 1 |
| Munro, I. |
| |
| 1 |
| |
| 4 |
| Munro, J. Ian |
| |
| 1 |
| |
| 7 |
| Mustafa, Nabil H. |
| |
| 3 |
| |
| 44 |
| Mutzel, Petra |
| |
| 4 |
| |
| 1 |
| Nagarajan, Viswanath |
| |
| 1 |
| |
| 1 |
| Näher, S |
| |
| 45 |
| |
| 1 |
| Näher, Stefan (ed.) |
| |
| 1 |
| |
| 2 |
| Nanni, Umberto |
| |
| 1 |
| |
| 1 |
| Narayanaswamy, N.S. |
| |
| 2 |
| |
| 1 |
| Narodytska, Nina |
| |
| 1 |
| |
| 3 |
| Nasre, Meghana |
| |
| 1 |
| |
| 1 |
| Nasr, Meghana |
| |
| 10 |
| |
| 1 |
| Navarro, Gonzalo |
| |
| 1 |
| |
| 1 |
| Nederlof, Jesper |
| |
| 3 |
| |
| 1 |
| Nest, Martin |
| |
| 1 |
| |
| 4 |
| Neumann, Adrian |
| |
| 1 |
| |
| 2 |
| Neumann, Dirk |
| |
| 67 |
| |
