AAAAAA

   
Results: 1-16 |
Results: 16
MAXIMUM NETWORK FLOW WITH FLOATING-POINT ARITHMETIC
Authors: ALTHAUS E MEHLHORN K
Citation: E. Althaus et K. Mehlhorn, MAXIMUM NETWORK FLOW WITH FLOATING-POINT ARITHMETIC, Information processing letters, 66(3), 1998, pp. 109-113
ON THE ALL-PAIRS SHORTEST-PATH ALGORITHM OF MOFFAT AND TAKAOKA
Authors: MEHLHORN K PRIEBE V
Citation: K. Mehlhorn et V. Priebe, ON THE ALL-PAIRS SHORTEST-PATH ALGORITHM OF MOFFAT AND TAKAOKA, Random structures & algorithms, 10(1-2), 1997, pp. 205-220
MAINTAINING DYNAMIC SEQUENCES UNDER EQUALITY TESTS IN POLYLOGARITHMICTIME
Authors: MEHLHORN K SUNDAR R UHRIG C
Citation: K. Mehlhorn et al., MAINTAINING DYNAMIC SEQUENCES UNDER EQUALITY TESTS IN POLYLOGARITHMICTIME, Algorithmica, 17(2), 1997, pp. 183-198
A METHOD FOR OBTAINING RANDOMIZED ALGORITHMS WITH SMALL TAIL PROBABILITIES
Authors: ALT H GUIBAS L MEHLHORN K KARP R WIGDERSON A
Citation: H. Alt et al., A METHOD FOR OBTAINING RANDOMIZED ALGORITHMS WITH SMALL TAIL PROBABILITIES, Algorithmica, 16(4-5), 1996, pp. 543-547
ON THE EMBEDDING PHASE OF THE HOPCROFT AND TARJAN PLANARITY TESTING ALGORITHM
Authors: MEHLHORN K MUTZEL P
Citation: K. Mehlhorn et P. Mutzel, ON THE EMBEDDING PHASE OF THE HOPCROFT AND TARJAN PLANARITY TESTING ALGORITHM, Algorithmica, 16(2), 1996, pp. 233-242
AN O(N(3))-TIME MAXIMUM-FLOW ALGORITHM
Authors: CHERIYAN J HAGERUP T MEHLHORN K
Citation: J. Cheriyan et al., AN O(N(3))-TIME MAXIMUM-FLOW ALGORITHM, SIAM journal on computing, 25(6), 1996, pp. 1144-1170
A COMMUNICATION-RANDOMNESS TRADEOFF FOR 2-PROCESSOR SYSTEMS
Authors: FLEISCHER R JUNG H MEHLHORN K
Citation: R. Fleischer et al., A COMMUNICATION-RANDOMNESS TRADEOFF FOR 2-PROCESSOR SYSTEMS, Information and computation, 116(2), 1995, pp. 155-161
SPECIAL ISSUE - ACM SYMPOSIUM ON COMPUTATIONAL GEOMETRY, STONY-BROOK - FOREWORD
Authors: MEHLHORN K
Citation: K. Mehlhorn, SPECIAL ISSUE - ACM SYMPOSIUM ON COMPUTATIONAL GEOMETRY, STONY-BROOK - FOREWORD, Discrete & computational geometry, 14(4), 1995, pp. 363-363
LOWER BOUNDS FOR SET INTERSECTION QUERIES
Authors: DIETZ P MEHLHORN K RAMAN R UHRIG C
Citation: P. Dietz et al., LOWER BOUNDS FOR SET INTERSECTION QUERIES, Algorithmica, 14(2), 1995, pp. 154-168
LEDA - A PLATFORM FOR COMBINATORIAL AND GEOMETRIC COMPUTING
Authors: MEHLHORN K NAHER S
Citation: K. Mehlhorn et S. Naher, LEDA - A PLATFORM FOR COMBINATORIAL AND GEOMETRIC COMPUTING, Communications of the ACM, 38(1), 1995, pp. 96-102
ALGORITHMS - IMPLEMENTATION, LIBRARIES AND USE - INTRODUCTION
Authors: MEHLHORN K NAHER S NIEVERGELT J
Citation: K. Mehlhorn et al., ALGORITHMS - IMPLEMENTATION, LIBRARIES AND USE - INTRODUCTION, Journal of symbolic computation, 17(4), 1994, pp. 295-295
DYNAMIC POINT LOCATION IN GENERAL SUBDIVISIONS
Authors: BAUMGARTEN N JUNG H MEHLHORN K
Citation: N. Baumgarten et al., DYNAMIC POINT LOCATION IN GENERAL SUBDIVISIONS, Journal of algorithms, 17(3), 1994, pp. 342-380
DYNAMIC PERFECT HASHING - UPPER AND LOWER BOUNDS
Authors: DIETZFELBINGER M KARLIN A MEHLHORN K AUFDERHEIDE FM ROHNERT H TARJAN RE
Citation: M. Dietzfelbinger et al., DYNAMIC PERFECT HASHING - UPPER AND LOWER BOUNDS, SIAM journal on computing, 23(4), 1994, pp. 738-761
A LINEAR-TIME ALGORITHM FOR THE HOMOTOPIC ROUTING PROBLEM IN GRID GRAPHS
Authors: KAUFMANN M MEHLHORN K
Citation: M. Kaufmann et K. Mehlhorn, A LINEAR-TIME ALGORITHM FOR THE HOMOTOPIC ROUTING PROBLEM IN GRID GRAPHS, SIAM journal on computing, 23(2), 1994, pp. 227-246
A LOWER-BOUND FOR AREA-UNIVERSAL GRAPHS
Authors: BILARDI G CHAUDHURI S DUBHASHI D MEHLHORN K
Citation: G. Bilardi et al., A LOWER-BOUND FOR AREA-UNIVERSAL GRAPHS, Information processing letters, 51(2), 1994, pp. 101-105
DYNAMIC INTERPOLATION SEARCH
Authors: MEHLHORN K TSAKALIDIS A
Citation: K. Mehlhorn et A. Tsakalidis, DYNAMIC INTERPOLATION SEARCH, Journal of the Association for Computing Machinery, 40(3), 1993, pp. 621-634
Risultati: 1-16 |