MPI-INF Logo
Publications

Server    domino.mpi-inf.mpg.de

MPI-INF D1 Publications

Entries sorted by: 1. Author,Editor - 1. by Individual - 3. A..Z Index-Comment

Login to this database


 

Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)
Show entries starting with: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

#YearTitleAG Editor CommentType
1
Show details for Jacobs, TobiasJacobs, Tobias
1
Show details for Jain, SanjayJain, Sanjay
9
Show details for Janardan, RaviJanardan, Ravi
11
Show details for Jansen, KlausJansen, Klaus
5
Show details for Jansen, ThomasJansen, Thomas
1
Show details for Jansen, Thomas (ed.)Jansen, Thomas (ed.)
1
Show details for Jansson, JesperJansson, Jesper
1
Show details for Jawor, WojciechJawor, Wojciech
1
Show details for Jeli´c, SlobodanJeli´c, Slobodan
4
Show details for Jensen, ClausJensen, Claus
2
Show details for Jerrum, MarkJerrum, Mark
13
Show details for Jez, ArturJez, Artur
2
Show details for Jez, LukaszJez, Lukasz
1
Show details for Jiang, TaoJiang, Tao
1
Show details for Jiang, ZhigenJiang, Zhigen
21
Show details for Johannsen, DanielJohannsen, Daniel
1
Show details for Johnson, AaronJohnson, Aaron
19
Show details for Jünger, MichaelJünger, Michael
4
Show details for Jung, BerndJung, Bernd
6
Show details for Jung, HermannJung, Hermann
2
Show details for Jung, Hermann (ed.)Jung, Hermann (ed.)
1
Show details for Jung, KarinJung, Karin
6
Show details for Jurkiewicz, TomaszJurkiewicz, Tomasz
4
Show details for Juurlink, BenJuurlink, Ben
3
Show details for Kagaris, DimitriosKagaris, Dimitrios
1
Show details for Kakargias, AthanasiosKakargias, Athanasios
2
Show details for Kaklamanis, ChristosKaklamanis, Christos
6
Show details for Kaligosi, KanelaKaligosi, Kanela
1
Show details for Kaller, DamonKaller, Damon
4
Show details for Kamel, IbrahimKamel, Ibrahim
1
Show details for Kammenhuber, NilsKammenhuber, Nils
1
Show details for Kamran Azam, MuhammadKamran Azam, Muhammad
1
Show details for Kane, DanielKane, Daniel
1
Show details for Kang, MihyunKang, Mihyun
1
Show details for Kang, RossKang, Ross
1
Show details for Kaninke, G.Kaninke, G.
1
Show details for Kannan, RaviKannan, Ravi
3
Show details for Kao, Ming-YangKao, Ming-Yang
5
Show details for Kapoor, SanjivKapoor, Sanjiv
1
Show details for Kappel, HolgerKappel, Holger
1
Show details for Karamanis, NikiforosKaramanis, Nikiforos
4
Show details for Karavelas, MenelaosKaravelas, Menelaos
2
Show details for Karavelas, Menelaos I.Karavelas, Menelaos I.
10
Show details for Kärkkäinen, JuhaKärkkäinen, Juha
3
Show details for Karlin, AnnaKarlin, Anna
2
Show details for Karloff, HowardKarloff, Howard
3
Show details for Karpinski, MarekKarpinski, Marek
1
Show details for Karp, RichardKarp, Richard
2
Show details for Karp, Richard M.Karp, Richard M.
17
Show details for Karrenbauer, AndreasKarrenbauer, Andreas
1
Show details for Kasan, BinamanKasan, Binaman
1
Show details for Kasper, ThomasKasper, Thomas
2
Show details for Kasprzik, AnnaKasprzik, Anna
8
Show details for Katajainen, JyrkiKatajainen, Jyrki
3
Show details for Katoh, NaokiKatoh, Naoki
18
Show details for Katriel, IritKatriel, Irit
26
Show details for Kaufmann, MichaelKaufmann, Michael
1
Show details for Kaufmann, MorganKaufmann, Morgan
1
Show details for Kautz, JanKautz, Jan
19
Show details for Kavitha, TelikepalliKavitha, Telikepalli
5
Show details for Kavitha, T.Kavitha, T.
1
Show details for Kavvadias, Dimitris J.Kavvadias, Dimitris J.
2
Show details for Kayal, NeerajKayal, Neeraj
4
Show details for Kececioglu, JohnKececioglu, John
1
Show details for Kedem, KlaraKedem, Klara
1
Show details for Kehden, BrittaKehden, Britta
1
Show details for Keizer, Marten (ed.)Keizer, Marten (ed.)
1
Show details for Keller, JörgKeller, Jörg
4
Show details for Kelsen, PierreKelsen, Pierre
1
Show details for Kennedy, John (ed.)Kennedy, John (ed.)
26
Show details for Kerber, MichaelKerber, Michael
1
Show details for Kerber, W.Kerber, W.
1
Show details for Kern, WalterKern, Walter
1
Show details for Kerzmann, AndreasKerzmann, Andreas
3
Show details for Kesselheim, ThomasKesselheim, Thomas
11
Show details for Kesselman, AlexanderKesselman, Alexander
1
Show details for Kessler, HaraldKessler, Harald
2
Show details for Keßler, Christoph W.Keßler, Christoph W.
1
Show details for Kettner, BjörnKettner, Björn
40
Show details for Kettner, LutzKettner, Lutz
1
Show details for Kettner, Lutz (ed.)Kettner, Lutz (ed.)
33
Show details for Khachiyan, LeonidKhachiyan, Leonid
1
Show details for Khandekar, RohitKhandekar, Rohit
1
Show details for Khanna, SanjeevKhanna, Sanjeev
2
Show details for Khosla, MeghaKhosla, Megha
2
Show details for Khuller, SamirKhuller, Samir
1
Show details for Kim, Eun JungKim, Eun Jung
1
Show details for Kirkpatrick, DavidKirkpatrick, David
1
Show details for Kirousis, LefterisKirousis, Lefteris
1
Show details for Klär, GerhardKlär, Gerhard
1
Show details for Klauk, MathiasKlauk, Mathias
13
Show details for Klau, Gunnar W.Klau, Gunnar W.
3
Show details for Kleiman, ElenaKleiman, Elena
1
Show details for Kleinberg, JonKleinberg, Jon
19
Show details for Klein, ChristianKlein, Christian
2
Show details for Klein, KarstenKlein, Karsten
5
Show details for Klein, RolfKlein, Rolf
2
Show details for Klein, R.Klein, R.
1
Show details for Klimm, MaxKlimm, Max
1
Show details for Kloks, TonKloks, Ton
2
Show details for Knauer, ChristianKnauer, Christian
1
Show details for Knight, PeterKnight, Peter
1
Show details for Knowles, Joshua D. (ed.)Knowles, Joshua D. (ed.)
7
Show details for Kobel, AlexanderKobel, Alexander
1
Show details for Koch, GunterKoch, Gunter
1
Show details for Koch, ThorstenKoch, Thorsten
1
Show details for Kociumaka, TomaszKociumaka, Tomasz
1
Show details for Kodric, BojanaKodric, Bojana
1
Show details for Kogan, KirillKogan, Kirill
2
Show details for Koga, HisashiKoga, Hisashi
7
Show details for Kohlbacher, OliverKohlbacher, Oliver
1
Show details for Köhler, EkkehardKöhler, Ekkehard
1
Show details for Koldehofe, BorisKoldehofe, Boris
4
Show details for Koller, AlexanderKoller, Alexander
1
Show details for Kollias, KonstantinosKollias, Konstantinos
4
Show details for Könemann, JochenKönemann, Jochen
1
Show details for Konidaris, G.Konidaris, G.
1
Show details for König, FelixKönig, Felix
1
Show details for Konjevod, GoranKonjevod, Goran
3
Show details for Kontogiannis, SpyrosKontogiannis, Spyros
1
Show details for Konwar, KishoriKonwar, Kishori
1
Show details for Koppula, VenkataKoppula, Venkata
1
Show details for Korst, JanKorst, Jan
2
Show details for Korteweg, PeterKorteweg, Peter
1
Show details for Kortsarz, GuyKortsarz, Guy
29
Show details for Kötzing, TimoKötzing, Timo
8
Show details for Koutsoupias, EliasKoutsoupias, Elias
11
Show details for Kovacs, AnnamariaKovacs, Annamaria
1
Show details for Kovacs, Tim (ed.)Kovacs, Tim (ed.)
7
Show details for Kowalik, LukaszKowalik, Lukasz
22
Show details for Kowalski, DariuszKowalski, Dariusz
1
Show details for Kowalski, Dariusz R.Kowalski, Dariusz R.
1
Show details for Kowaluk, MiroslawKowaluk, Miroslaw
1
Show details for Kraetzl, M.Kraetzl, M.
1
Show details for Kranakis, EvangelosKranakis, Evangelos
3
Show details for Krandick, WernerKrandick, Werner
4
Show details for Kratsch, DieterKratsch, Dieter
14
Show details for Kratsch, StefanKratsch, Stefan
1
Show details for Kreveld, Marc vanKreveld, Marc van
1
Show details for Krick, ChristofKrick, Christof
2
Show details for Krishnan, P.Krishnan, P.
2
Show details for Krithivasan, KamalaKrithivasan, Kamala
2
Show details for Kritzer, PeterKritzer, Peter
1
Show details for Krivelevich, MichaelKrivelevich, Michael
1
Show details for Krizanc, DannyKrizanc, Danny
1
Show details for Kroeger, TrentKroeger, Trent
1
Show details for Kroeske, JenseKroeske, Jense
3
Show details for Krohmer, AntonKrohmer, Anton
3
Show details for Krohn, ErikKrohn, Erik
1
Show details for Kröller, AlexanderKröller, Alexander
1
Show details for Krüger, MichaelKrüger, Michael
1
Show details for Krumke, SvenKrumke, Sven
1
Show details for Krumke, Sven OliverKrumke, Sven Oliver
15
Show details for Krysta, PiotrKrysta, Piotr
1
Show details for Ksinsik, PatricKsinsik, Patric
1
Show details for Kucera, LudekKucera, Ludek
1
Show details for Kucherov, GregoryKucherov, Gregory
4
Show details for Kühn, DanielaKühn, Daniela
2
Show details for Kuhn, FabianKuhn, Fabian
1
Show details for Kulau, UlfKulau, Ulf
4
Show details for Kumar, AmitKumar, Amit
1
Show details for Kumar, PiyushKumar, Piyush
2
Show details for Kumar, Sanjeev (ed.)Kumar, Sanjeev (ed.)
5
Show details for Kumar, V. S. AnilKumar, V. S. Anil
7
Show details for Künnemann, MarvinKünnemann, Marvin
1
Show details for Kupilas, JoschkaKupilas, Joschka
1
Show details for Kurowski, MaciejKurowski, Maciej
3
Show details for Kursawe, KlausKursawe, Klaus
1
Show details for Kurur, Piyush P.Kurur, Piyush P.
1
Show details for Kutylowski, MiroslawKutylowski, Miroslaw
16
Show details for Kutz, MartinKutz, Martin
2
Show details for Kwappik, CarstenKwappik, Carsten
1
Show details for Kwek, St.Kwek, St.
1
Show details for Kwon, Woo-CheolKwon, Woo-Cheol
1
Show details for Lambert, GeorgLambert, Georg
2
Show details for Lambert, OliverLambert, Oliver
7
Show details for Lam, Tak-WahLam, Tak-Wah
2
Show details for Lam, Tak WahLam, Tak Wah
2
Show details for Landau, Gad M.Landau, Gad M.
4
Show details for Lange, KatharinaLange, Katharina
1
Show details for Langkau, KatharinaLangkau, Katharina
1
Show details for Lang, Hans-HermannLang, Hans-Hermann
1
Show details for Lang, JochenLang, Jochen
3
Show details for Larmore, Lawrence L.Larmore, Lawrence L.
1
Show details for Larsen, Kasper GreenLarsen, Kasper Green
1
Show details for Larsson, AndreasLarsson, Andreas
1
Show details for Lars, Arge (ed.)Lars, Arge (ed.)
1
Show details for Lauer, ThorstenLauer, Thorsten
1
Show details for Laue, SoerenLaue, Soeren
4
Show details for Laue, SörenLaue, Sören
2
Show details for Laura, LuigiLaura, Luigi
1
Show details for Lee, E. K.Lee, E. K.
5
Show details for Lee, Jae-HaLee, Jae-Ha
7
Show details for Lee, Lap-KeiLee, Lap-Kei
1
Show details for Lehnert, JörgLehnert, Jörg
1
Show details for Lehre, Per ChristianLehre, Per Christian
3
Show details for Lehre, Per KristianLehre, Per Kristian
2
Show details for Lehr, Claus-MichaelLehr, Claus-Michael
1
Show details for Leinenbach, StefanLeinenbach, Stefan
4
Show details for Leipert, SebastianLeipert, Sebastian
1
Show details for Leiserson, Charles (ed.)Leiserson, Charles (ed.)
1
Show details for Lenaerts, Tom (ed.)Lenaerts, Tom (ed.)
8
Show details for Lengauer, ThomasLengauer, Thomas
4
Show details for Lengler, JohannesLengler, Johannes
33
Show details for Lenhof, Hans-PeterLenhof, Hans-Peter
3
Show details for Lennerz, ChristianLennerz, Christian
1
Show details for Lensch, Hendrik P. A.Lensch, Hendrik P. A.
11
Show details for Leonardi, StefanoLeonardi, Stefano
2
Show details for Lermen, MartinLermen, Martin
1
Show details for Leung, Henry C. M.Leung, Henry C. M.
2
Show details for Levavi, ArielLevavi, Ariel
9
Show details for Levin, AsafLevin, Asaf
1
Show details for Levy, AvivitLevy, Avivit
2
Show details for Lewenstein, MosheLewenstein, Moshe
1
Show details for Liberty, EdoLiberty, Edo
1
Show details for Liberty, NoaLiberty, Noa
1
Show details for Liebchen, Ch.Liebchen, Ch.
1
Show details for Liers, FraukeLiers, Frauke
2
Show details for Ligett, KatrinaLigett, Katrina
5
Show details for Limbach, SebastianLimbach, Sebastian
3
Show details for Lingas, AndrzejLingas, Andrzej
2
Show details for Li, HaohanLi, Haohan
1
Show details for Li, JianLi, Jian
1
Show details for Lobo, Ferdinando (ed.)Lobo, Ferdinando (ed.)
1
Show details for Lodha, SachinLodha, Sachin
1
Show details for Lodha, S.Lodha, S.
2
Show details for Loeckx, JacquesLoeckx, Jacques
1
Show details for Lohrey, MarkusLohrey, Markus
5
Show details for Lokshtanov, DanielLokshtanov, Daniel
1
Show details for Loock, AchimLoock, Achim
4
Show details for Lopez-Ortiz, AlejandroLopez-Ortiz, Alejandro
1
Show details for Lorenz, UlfLorenz, Ulf
1
Show details for Lorys, KrzysztofLorys, Krzysztof
8
Show details for Lotker, ZviLotker, Zvi
1
Show details for Lumelsky, VladimirLumelsky, Vladimir
1
Show details for Lutter, StefanLutter, Stefan
1
Show details for Lüttke-Hüttmann, DirkLüttke-Hüttmann, Dirk
1
Show details for Lu, PinyanLu, Pinyan
1
Show details for MacKenzie, Philip D.MacKenzie, Philip D.
1
Show details for Maggs, Bruce M.Maggs, Bruce M.
2
Show details for Mahajan, MeenaMahajan, Meena
8
Show details for Mahajan, SanjeevMahajan, Sanjeev
2
Show details for Maheshwari, AnilMaheshwari, Anil
1
Show details for Mainberger, MarkusMainberger, Markus
7
Show details for Majumdar, DebapriyoMajumdar, Debapriyo
1
Show details for Makedon, Fillia (ed.)Makedon, Fillia (ed.)
26
Show details for Makino, KazuhisaMakino, Kazuhisa
10
Show details for Malamatos, TheocharisMalamatos, Theocharis
1
Show details for Malde, Alpeshkumar K.Malde, Alpeshkumar K.
1
Show details for Malekian, AzarakhshMalekian, Azarakhsh
1
Show details for Maletti, AndreasMaletti, Andreas
1
Show details for Malinger, ItayMalinger, Itay
3
Show details for Mandoiu, IonMandoiu, Ion
3
Show details for Manea, FlorinManea, Florin
7
Show details for Manjunath, MadhusudanManjunath, Madhusudan
1
Show details for Manlove, DavidManlove, David
1
Show details for Manlove, David F.Manlove, David F.
2
Show details for Mannila, HeikkiMannila, Heikki
1
Show details for Manolache, GabrielManolache, Gabriel
2
Show details for Mansour, YishayMansour, Yishay
1
Show details for Manss, ChristianManss, Christian
2
Show details for Manthey, BodoManthey, Bodo
1
Show details for Mantler, AndreaMantler, Andrea
2
Show details for Mäntylä, MarttiMäntylä, Martti
2
Show details for Marathe, Madhav V.Marathe, Madhav V.
19
Show details for Marchetti-Spaccamela, AlbertoMarchetti-Spaccamela, Alberto
1
Show details for Margewitsch, ErwinMargewitsch, Erwin
2
Show details for Markou, EuripidesMarkou, Euripides
2
Show details for Marks, JoeMarks, Joe
1
Show details for Mark, Alan E.Mark, Alan E.
1
Show details for Marshall, AlanMarshall, Alan
1
Show details for Martens, MarenMartens, Maren
4
Show details for Marx, DanielMarx, Daniel
16
Show details for Matijevic, DomagojMatijevic, Domagoj
1
Show details for Matijevi`c, DomagojMatijevi`c, Domagoj
2
Show details for Maue, JensMaue, Jens
1
Show details for Maurer, OlafMaurer, Olaf
1
Show details for Maurer, TanjaMaurer, Tanja
2
Show details for Mavronicolas, MariosMavronicolas, Marios
1
Show details for Ma, WeidongMa, Weidong
1
Show details for McConnella, Ross M.McConnella, Ross M.
3
Show details for McConnell, RossMcConnell, Ross
1
Show details for McDiarmid, ColinMcDiarmid, Colin
1
Show details for McGeoch, CatherineMcGeoch, Catherine
21
Show details for Megow, NicoleMegow, Nicole
419
Hide details for Mehlhorn, KurtMehlhorn, Kurt
2013A Framework for the Verification of Certifying Computationsnoch nicht erschienen 4.2.13 smUnpublished/Draft
2013Certifying 3-Edge-Connectivity
In: 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'13), 358-369
Proceedings Article
2013Every DFS tree of a 3-connected graph contains a contractible edge
In: Journal of Graph Theory [72], 112-121
Journal Article
2013From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic Decomposition
In: arXiv [abs/1301.4870],
Electronic Journal Article
2013On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets
In: 19th Annual International Computing and Combinatorics Conference (COCOON-13), 65-76
Proceedings Article
2013The cost of address translation
In: Proceedings of the Meeting on Algorithm Engineering & Experiments,
noch nicht erschienen 4.2.13 smProceedings Article
2013The Query Complexity of Finding a Hidden Permutation
In: Space-Efficient Data Structures, Streams, and Algorithms, 1-11
Part of a Book
2012A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market
In: arXiv [abs/1212.0979v1], 1-8
Electronic Journal Article
2012An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs
In: Algorithmica [62], 754-766
Journal Article
2012Attachment IconCertifying 3-Edge-ConnectivityUnpublished/Draft
2012Counting Arbitrary Subgraphs in Data Streams
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 598-609
Proceedings Article
2012Online Graph Exploration: New Results on Old and New Algorithms
In: Theoretical Computer Science [463], 62-72
Journal Article
2012Physarum Can Compute Shortest Paths
In: Journal of Theoretical Biology [309], 121-133
Journal Article
2012Physarum Can Compute Shortest Paths
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 233-240
Proceedings Article
2012Attachment IconRemarks on Category-Based Routing in Social NetworksUnpublished/Draft
2012The Query Complexity of Finding a Hidden Permutation
In: Electronic Colloquium on Computational Complexity (ECCC): Report Series [87 (Revision 1)], 1-36
Electronic Journal Article
2011A deterministic algorithm for isolating real roots of a real polynomial
In: Journal of Symbolic Computation [46], 70-90
Journal Article
2011A General Approach to the Analysis of Controlled Perturbation Algorithms
In: Computational Geometry [44], 507-528
Journal Article
2011Additive Spanners and (α, β)-Spanners
In: ACM Transactions on Algorithms [7], 5:1-5:26
Journal Article
2011Approximate Counting of Cycles in Streams
In: 19th Annual European Symposium on Algorithms (ESA-11), 677-688
Proceedings Article
2011Certifying algorithms
In: Computer Science Review [5], 119-161
Journal Article
2011Improving 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
2011New Approximation Algorithms for Minimum Cycle Bases of Graphs
In: Algorithmica [59], 471-488
Journal Article
2011Online Graph Exploration: New Results on Old and New Algorithms
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 478-489
Proceedings Article
2011Verification of Certifying Computations
In: Computer Aided Verification : 23rd International Conference, CAV 2011, 67-82
Proceedings Article
2011Weisfeiler-Lehman graph kernels
In: Journal of Machine Learning Research [12], 2539-2561
Journal Article
2010An $O(m+n)$ Certifying Triconnectivity Algorithm for Hamiltonian Graphs
In: Algorithmica [Online First], 1-13
Electronic Journal Article
2010Arrangements on Parametric Surfaces I: General Framework and Infrastructure
In: Mathematics in Computer Science [4], 45-66
Journal Article
2010Assigning Papers to Referees
In: Algorithmica [58], 119-136
Online First Januar 2010Journal Article
2010Certifying algorithms
In: Computer Science Review [Article in Press], 1-43
Electronic Journal Article
2010Faster algorithms for computing Hong's bound on absolute positiveness
In: Journal of Symbolic Computation [45], 677-683
Journal Article
2010Progress on Certifying Algorithms
In: Frontiers in Algorithmics : 4th International Workshop, FAW 2010, 1-5
Proceedings Article
2010Reliable and Efficient Geometric Computing
In: Mathematical Software, ICMS 2010 : Third International Congress
on Mathematical Software, 10-11
Proceedings Article
2009A Separation Bound for Real Algebraic Expressions
In: Algorithmica [55], 14-28
Journal Article
2009Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 301-312
Proceedings Article
2009Breaking 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
2009Attachment IconEfficient Graphlet Kernels for Large Graph Comparison
In: Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics (AISTATS), 488-495
Electronic Proceedings Article
2009Isolating real roots of real polynomials
In: Proceedings of the 2009 international symposium on Symbolic and algebraic computation (ISSAC), 247-254
Proceedings Article
2008A deterministic Bitstream Descartes AlgorithmReport
2008A General Approach to the Analysis of Controlled Perturbation AlgorithmsReport
2008Algorithms and Data Structures: The Basic ToolboxBook
2008Attachment IconAssigning Papers to RefereesUnpublished/Draft
2008Attachment IconClassroom Examples of Robustness Problems in Geometric Computations
In: Computational Geometry: Theory and Applications [40], 61-78
in Press, online bereits ersch. 05.02.08/bcJournal Article
2008Attachment IconFaster Deterministic and Randomized Algorithms for Minimum Cycle Basis in Directed Graphs
In: SIAM Journal of Computing [38], 1430-1447
Journal Article
2007Attachment IconAlgorithms to compute minimum cycle basis in directed graphs
In: Theory of Computing Systems [40], 485-505
Journal Article
2007Attachment IconBoolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, Optimized Implementation and Experiments
In: Computational Geometry: Theory and Applications [38], 64-99
Journal Article
2007Attachment IconCycle Bases of Graphs and Sampled Manifolds
In: Computer Aided Geometric Design [24], 464
Journal Article
2007Attachment IconImplementing 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
2007Attachment IconMatchings in Graphs Variations of the Problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 1-2
Proceedings Article
2007Attachment IconMinimum Cycle Bases in Graphs Algorithms and Applications
In: Mathematical Foundations of Computer Science 2007 : 32nd International Symposium, MFCS 2007, 13-14
Proceedings Article
2007Attachment IconNew 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
2007Attachment IconPopular Matchings
In: SIAM Journal on Computing [37], 1030-1045
Journal Article
2007Attachment IconStrongly 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
2007Sweeping and Maintaining Two-Dimensional Arrangements on QuadricsReport
2007Attachment IconSweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
In: Algorithms - ESA 2007, 15th Annual European Symposium, 645-656
Proceedings Article
2006Attachment IconA 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
2006Attachment IconCertifying 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 060911Journal Article
2006Attachment IconControlled Perturbation for Delaunay TriangulationsReport
2006Attachment IconImplementing Minimum Cycle Basis Algorithms
In: ACM Journal of Experimental Algorithmics [11], 1-14
ok / ch 070312
- mit der Webseite abgeglichen
Electronic Journal Article
2006Attachment IconMatching Algorithms are Fast in Sparse Random Graphs
In: Theory of Computing Systems [39], 3-14
ok - pdf eingefügt / 061004

ok / ch060416
Journal Article
2006Attachment IconNew bounds for the Descartes method
In: Journal of Symbolic Computation [41], 49-66
ok - aus dem Journal übertragen / ch 060914Journal Article
2006Polyline 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
2006Attachment IconRank-Maximal Matchings
In: ACM Transactions on Algorithms [2], 602-610
ok / ch 070312
- mit Webseite abgeglichen
Journal Article
2006Attachment IconReliable 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
2006Reliable 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
2006Reply 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
2005Attachment IconA 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
2005Attachment IconA 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/ch050425Proceedings Article
2005Certifying Algorithms (draft)Opus in der Entstehungsphase (Telefonat mit Arno Eigenwillig, eigentlich im Zusammenhang mit einem anderen paper mit ihm angesprochen) / ch060420Unpublished/Draft
2005Attachment IconControlled Perturbation for Delaunay Triangulations
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 1047-1056
ch - ok/ch050425Proceedings Article
2005Attachment IconEXACUS: 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
2005Harald 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
2005Attachment IconImplementing Minimum Cycle Basis Algorithms
In: Experimental and Efficient Algorithms, 4th InternationalWorkshop, WEA 2005, 32-43
ok / ch051103
Proceedings Article
2005Minimum 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
2005Attachment IconNetwork Problems with Non-Polynomial Weights and ApplicationsTitel existiert laut google nur am MPI => nirgends sonst erschienen. ch / 060619Unpublished/Draft
2005Attachment IconNew 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
2005Pareto 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
2005Attachment IconPopular Matchings
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 424-432
ch - ok/ch-050425Proceedings Article
2005Attachment IconStructural 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
2005Attachment IconTowards 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 / ch061004Proceedings Article
2004Attachment IconA Faster Algorithm for Minimum Cycle Basis of Graphs
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 846-857
Proceedings Article
2004Attachment IconAn Empirical Comparison of Software for Constructing Arrangements of Curved ArcsReport
2004Attachment IconAn optimal algorithm for finding edge segment adjacencies in configurations of convex polygonsok - aus Kurts Publikationsliste, incl. attachment / ch 060914Unpublished/Draft
2004Classroom Examples of Robustness Problems in Geometric ComputationsReport
2004Attachment IconClassroom Examples of Robustness Problems in Geometric Computations
In: ESA 2004: 12th Annual European Symposium on Algorithms, 702-713
ch - ok/ch050422Proceedings Article
2004EXACUS: Efficient and Exact Algorithms for Curves and SurfacesReport
2004Attachment IconMatching Algorithms Are Fast in Sparse Random Graphs
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 81-92
ok/ch050523Proceedings Article
2004New Bounds for the Descartes MethodReport
2004Attachment IconPareto-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
2004Attachment IconPoint 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
2004Attachment IconPolyline Fitting of Planar Points Under Min-sum Criteria
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 77-88
ok/ch050501Proceedings Article
2004Attachment IconRank-Maximal Matchings
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 68-75
Proceedings Article
2004Attachment IconStrongly 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
2004The LEDA class real number -- extended versionReport
2003Attachment IconA Heuristic for Dijkstra's Algorithm With Many Targets and its Use in Weighted Matching Algorithms
In: Algorithmica [36], 75-88
okJournal Article
2003Attachment IconAn Efficient Algorithm for the Configuration Problem of Dominance Graphs
In: Journal of Algorithms [48], 194-219
ok - 9.6.04Journal Article
2003Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and ImplementationReport
2003Attachment IconBoolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation
In: Algorithms - ESA 2003: 11th Annual European Symposium, 654-666
okProceedings Article
2003Attachment IconCertifying 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 060911Proceedings Article
2003Attachment IconCertifying 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
okProceedings Article
2003Attachment IconInfimaximal frames: A technique for making lines look like segments
In: International Journal of Computational Geometry & Applications [13], 241-255
okJournal Article
2003Attachment IconOptimal Search for Rationals
In: Information Processing Letters [86], 23-26
okJournal Article
2003Attachment IconScanning 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
2003Attachment IconSmoothed Analysis of Three Combinatorial Problems
In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, 198-207
okProceedings Article
2003Attachment IconThe 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
2003Attachment IconThe 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
okPart of a Book
2002Attachment IconA 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.03Proceedings Article
2002Attachment IconAll-Pairs Shortest-Paths Computation in the Presence of Negative Cycles
In: Information Processing Letters [81], 341-343
qJournal Article
2002Exact 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
2002Attachment IconExternal-Memory Breadth-First Search with Sublinear I/O
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 723-735
erledigt / bc 09.05.03 -- qProceedings Article
2002Attachment IconImplementation 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
2002LOOK - A Lazy Object-Oriented Kernel for Geometric Computation
In: Computational Geometry - Theory and Applications [22], 99-118
qJournal Article
2002Attachment IconSCIL - Symbolic Constraints in Integer Linear Programming.
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 75-87
qProceedings Article
2001A 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
2001Attachment IconA Remark on the Sign Variation Method for Real Root Isolationok - aus Kurts Publikationsliste, incl. attachment / ch 060914Unpublished/Draft
2001Attachment IconA Separation Bound for Real Algebraic Expressions
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 254-265
Proceedings Article
2001An 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
2001Attachment IconCNOP - 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 060831Proceedings Article
2001Attachment IconExact 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
2001Attachment IconFrom 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.pdfPart of a Book
2001Attachment IconFurthest site abstract Voronoi diagrams
In: International Journal of Computational Geometry & Applications [11], 583-616
Journal Article
2001Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems
In: International Journal of Computational Geometry & Applications [11], 305-337
Journal Article
2001Attachment IconTraveling Salesman-Based Curve Reconstruction in Polynomial Time
In: SIAM Journal on Computing [31], 27-66
ok - Eintrag mit Webseite abgeglichen / ch 061004Journal Article
2000Attachment IconA polyhedral approach to sequence alignment problems
In: Discrete Applied Mathematics [104], 143-186
Journal Article
2000Attachment IconA 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 entferntProceedings Article
2000Attachment IconA strong and easily computable separation bound for arithmetic expressions involving radicals
In: Algorithmica [27], 87-99
Journal Article
2000Attachment IconAverage-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model
In: Random Structures & Algorithms [16], 33-46
Journal Article
2000Attachment IconConstraint Programming and Graph Algorithms
In: Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00), 571-575
Proceedings Article
2000Attachment IconCurve reconstruction: Connecting dots with good reason
In: Computational Geometry [15], 229-244
Mehlhorn139.pdf=Verlagsversion
139.pdf=Autorenversion
Journal Article
2000Editorial
In: Computational Geometry [17], 1-2
Vorwort d. Hrsg.???Journal Article
2000Attachment IconExperiments 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
2000Attachment IconFaster 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
2000Attachment IconGeometric Computing with CGAL and LEDA
In: Curve and surface design, Saint-Malo 1999, 277-286
Proceedings Article
2000Attachment IconImplementation of $O(nm \log n)$ weighted matchings: The power of data structures
In: 4th International Workshop on Algorithm Engineering, 23-38
Proceedings Article
2000Attachment IconLOOK - a Lazy Object-Oriented Kernel for Geometric Computation
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 156-165
Proceedings Article
2000Attachment IconResource Constrained Shortest Paths
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 326-337
Proceedings Article
2000TSP-Based Curve Reconstruction in Polynomial Time
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 686-695
Proceedings Article
1999Attachment IconA 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
1999Attachment IconAn 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
1999Attachment IconChecking geometric programs or verification of geometric structures
In: Computational Geometry: Theory and Applications [12], 85-104
Journal Article
1999Checking 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 060828Proceedings Article
1999Curve reconstruction: Connecting dots with good reason
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 197-206
Proceedings Article
1999Editorial
In: Computational Geometry [12], 153-154
Journal Article
1999Attachment IconEfficient exact geometric computation made easy
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 341-350
Proceedings Article
1999I/O-optimal computation of segment intersections
In: Proceedings of the DIMACS Workshop on External Algorithms and Visualization, 131-138
Proceedings Article
1999Attachment IconLEDA-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
1999LEDA: a platform for combinatorial and geometric computingch 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=d0fe1014ee023ed44d7a3310045103fbBook
1999On 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 060828Journal Article
1999Attachment IconStructural 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
1999Ten Years of LEDA Some Thoughts (Abstract)
In: Algorithm engineering (WAE-99) : 3rd International Workshop, 14-14
Übertrag aus DBLP und Books-DB / ch 060828Proceedings Article
1999The Engineering of Some Bipartite Matching Programs
In: Algorithms and computation : 10th International Symposium, ISAAC'99, 1-3
Proceedings Article
1999The 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
1998A computational basis for higher-dimensional computational geometry and applications
In: Computational Geometry: Theory and Applications [10], 289-304
Journal Article
1998Attachment IconA 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
1998Attachment IconAmortisierte 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
1998From 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 060725Proceedings Article
1998Attachment IconFrom 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
1998Attachment IconMaximum 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
1998Attachment IconRandomized 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
1997Attachment IconA 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
1997Attachment IconA complete roundness classification procedure
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 129-138
Proceedings Article
1997A 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
1997A 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
1997Average-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
1997Kürzeste-Wege-Berechnung bei sehr großen Datenmengen
In: Promotion tut not: Innovationsmotor "Graduiertenkolleg", 113-132
Proceedings Article
1997Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time
In: Algorithmica [17], 183-198
Journal Article
1997On 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
1997Runtime 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
1997The 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
1996Attachment IconA 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
1996Attachment IconAlgorithms for Dense Graphs and Networks on the Random Access Computer
In: Algorithmica [15], 521-549
Journal Article
1996An 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
1996Checking Geometric Programs or Verification of Geometric Structures
In: 12th Annual ACM Symposium on Computational Geometry (SCG 96), 159-165
Proceedings Article
1996Komplexitätstheorie und Algorithmik
In: Informatik : Grundlagen - Anwendungen - Perspektiven, 113-116
Proceedings Article
1996Attachment IconOn the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm
In: Algorithmica [16], 233-242
Journal Article
1996Position 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
1996The 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
1996The LEDA Platform of Combinatorial and Geometric Computing
In: Proceedings of Conference on Computing: The Australian Theory Symposium, 126-126
Proceedings Article
1995A communication-randomness tradeoff for two-processor systems
In: Information and Computation [116], 155-161
Journal Article
1995Attachment IconExact Geometric Computation in LEDA
In: 11th ACM Symposium on Computational Geometry (SCG95), C18-C19
http://doi.acm.org/10.1145/220279.220330Proceedings Article
1995Experiences with the implementation of geometric algorithms
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 518-518
Proceedings Article
1995Guest 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
1995LEDA : A Platform for Combinatorial and Geometric Computingok - gefunden via Dagstuhl-Bib; Verfasser = Mehlhorn / ch 060927Report
1995Attachment IconLEDA: A Platform for Combinatorial and Geometric Computing
In: Communications of the ACM [38], 96-102
Journal Article
1995Attachment IconLower bounds for set intersection queries
In: Algorithmica [14], 154-168
Journal Article
1995On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka
In: Algorithms - ESA'95: 3rd Annual European Symposium, 185-198
Proceedings Article
1994Attachment IconA linear-time algorithm for the homotopic routing problem in grid graphs
In: SIAM Journal on Computing [23], 227-246
Journal Article
1994Attachment IconA lower bound for area-universal graphs
In: Information Processing Letters [51], 101-105
Journal Article
1994Attachment IconDynamic Perfect Hashing: Upper and Lower Bounds
In: SIAM Journal on Computing [23], 738-761
Journal Article
1994Attachment IconDynamic point location in general subdivisions
In: Journal of Algorithms [3], 342-380
Journal Article
1994Attachment IconHow 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
1994Attachment IconIntroduction
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
1994Maintaining dynamic sequences under equality-tests in polylogarithmic time
In: Discrete algorithms (SODA-94) : 5th annual ACM-SIAM symposium, 213-222
Proceedings Article
1994Attachment IconOn degeneracy in geometric computations
In: Discrete algorithms (SODA-94) : 5th annual ACM-SIAM symposium, 16-23
Proceedings Article
1994Attachment IconThe Implementation of Geometric Algorithms
In: Technology and foundations : Information Processing '94 ; proceedings of the IFIP 13th World Computer Congress, 223-231
Proceedings Article
1993A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedronok - Papierfassung / ch 060920
übertragen aus der Books-DB / ch060726
Report
1993Attachment IconA 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
1993Dynamic Interpolation Search
In: Journal of the ACM [40], 621-634
Journal Article
1993Attachment IconExact Algorithms for a Geometric Packing Problem (Extended Abstract)
In: Theoretical aspects of computer science (STACS-93) : 10th annual symposium, 317-322
Proceedings Article
1993Attachment IconFour Results on Randomized Incremental Constructions
In: Computational Geometry: Theory and Applications [3], 185-212
Journal Article
1993Lower Bounds for Set Intersection queries
In: Discrete algorithms (SODA-93) : 4th annual ACM-SIAM symposium, 194-201
Proceedings Article
1993Attachment IconMaintaining Discrete Probability Distributions Optimally
In: Automata, languages and programming (ICALP-93) : 20th international colloquium, 253-264
Proceedings Article
1993Attachment IconRandomized incremental construction of abstract Voronoi diagrams
In: Computational Geometry: Theory and Applications [3], 157-184
Journal Article
1993Attachment IconSearching, 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
1993Attachment IconTail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection
In: Computational Geometry: Theory and Applications [3], 235-246
Journal Article
1992Attachment IconA lower bound for the nondeterministic space complexity of context-free recognition
In: Information Processing Letters [42], 25-27
Journal Article
1992Attachment IconAlgorithm 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
1992Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
In: Algorithmica [8], 391-408
Journal Article
1992Dynamic Point Location in General Subdivisions
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 250-258
Proceedings Article
1992Four Results on Randomized Incremental Constructions
In: Theoretical aspects of computer science (STACS-92) : 9th annual symposium, 463-474
Proceedings Article
1992Attachment IconOn local routing of two-terminal nets
In: Journal of Combinatorial Theory / Series B [55], 33-72
Journal Article
1992Randomized 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
1992Recent 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
1992Selected 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
1992Simultaneous Inner and Outer Approximation of Shapes
In: Algorithmica [8], 365-389
Journal Article
1992Tail Estimates for the Space Complexity of Randomised Incremental Algorithms
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 89-93
Proceedings Article
1992Attachment Icon$k$ versus $k+1$ Index Registers and Modifiable versus Non-modifiable Programs
In: Information and Computation [101], 123-129
Journal Article
1991Attachment IconA Method for Obtaining Randomized Algorithms with Small Tail Probabilitiesok - 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
1991A Time-Randomness Tradeoff for Communication Complexity
In: Distributed Algorithms, 4th International Workshop, 390-401
Proceedings Article
1991Attachment IconComputing 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
1991Constructive Whitney-Graustein theorem, or how to untangle closed planar curves
In: SIAM Journal on Computing [20], 603-621
Journal Article
1991Dynamic Perfect Hashing: Upper and Lower Boundsok - aus dem Internet übertragen; kein pdf gefunden / ch 060918Report
1991On the construction of abstract Voronoi diagrams
In: Discrete & Computational Geometry [6], 211-224
Journal Article
1990A 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 060912Journal Article
1990Approximate 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#AltFKMNSU90Proceedings Article
1990Bounded ordered dictionaries in $O(\log \log n)$ time and $O(n)$ space
In: Information Processing Letters [35], 183-189
Journal Article
1990Can 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 060912Proceedings Article
1990Attachment IconCan a maximum flow be computed in $o(nm)$ time?Report
1990Attachment IconCompaction on the torus
In: IEEE Transactions on CAD of Integrated Circuits and Systems [9], 389-397
ok - kein pdf-file online abrufbar / ch 060912Journal Article
1990Data 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
1990Dynamic deferred data structuring
In: Information Processing Letters [35], 37-40
Journal Article
1990Attachment IconDynamic Fractional Cascading
In: Algorithmica [5], 215-241
Journal Article
1990Attachment IconFaster algorithms for the shortest path problem
In: Journal of the ACM [37], 213-223
Journal Article
1990Attachment IconHidden line elimination for isooriented rectanglesgefunden via BVB / ch 061102Report
1990Attachment IconHidden 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#MehlhornNU90Journal Article
1990LEDA - A Library of Efficient Data Types and Algorithms
In: GI - 20. Jahrestagung I, Informatik auf dem Weg zum Anwender, 35-39
Proceedings Article
1990LEDA: 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=1Proceedings Article
1990On 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
1990On the Complexity of a Game Related to the Dictionary Problem
In: SIAM Journal on Computing [19], 902-906
Journal Article
1990On the Construction of Abstract Voronoi Diagrams
In: Theoretical aspects of computer science (STACS-90) : 7th annual symposium, 227-239
Proceedings Article
1990On the Construction of Abstract Voronoi Diagrams, II
In: Algorithms (ISA-90) : 1st international symposium (SIGAL-90), 138-154
ok / ch060324Proceedings Article
1990Routing 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
1989A library of efficient data types and algorithms
In: Mathematical foundations of computer science (MFCS-89) : 14th international symposium, 88-106
Proceedings Article
1989Attachment IconAT$^2$-Optimal Galois Field Multiplier for VLSI
In: IEEE Transactions on Computers [38], 1333-1336
Journal Article
1989Attachment IconData structuresgefunden via BVB / ch 061102Report
1989Foundations of Programming Languagesprüfen: URL = "http://www.mpi-sb.mpg.de/~mehlhorn/ProgLangBooks.htmlBook
1989LEDA: 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 060327Proceedings Article
1989On 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 060405Proceedings Article
1989Attachment IconOn the construction of abstract Voronoi diagramsgefunden 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
1989Attachment IconOn the construction of abstract Voronoi diagrams, II.Report
1989Routing Problems in Grid Graphsok - aus BiVis / Papierfassung / ch 060920Report
1989Routing problems in grid graphsch 061103:
- gefunden via BVB
- aufergänzt via KOBV (nach Suche im KVK)
Report
1989Two Versus One Index Register and Modifiable Versus Non-modifiable Programs
In: Automata, languages and programming (ICALP-89) : 16th international colloquium, 603-609
Proceedings Article
1988Attachment IconA faster approximation algorithm for the Steiner problem in graphs
In: Information Processing Letters [27], 125-128
Journal Article
1988A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphsok - aus BIVis / der Papierfassung / ch 060920Report
1988A Lower Bound on the Complexity of the Union-Split-Find Problem
In: SIAM Journal on Computing [17], 1093-1102
Journal Article
1988Compaction on the Torusok - aus BIVis / der Papierfassung / ch 060920Report
1988Compaction on the Torus
In: VLSI algorithms and architectures : 3rd Aegean Workshop on Computing, AWOC 88, 212-225
Proceedings Article
1988Attachment IconCongruence, 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#AltMWW88Journal Article
1988Constructive Hopf's theorem: or how to untangle closed planar curvesok - aus der Papierfassung aufergänzt / ch 060918

übertragen aus Books-DB / ch 060806
Report
1988Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves
In: Automata, languages and programming (ICALP-88) : 15th international colloquium, 410-423
Proceedings Article
1988Datenstrukturen 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
1988Dynamic 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
1988Faster Algorithms for the Shortest Path Problemok - aufergänzt aus Papierfassung / ch 060920

übertragen aus der Book -DB / ch 060803
Report
1988Faster Algorithms for the Shortest Path Problemok - 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
1988Attachment IconOn 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
1988On Continuous Homotopic One Layer Routing (Extended Abstract)
In: Computational geometry and its applications (CG-88) : international workshop, 55-70
Proc aus Books-DBProceedings Article
1988Attachment IconParallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees
In: Information Processing Letters [27], 227-236
Journal Article
1988SFB 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#MehlhornZ88Proceedings Article
1988Upper and Lower Bounds for the Dictionary Problem
In: Algorithm theory (SWAT-88) : 1st Scandinavian workshop, 214-215
Proceedings Article
1987A Faster Approximation Algorithm for the Steiner Problem in Graphsok - Seitenzahl aufergänzt aus Papierfassung / ch 060920
übertragen aus Books-DB / ch 060806
Report
1987A faster compaction algorithm with automatic jog insertionSeitenzahl fehlt!!!
übertragen aus der Books-DB / ch 060806
Report
1987A 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 060921Proceedings Article
1987A $\log \log n$ data structure for three-sided range queries
In: Information Processing Letters [25], 269-273
Journal Article
1987Attachment IconArea-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 060912Journal Article
1987Attachment IconCongruence, similarity and symmetries of geometric objectsReport
1987Convergence, 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
1987Attachment IconDeterministic 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
1987Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: SIAM Journal on Computing [16], 808-835
Journal Article
1987On Local Routing of Two-Terminal Nets
In: STACS '87 : 4th Annual Symposium on Theoretical Aspects of Computer Science, 40-52
Proceedings Article
1987Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning treesübertragen aus der SULB / ch 060806Report
1986A Lower Bound for the Complexity of the Union-Split-Find Problemok - aus Papierfassung die Seitenzahl aufergänzt / ch 060920

bei der SULB fehlt der 3. Autor ...

übertragen aus Books-DB / ch 060806
Report
1986Attachment IconAlgorithms for Routing in Planar Graphs
In: Acta Informatica [23], 163-176
Journal Article
1986Attachment IconAn Amortized Analysis of Insertions into AVL-Trees
In: SIAM Journal on Computing [15], 22-33
Journal Article
1986Area-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
1986AT$^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#FurerM86Proceedings Article
1986Attachment IconChannel Routing in Knock-Knee Mode: Simplified Algorithms and Proofs
In: Algorithmica [1], 213-221
Journal Article
1986Datenstrukturen 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
1986Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: Mathematical Foundations of Computer Science, 12th Symposium (MFCS 1986), 199-208
Proceedings Article
1986Dynamic fractional cascadinggefunden via BVB / ch 061102Report
1986Grundlagen der Programmiersprachenaus Books-DB übertragen / ch060724Book
1986Attachment IconOn BF-orderable graphs
In: Discrete Applied Mathematics [15], 315-327
Journal Article
1986On Local Routing of Two-Terminal Netsok - aus Papierfassung aufergänzt / ch 060922

aus BiVis übertragen / ch060920
Report
1986Attachment IconRouting through a Generalized Switchbox
In: Journal of Algorithms [7], 510-531
Journal Article
1986Attachment IconRouting 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
1986Attachment IconSorting Jordan Sequences in Linear Time Using Level-Linked Search Trees
In: Information and Control [68], 170-184
Journal Article
1986Attachment IconÜber Verdrahtungsalgorithmen
In: Informatik Spektrum [9], 227-234
Journal Article
1986VLSI Algorithms and Architectures, Aegean Workshop on Computing - >> Dublette
In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 328
Proceedings
1986VLSI Algorithms and Architectures, Aegean Workshop on Computing - >> Dublette
In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 328
Proceedings
1986Attachment IconVLSI 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
1985Attachment IconA fast algorithm for renaming a set of clauses as a Horn set
In: Information Processing Letters [21], 269-272
Journal Article
1985Area-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
1985Deterministic simulation of idealized parallel computers on more realistic onesok - Seitenzahl aus Papierfassung aufergänzt / ch 060920

übertragen aus der Books-DB / ch 060803
Report
1985Attachment IconDynamic Interpolation Search
In: Automata, languages and programming (ICALP-85) : 12th international colloquium, 424-434
lncs-angaben aus books-DB übertragen / ch 200706Proceedings Article
1985Dynamization of geometric data structuresok - gefunden via Dagstuhl - Suche nach Mehlhorn als Verfasser / ch 060927Report
1985Dynamization 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
1985Attachment IconFast Triangulation of the Plane with Respect to Simple Polygons
In: Information and Control [64], 52-76
Journal Article
1985Attachment IconIntersecting 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) / ch060721Proceedings Article
1985On BF-perfect graphsok - aus BiVis übertragen, Seitenzahl aus Papierfassung ergänzt / ch060920Report
1985Routing Through a Generalized Switchbox
In: Automata, languages and programming (ICALP-85) : 12th international colloquium, 328-337
lncs-angaben aus books-DB übertragen / ch 200706Proceedings Article
1985Attachment IconSearching Semisorted Tables
In: SIAM Journal on Computing [14], 840-848
Journal Article
1985Sorting 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
1984Attachment IconAlgorithms for routing in planar graphsok - aus Papierfassung Number korrigiert + Seitenzahl ergänzt / ch 060920

übertragen aus der Books-DB / ch 060803
Report
1984Area-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 060806Proceedings Article
1984Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proofok - aus Papierfassung Seitenzahl ergänzt / ch 060920

übertragen aus der Books-DB / ch 060803
Report
1984Data structures and algorithms. Volume 1 : Sorting and searchingaus Books-DB übertragen / ch 060724Book
1984Data structures and algorithms. Volume 2 : Graph algorithms and NP-completenessaus Books-DB übertragen / ch 060724Book
1984Data structures and algorithms. Volume 3 : Multi-dimensional searching and computational geometryaus Books-DB übertragen / ch 060724Book
1984Attachment IconFour results on the complexity of VLSI computation
In: Advances in Computing Research [2], 1-22
Journal Article
1984Intersecting a line and a simple polygon
In: EATCS Bulletin [22], 120-121
Journal Article
1984Attachment IconLocal routing of two-terminal nets is easyReport
1984On 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 060806Proceedings Article
1984On the complexity of partial match retrieval
In: Information Processing Letters [19], 61-65
Journal Article
1984Attachment IconPartial match retrieval in implicit data structures
In: Information Processing Letters [19], 61-65
Journal Article
1984Randomized 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 / ch060921Journal Article
1984Attachment IconRouting through a generalized switchboxok - mit Papierfassung abgeglichen / ch 060921

Achtung!! Fachbereich und MPI / SULB unterschiedliche Report Nummern ! / ch 060919

übertragen aus der Books-DB / ch 060804
Report
1984Sorting Jordan sequences in linear timeSeitenzahl fehlt !!! / 060920
übertragen aus der Books-DB / ch 060803
Report
1984Attachment IconSpace Sweep Solves Intersection of Convex Polyhedra
In: Acta Informatica [21], 501-519
ok - aus Journal aufergänzt und pdf eingefügt / ch 060907Journal Article
1984Attachment IconSpace sweep solves intersection of two convex polyhedra elegantlyReport
1984Attachment IconThe 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 060806Proceedings 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=bb2923ecbe700b1f6be07530449f1bc0Journal Article
1983A 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 060806Proceedings Article
1983Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Timeok - gemäß Papierfassung / ch 060919Report
1983Attachment IconArea-Time Optimal VLSI Integer Mutliplier with Minimum Computation Time
In: Information and Control [58], 137-156
Journal Article
1983Attachment IconCost 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
1983Fast 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 060806Proceedings Article
1983Four results on the complexity of VLSI computationsch 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
1983Granularity of parallel memoriesok - 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
1983Routing through a Rectangleok - aus BiVis übertragen, Seitenzahl aus SULB, mit Papierfassung abgeglichen / ch060919Report
1983Attachment IconThe HILL System: A Design Environment for the Hierarchical Specification, Compaction, and Simulation of Integrated Circuit Layoutsok - aufergänzt aus der Papierfassung / ch 060919

übertragen aus der Books-DB / ch 060804

UB: OCR über das Papier laufen gelassen
Report
1983The Recognition of Deterministic CFL's in Small Time and Space
In: Information and Control [56], 34-51
kein Zugriff auf das pdf-file / ch 060912Journal Article
1983VLSI Complexity, Efficient VLSI Algorithms and the HILL Design Systemaus der Papierfassung aufergänzt / 060919

übertragen aus der Books-DB / ch 060804
Report
1983$AT^2$-optimal VLSI for integer division and integer square rootingReport
1983$AT^2$-optimal VLSI multipliers with minimum computation time
In: Information & Control [58], 137-196
Journal Article
1982A 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=157Journal Article
1982Attachment IconA Partial Analysis of Height-Balanced Trees Under Random Insertions and Deletions
In: SIAM Journal on Computing [11], 748-760
Journal Article
1982Attachment IconA Probabilistic Algorithm for Vertex Connectivity of Graphs
In: Information Processing Letters [15], 135-136
Journal Article
1982Cost tradeoffs in graph embeddings, with applicationsReport
1982Las 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 060806Proceedings Article
1982Attachment IconOn the Program Size of Perfect and Universal Hash Functions
In: 23th Annual Symposium on Foundations of Computer Science (FOCS 1982), 170-175
Proceedings Article
1982Attachment IconThe Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees
In: Information and Control [55], 125-174
Journal Article
1981Attachment IconArbitrary 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
1981Cost 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 060806Proceedings Article
1981Attachment IconLower bounds on the efficiency of transforming static data structures into dynamic structures
In: Mathematical Systems Theory [15], 1-16
Journal Article
1981On the Complexity of VLSI-Computations
In: VLSI Systems and Computations [??], 89-99
Journal Article
1981Attachment IconOptimal dynamization of decomposable searching problems
In: Information Processing Letters [12], 93-98
Journal Article
1981Partial 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 060806Proceedings Article
1981Attachment IconRobust balancing in B-trees
In: Theoretical computer science : 5th GI-conference, 234-244
Proc.Daten aus Books-DB übertragen / ch 060806Proceedings Article
1980A 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 060807Proceedings Article
1980Attachment IconAn Efficient Algorithm for Constructing Nearly Optimal Prefix Codes
In: IEEE Transactions on Information Theory [26], 513-517
Journal Article
1980Attachment IconBinary Search Trees: Average and Worst Case Behavior
In: Elektronische Informationsverarbeitung und Kybernetik [16], 41-61
Journal Article
1980Attachment IconCodes: 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
1980Lower bounds on the efficiency of transforming static data structures into dynamic structuresgefunden via BVB / ch 061102Report
1980Attachment IconOn the Average Number of Rebalancing Operations in Weight-Balanced Trees
In: Theoretical Computer Science [11], 303-320
Journal Article
1980Optimal dynamization of decomposable searching problemsgefunden via BVB / ch 061102Report
1980Attachment IconPebbling 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 060807Proceedings Article
1979Attachment IconComplexity 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
1979Attachment IconDynamic Binary Search
In: SIAM Journal on Computing [8], 175-198
ok / ch 070104
- abgeglichen mit den Webseiten
- pdf + abstract eingetragen
Journal Article
1979Attachment IconDynamic data structures
In: Mathematical Centre Tracts [108], 71-96
Journal Article
1979Attachment IconKonzepte 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 060807Proceedings Article
1979Attachment IconMittlere 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 060807Proceedings Article
1979On 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 060808Journal Article
1979Attachment IconParsing Macro Grammars Top Down
In: Information and Control [40], 123-143
Journal Article
1979Attachment IconSearching, 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
1979Attachment IconSome Remarks on Boolean Sums
In: Acta Informatica [12], 371-375
ok / 070104
- mit webseiten abgeglichen
- pdf + abstract eingefügt
Journal Article
1979Some 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
1979Attachment IconSorting Presorted Files
In: Theoretical Computer Science, 4th GI-Conference, 199-212
http://dblp.uni-trier.de/rec/bibtex/conf/tcs/Mehlhorn79 / ch 060807Proceedings Article
1978An efficient algorithm for constructing nearly optimal prefix codesok - mit Papierfassung abgeglichen / ch 060921
(der Titel ist wirklich komplett kleingeschrieben)

SULB, Number gemäß BiVis korrigiert / ch 060919
Report
1978Arbitrary Weight Changes in Dynamic Treesok - mit Papierfassung abgeglichen / ch 060921

aus BiVis übertragen, Seitenzahl aus SULB / ch060919
Report
1978Codes: Unequal Probabilities, Unequal Letter Costok - aus BiVis und Papierfassung übertragen / ch060919Report
1978Codes: 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 060919Proceedings Article
1978Complexity Arguments in Algebraic Language Theoryok - mit Papierfassung abgeglichen / ch 060921

aus BiVis übertragen, Seitenzahl & Bericht-Nr aus SULB / ch060919
Report
1978Effiziente Algorithmen: Ein Beispielok - mit Papierfassung abgeglichen / ch 060921

aus BiVis übertragen, Seitenzahl aus SULB / ch060919
Report
1978Attachment IconEffiziente Algorithmen: Ein Beispiel
In: Informatik Spektrum [1], 81-89
http://dblp.uni-trier.de/db/journals/insk/insk1.html#Mehlhorn78 / ch 060807Journal Article
1978On the Average Number of Rebalancing Operations in Weight-Balanced Treesok - mit Papierfassung abgeglichen / ch 060921

aus BiVis übertragen, Seitenzahl aus SULB / ch060919
Report
1978Sorting Presorted Filesok - mit Papierfassung abgeglichen / ch 060921

aus BiVis übertragen, Seitenzahl aus SULB / ch060919
Report
1977Attachment IconA 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
1977Dynamic Binary Search
In: Automata, Languages and Programming : Fourth Colloquium (ICALP-77), 323-336
ok - aus Books-DB und DBLP übertragen und ergänzt / ch 060918Proceedings Article
1977Effiziente AlgorithmenBook
1977Attachment IconVan 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
1976An improved lower bound on the formula complexity of context-free recognitiongefunden 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
1976Attachment IconAn 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
1976An O(n log n) lower bound for the synchronous circuit size of integer multiplicationok - mit Papierfassung abgeglichen / ch 060921
aus BiVis übertragen, aus SULB Seitenzahl ergänzt / ch060919
Report
1976Binary Search Trees: Average and Worst Case Behaviorok - mit Papierfassung abgeglichen / ch 060921

erg!!! (Seitenzahl, Berichtnummer) - aus BiVis übertragen / ch060919
Report
1976Binary 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 060807Proceedings Article
1976Attachment IconBracket-languages are recognizable in logarithmic space
In: Information Processing Letters [5], 168-170
ok / ch 070109
- mit Papierfassung abgeglichen
- pdf eingefügt
Journal Article
1976Dynamic Binary Searchok - mit Papierfassung abgeglichen / ch 060921

erg!!! (Seitenzahl, Berichtnummer) - aus BiVis übertragen / ch060919
Report
1976Dynamic Binary Search Trees : Extended Abstractsgefunden via BVB / ch 061102Report
1976Attachment IconLower Bounds for the Space Complexity of Context-Free Recognition
In: Third International Colloquium on Automata, Languages and Programming, 338-354
Proceedings Article
1976Attachment IconMonotone 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
1976Attachment IconPolynomial and abstract subrecursive classes
In: Journal of Computer and System Sciences [12], 147-178
DB Books: P-76-02Journal Article
1976Top Down Parsing of Macro Grammars
In: GI - 6. Jahrestagung, 95-108
http://dblp.uni-trier.de/db/conf/gi/gi76.html#HeydthausenM76 / ch 060807Proceedings Article
1976Top down parsing of macro grammars (preliminary report)ok - Abgleich mit Papierfassung / ch 060921
ok - aus BiVis übertragen, aus SULB Seitenzahl ergänzt / ch060919
Report
1975A game on graphsgefunden via BVB / ch 061103Report
1975Attachment IconA 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
1975Best 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
1975Bracket-Languages are Recognizable in Logarithmic Spaceok - mit Papierfassung abgeglichen / ch 060921

aus BiVis übertragen, Seitenzahl aus SULB / ch060919
Report
1975Monotone 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 060918Proceedings Article
1975Attachment IconNearly 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
1975Untere Schranken für den Platzbedarf bei der kontext-freien Analyseok - mit Papierfassung abgeglichen / ch 060921

aus BiVis übertragen, Seitenzahl aus SULB / ch060919
Report
1974Attachment IconPolynomial 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
1974Polynomial 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=999Report
1974Attachment IconPolynomial 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
1974Attachment IconThe '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
1973Attachment IconOn 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
1973On 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=999Report
1973The "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=999Report
13
Show details for Mehlhorn, Kurt (ed.)Mehlhorn, Kurt (ed.)
2
Show details for Mehlhorn, K.Mehlhorn, K.
3
Show details for Mehnert, JensMehnert, Jens
1
Show details for Meinel, ChristophMeinel, Christoph
9
Show details for Meiser, StefanMeiser, Stefan
1
Show details for Mercas, RobertMercas, Robert
31
Show details for Mestre, JulianMestre, Julian
1
Show details for Metzler, MatthiasMetzler, Matthias
1
Show details for Meyer-Bäse, AnkeMeyer-Bäse, Anke
5
Show details for Meyer auf der Heide, FriedhelmMeyer auf der Heide, Friedhelm
1
Show details for Meyerhenke, HenningMeyerhenke, Henning
2
Show details for Meyerovitch, MichalMeyerovitch, Michal
1
Show details for Meyer, AndreasMeyer, Andreas
46
Show details for Meyer, UlrichMeyer, Ulrich
1
Show details for Meyer, Ulrich (ed.)Meyer, Ulrich (ed.)
1
Show details for Meyer, UlrikeMeyer, Ulrike
1
Show details for Michael, DimitriosMichael, Dimitrios
15
Show details for Michail, DimitriosMichail, Dimitrios
2
Show details for Michail, D.Michail, D.
1
Show details for Michalewicz, ZbigniewMichalewicz, Zbigniew
1
Show details for Michalik, HaraldMichalik, Harald
1
Show details for Michel, LaurentMichel, Laurent
1
Show details for Middendorf, Martin (ed.)Middendorf, Martin (ed.)
1
Show details for Miklos, BalintMiklos, Balint
1
Show details for Miller, Julian F. (ed.)Miller, Julian F. (ed.)
2
Show details for Miller, Julian (ed.)Miller, Julian (ed.)
1
Show details for Miller, KillianMiller, Killian
3
Show details for Miller, TobiasMiller, Tobias
2
Show details for Millozzi, StefanoMillozzi, Stefano
9
Show details for Milosavljevic, NikolaMilosavljevic, Nikola
2
Show details for Minder, LorenzMinder, Lorenz
1
Show details for Mintz, AviadMintz, Aviad
8
Show details for Misra, NeeldharaMisra, Neeldhara
1
Show details for Mitchell, Joe (ed.)Mitchell, Joe (ed.)
1
Show details for Mitsche, DieterMitsche, Dieter
6
Show details for Mitzenmacher, MichaelMitzenmacher, Michael
4
Show details for Mnich, MatthiasMnich, Matthias
1
Show details for Moehring, Rolf H.Moehring, Rolf H.
1
Show details for Möhring, Rolf H.Möhring, Rolf H.
1
Show details for Mokbel, Mohamed F.Mokbel, Mohamed F.
2
Show details for Molter, HendrikMolter, Hendrik
2
Show details for Moore, Jason (ed.)Moore, Jason (ed.)
2
Show details for Moran, ShayMoran, Shay
1
Show details for Moran, ShlomoMoran, Shlomo
1
Show details for Moret, BernardMoret, Bernard
1
Show details for Morgenstern, BurkhardMorgenstern, Burkhard
1
Show details for Mörig, MarcMörig, Marc
1
Show details for Morozov, DmitriyMorozov, Dmitriy
2
Show details for Mortensen, Christian WormMortensen, Christian Worm
1
Show details for Moser, HannesMoser, Hannes
1
Show details for Motskin, ArikMotskin, Arik
10
Show details for Mount, David M.Mount, David M.
4
Show details for Mourrain, BernardMourrain, Bernard
1
Show details for Mozes, ShayMozes, Shay
1
Show details for Mueck, ThomasMueck, Thomas
1
Show details for Müller, HaikoMüller, Haiko
2
Show details for Müller, JoachimMüller, Joachim
2
Show details for Müller, MatthiasMüller, Matthias
3
Show details for Müller, MichaelMüller, Michael
8
Show details for Müller, PeterMüller, Peter
2
Show details for Müller, TobiasMüller, Tobias
1
Show details for Munro, I.Munro, I.
1
Show details for Munro, J.Munro, J.
4
Show details for Munro, J. IanMunro, J. Ian
1
Show details for Musial, Peter M.Musial, Peter M.
7
Show details for Mustafa, Nabil H.Mustafa, Nabil H.
3
Show details for Muthukrishnan, S.Muthukrishnan, S.
44
Show details for Mutzel, PetraMutzel, Petra
4
Show details for Mütze, TorstenMütze, Torsten
1
Show details for Nagarajan, ViswanathNagarajan, Viswanath
1
Show details for Nagel, LarsNagel, Lars
1
Show details for Näher, SNäher, S
45
Show details for Näher, StefanNäher, Stefan
1
Show details for Näher, Stefan (ed.)Näher, Stefan (ed.)
1
Show details for Nanavati, AkashNanavati, Akash
2
Show details for Nanni, UmbertoNanni, Umberto
1
Show details for Nanongkai, DanuponNanongkai, Danupon
1
Show details for Narayanaswamy, N.S.Narayanaswamy, N.S.
2
Show details for Narayan, OruttomNarayan, Oruttom
1
Show details for Narodytska, NinaNarodytska, Nina
1
Show details for Narula, VishalNarula, Vishal
3
Show details for Nasre, MeghanaNasre, Meghana
1
Show details for Nasre, M.Nasre, M.
1
Show details for Nasr, MeghanaNasr, Meghana
10
Show details for Naujoks, RouvenNaujoks, Rouven
1
Show details for Navarro, GonzaloNavarro, Gonzalo
1
Show details for Nechushtan, OrenNechushtan, Oren
1
Show details for Nederlof, JesperNederlof, Jesper
3
Show details for Nekrich, YakovNekrich, Yakov
1
Show details for Nest, MartinNest, Martin
1
Show details for Neukirch, MarkusNeukirch, Markus
4
Show details for Neumann, AdrianNeumann, Adrian
1
Show details for Neumann, A.Neumann, A.
2
Show details for Neumann, DirkNeumann, Dirk
67
Show details for Neumann, FrankNeumann, Frank
2
Show details for Neumann, Frank (ed.)Neumann, Frank (ed.)
1
Show details for Newman, IlanNewman, Ilan
1
Show details for Newman, I.Newman, I.
1
Show details for Newo Kenmogne, RegisNewo Kenmogne, Regis
1
Show details for Neyer, GabrieleNeyer, Gabriele
1
Show details for Nguyen, AnNguyen, An
2
Show details for Nichterlein, Andr{Nichterlein, Andr{
3
Show details for Niedermeier, RolfNiedermeier, Rolf
3
Show details for Niehren, JoachimNiehren, Joachim
3
Show details for Nievergelt, JurgNievergelt, Jurg
1
Show details for Nievergelt, Jurg (ed.)Nievergelt, Jurg (ed.)
2
Show details for Nikoletseas, SotirisNikoletseas, Sotiris
1
Show details for Nilsson, StefanNilsson, Stefan
1
Show details for Nishimura, NaomiNishimura, Naomi
1
Show details for Nissen, MarcoNissen, Marco
1
Show details for North, StephenNorth, Stephen
2
Show details for Nor, IgorNor, Igor
1
Show details for Novotni, DominikNovotni, Dominik
3
Show details for Nowotka, DirkNowotka, Dirk
3
Show details for Nutov, ZeevNutov, Zeev
3
Show details for O'Dúnlaing, ColmO'Dúnlaing, Colm
1
Show details for O'Leary, DianneO'Leary, Dianne
1
Show details for O'Neill, Michael (ed.)O'Neill, Michael (ed.)
3
Show details for O'Reilly, Una-MayO'Reilly, Una-May
1
Show details for Oberhauser, FredOberhauser, Fred
3
Show details for Odenthal, ThomasOdenthal, Thomas
1
Show details for Okamoto, YoshioOkamoto, Yoshio
2
Show details for Okhotin, AlexanderOkhotin, Alexander
2
Show details for Oliveto, PietroOliveto, Pietro
3
Show details for Oliveto, Pietro SimoneOliveto, Pietro Simone
1
Show details for Oliveto, Pietro S.Oliveto, Pietro S.
3
Show details for Orlin, James B.Orlin, James B.
1
Show details for Orlis, ChristosOrlis, Christos
6
Show details for Osbild, RalfOsbild, Ralf
2
Show details for Osipov, VitalyOsipov, Vitaly
1
Show details for Ossamy, RodrigueOssamy, Rodrigue
4
Show details for Osthus, DerykOsthus, Deryk
1
Show details for Östlin, AnnaÖstlin, Anna
2
Show details for Ost, KirstinOst, Kirstin
2
Show details for Ott, SebastianOtt, Sebastian
1
Show details for Oudalov, VladimirOudalov, Vladimir
3
Show details for Overmars, Mark H.Overmars, Mark H.
1
Show details for Pacholski, LeszekPacholski, Leszek
2
Show details for Pagh, RasmusPagh, Rasmus
6
Show details for Paluch, KatarzynaPaluch, Katarzyna
1
Show details for Paluch, Katarzyna E.Paluch, Katarzyna E.
1
Show details for Pal, ArindamPal, Arindam
27
Show details for Panagiotou, KonstantinosPanagiotou, Konstantinos
2
Show details for Panconesi, AlessandroPanconesi, Alessandro
8
Show details for Pantziou, Grammati E.Pantziou, Grammati E.
1
Show details for Pantziou, G. E.Pantziou, G. E.
2
Show details for Papadopoulou, VickyPapadopoulou, Vicky
2
Show details for Papaioannou, EviPapaioannou, Evi
1
Show details for Papatheodorou, Theodore S. (ed.)Papatheodorou, Theodore S. (ed.)
11
Show details for Papatriantafilou, MarinaPapatriantafilou, Marina
1
Show details for Parente, DomenicoParente, Domenico
1
Show details for Park, KunsooPark, Kunsoo
3
Show details for Park, Sang-MinPark, Sang-Min
2
Show details for Parreira, JosianeParreira, Josiane
1
Show details for Pascual, FannyPascual, Fanny
1
Show details for Pasechnik, DmitriiPasechnik, Dmitrii
2
Show details for Pasquale, FrancescoPasquale, Francesco
1
Show details for Pasqualone, GiulioPasqualone, Giulio
2
Show details for Paterson, MikePaterson, Mike
1
Show details for Patt-Shamir, BoazPatt-Shamir, Boaz
1
Show details for Paturi, RamamohanPaturi, Ramamohan
2
Show details for Pauling, JoschPauling, Josch
1
Show details for Pauly, MarkPauly, Mark
1
Show details for Paul, ChristophePaul, Christophe
1
Show details for Paul, MarkusPaul, Markus
2
Show details for Paul, Wolfgang J.Paul, Wolfgang J.
13
Show details for Pelc, AndrzejPelc, Andrzej
1
Show details for Peleg, DavidPeleg, David
2
Show details for Pelikan, Martin (ed.)Pelikan, Martin (ed.)
1
Show details for Pemmaraju, Sriram V.Pemmaraju, Sriram V.
1
Show details for Penninkx, EelkoPenninkx, Eelko
1
Show details for Penn, MichaelPenn, Michael
1
Show details for Penttonen, MarttiPenttonen, Martti
2
Show details for Pérennes, StéphanePérennes, Stéphane
1
Show details for Perez-Gimenez, XavierPerez-Gimenez, Xavier
1
Show details for Petersson, OlaPetersson, Ola
3
Show details for Petitjean, SylvainPetitjean, Sylvain
1
Show details for Petri, Tobias H.Petri, Tobias H.
8
Show details for Pettie, SethPettie, Seth
21
Show details for Philip, GeevarghesePhilip, Geevarghese
3
Show details for Pilipczuk, MarcinPilipczuk, Marcin
1
Show details for Pilipczuk, MichaPilipczuk, Micha
2
Show details for Pilipczuk, MichałPilipczuk, Michał
1
Show details for Pillichshammer, FriedrichPillichshammer, Friedrich
1
Show details for Pillichshammer, PeterPillichshammer, Peter
1
Show details for Pinotti, M. CristinaPinotti, M. Cristina
14
Show details for Pion, SylvainPion, Sylvain
1
Show details for Piskorski, JakubPiskorski, Jakub
1
Show details for Piwowarski, BenjaminPiwowarski, Benjamin
4
Show details for Plandowski, WojciechPlandowski, Wojciech
2
Show details for Pocchiola, MichelPocchiola, Michel
4
Show details for Pogalnikova, RozaPogalnikova, Roza
2
Show details for Pohl, SebastianPohl, Sebastian
1
Show details for Poli, Ricardo (ed.)Poli, Ricardo (ed.)
1
Show details for Poli, Riccardo (ed.)Poli, Riccardo (ed.)
1
Show details for Pollack, Jordan (ed.)Pollack, Jordan (ed.)
7
Show details for Polzin, TobiasPolzin, Tobias
1
Show details for Pool, RenePool, Rene
1
Show details for Poon, Sheung-HungPoon, Sheung-Hung
3
Show details for Porkolab, LorantPorkolab, Lorant
1
Show details for Portz, SaschaPortz, Sascha
1
Show details for Pór, AttilaPór, Attila
1
Show details for Potikoglou, IoannisPotikoglou, Ioannis
2
Show details for Pouchkarev, IgorPouchkarev, Igor
1
Show details for Pountourakis, EmmanouilPountourakis, Emmanouil
1
Show details for Pourmiri, AliPourmiri, Ali
1
Show details for Prädel, LarsPrädel, Lars
3
Show details for Prasad, SushilPrasad, Sushil
1
Show details for Prechelt, LutzPrechelt, Lutz
1
Show details for Precup, DoinaPrecup, Doina
1
Show details for Preetham, A. J.Preetham, A. J.
1
Show details for Preis, B.Preis, B.
1
Show details for Prellberg, ThomasPrellberg, Thomas
11
Show details for Preparata, Franco P.Preparata, Franco P.
3
Show details for Preparata, F. P.Preparata, F. P.
6
Show details for Priebe, VolkerPriebe, Volker
2
Show details for Privetivy, AlesPrivetivy, Ales
1
Show details for Prömel, Hans JürgenPrömel, Hans Jürgen
6
Show details for Pruhs, KIrkPruhs, KIrk
1
Show details for Przytycka, TeresaPrzytycka, Teresa
1
Show details for Przytyzka, TeresaPrzytyzka, Teresa
1
Show details for Puglisi, Simon J.Puglisi, Simon J.
9
Show details for Pyrga, EvangeliaPyrga, Evangelia
3
Show details for P. GaoP. Gao
1
Show details for Qian, JiaweiQian, Jiawei
3
Show details for Räcke, HaraldRäcke, Harald
3
Show details for Radhakrishnan, JaikumarRadhakrishnan, Jaikumar
1
Show details for Radhakrishnan, R.Radhakrishnan, R.
1
Show details for Ragde, PrabhakarRagde, Prabhakar
1
Show details for Raghavendra Rao, B. V.Raghavendra Rao, B. V.
1
Show details for Raidl, Günther R. (ed.)Raidl, Günther R. (ed.)
1
Show details for Rajaraman, RajmohanRajaraman, Rajmohan
1
Show details for Rakrak, SaidRakrak, Said
1
Show details for Ramachandran, VijayaRamachandran, Vijaya
1
Show details for Ramakrishna, G.Ramakrishna, G.
1
Show details for Ramanujan, M. S.Ramanujan, M. S.
6
Show details for Raman, RajeevRaman, Rajeev
6
Show details for Raman, RajivRaman, Rajiv
8
Show details for Raman, VenkateshRaman, Venkatesh
5
Show details for Ramesh, HariharanRamesh, Hariharan
3
Show details for Ramezani, FahimehRamezani, Fahimeh
25
Show details for Ramos, Edgar A.Ramos, Edgar A.
1
Show details for Rangan, C. PanduRangan, C. Pandu
2
Show details for Ranjan, DeshRanjan, Desh
2
Show details for Rao, P. SrinivasaRao, P. Srinivasa
1
Show details for Rao, S. SrinivasaRao, S. Srinivasa
2
Show details for Rasch, RonaldRasch, Ronald
1
Show details for Rast, ThomasRast, Thomas
1
Show details for Rathe, UlrichRathe, Ulrich
2
Show details for Rauch, MonikaRauch, Monika
10
Show details for Rauf, ImranRauf, Imran
1
Show details for Rau, StephanRau, Stephan
2
Show details for Ravi, R.Ravi, R.
6
Show details for Rawitz, DrorRawitz, Dror
2
Show details for Rawlins, Gregory J.E.Rawlins, Gregory J.E.
9
Show details for Ray, RahulRay, Rahul
18
Show details for Ray, SaurabhRay, Saurabh
1
Show details for Raza, SarfrazRaza, Sarfraz
1
Show details for Razgon, IgorRazgon, Igor
2
Show details for Reed, BruceReed, Bruce
11
Show details for Reichel, JoachimReichel, Joachim
4
Show details for Reinelt, GerhardReinelt, Gerhard
11
Show details for Reinert, KnutReinert, Knut
1
Show details for Reinhard, KlausReinhard, Klaus
2
Show details for Reinstädtler, MartinReinstädtler, Martin
1
Show details for Rema, AnnaRema, Anna
1
Show details for Remy, JanRemy, Jan
1
Show details for Reps, Thomas (ed.)Reps, Thomas (ed.)
1
Show details for Reussner, RalfReussner, Ralf
2
Show details for Reuter, MaxReuter, Max
1
Show details for Richards, BradRichards, Brad
1
Show details for Richa, Andrea W.Richa, Andrea W.
1
Show details for Rieger, H.Rieger, H.
1
Show details for Rieger, JoachimRieger, Joachim
2
Show details for Rinaldi, GiovanniRinaldi, Giovanni
1
Show details for Rivals, EricRivals, Eric
4
Show details for Rizkallah, ChristineRizkallah, Christine
3
Show details for Rizzi, RomeoRizzi, Romeo
1
Show details for Rizzi, R.Rizzi, R.
3
Show details for Röglin, HeikoRöglin, Heiko
4
Show details for Rohnert, HansRohnert, Hans
2
Show details for Rohnert, H.Rohnert, H.
1
Show details for Röhrig, HeinRöhrig, Hein
1
Show details for Rosamond, Fraces A.Rosamond, Fraces A.
2
Show details for Rosamond, Frances A.Rosamond, Frances A.
2
Show details for Rosenberg, Arnold L.Rosenberg, Arnold L.
3
Show details for Rosenstiehl, PierreRosenstiehl, Pierre
1
Show details for Rosen, AdiRosen, Adi
1
Show details for Rossignac, JarekRossignac, Jarek
2
Show details for Rote, GünterRote, Günter
1
Show details for Rote, Günter (ed.)Rote, Günter (ed.)
1
Show details for Rotics, UdiRotics, Udi
1
Show details for Rottmann, Klaus-DieterRottmann, Klaus-Dieter
1
Show details for Rozenberg, LiatRozenberg, Liat
8
Show details for Rüb, ChristineRüb, Christine

Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)