AAAAAA
Results: 176-200/389
Authors:
LUBY M
VELICKOVIC B
Citation: M. Luby et B. Velickovic, ON DETERMINISTIC APPROXIMATION OF DNF, Algorithmica, 16(4-5), 1996, pp. 415-433
Authors:
ALON N
NAOR M
Citation: N. Alon et M. Naor, DERANDOMIZATION, WITNESSES FOR BOOLEAN MATRIX MULTIPLICATION AND CONSTRUCTION OF PERFECT HASH FUNCTIONS, Algorithmica, 16(4-5), 1996, pp. 434-449
Authors:
MULMULEY K
Citation: K. Mulmuley, RANDOMIZED GEOMETRIC ALGORITHMS AND PSEUDORANDOM GENERATORS, Algorithmica, 16(4-5), 1996, pp. 450-463
Authors:
SEIDEL R
ARAGON CR
Citation: R. Seidel et Cr. Aragon, RANDOMIZED SEARCH-TREES, Algorithmica, 16(4-5), 1996, pp. 464-497
Authors:
MATOUSEK J
SHARIR M
WELZL E
Citation: J. Matousek et al., A SUBEXPONENTIAL BOUND FOR LINEAR-PROGRAMMING, Algorithmica, 16(4-5), 1996, pp. 498-516
Authors:
KARP RM
LUBY M
HEIDE FMAD
Citation: Rm. Karp et al., EFFICIENT PRAM SIMULATION ON A DISTRIBUTED-MEMORY MACHINE, Algorithmica, 16(4-5), 1996, pp. 517-542
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
Authors:
SUNDER S
HE X
Citation: S. Sunder et X. He, AN NC ALGORITHM FOR FINDING A MINIMUM WEIGHTED COMPLETION-TIME SCHEDULE ON SERIES-PARALLEL GRAPHS, Algorithmica, 16(3), 1996, pp. 243-262
Authors:
GIAMMARRESI D
ITALIANO GF
Citation: D. Giammarresi et Gf. Italiano, DECREMENTAL 2-CONNECTIVITY AND 3-CONNECTIVITY ON PLANAR GRAPHS, Algorithmica, 16(3), 1996, pp. 263-287
Authors:
ILIOPOULOS CS
MOORE DWG
PARK K
Citation: Cs. Iliopoulos et al., COVERING A STRING, Algorithmica, 16(3), 1996, pp. 288-297
Authors:
AMBAINIS A
Citation: A. Ambainis, COMMUNICATION COMPLEXITY IN A 3-COMPUTER MODEL, Algorithmica, 16(3), 1996, pp. 298-301
Authors:
WANG LS
JIANG T
LAWLER EL
Citation: Ls. Wang et al., APPROXIMATION ALGORITHMS FOR TREE ALIGNMENT WITH A GIVEN PHYLOGENY, Algorithmica, 16(3), 1996, pp. 302-315
Authors:
EDAHIRO M
Citation: M. Edahiro, EQUISPREADING TREE IN MANHATTAN DISTANCE, Algorithmica, 16(3), 1996, pp. 316-338
Authors:
TAKAHASHI JY
SUZUKI H
NISHIZEKI T
Citation: Jy. Takahashi et al., SHORTEST NONCROSSING PATHS IN PLANE GRAPHS, Algorithmica, 16(3), 1996, pp. 339-357
Authors:
DENG XT
PAPADIMITRIOU CH
Citation: Xt. Deng et Ch. Papadimitriou, COMPETITIVE DISTRIBUTED DECISION-MAKING, Algorithmica, 16(2), 1996, pp. 133-150
Authors:
MUNRO JI
RAMAN V
Citation: Ji. Munro et V. Raman, FAST STABLE IN-PLACE SORTING WITH O(N) DATA MOVES, Algorithmica, 16(2), 1996, pp. 151-160
Authors:
HUANG SHS
LIU HF
VERMA RM
Citation: Shs. Huang et al., A NEW COMBINATORIAL APPROACH TO OPTIMAL EMBEDDINGS OF RECTANGLES, Algorithmica, 16(2), 1996, pp. 161-180
Authors:
NODINE MH
GOODRICH MT
VITTER JS
Citation: Mh. Nodine et al., BLOCKING FOR EXTERNAL GRAPH SEARCHING, Algorithmica, 16(2), 1996, pp. 181-214
Authors:
CHOY DM
FAGIN R
STOCKMEYER L
Citation: Dm. Choy et al., EFFICIENTLY EXTENDIBLE MAPPINGS FOR BALANCED DATA DISTRIBUTION, Algorithmica, 16(2), 1996, pp. 215-232
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
Authors:
DIBATTISTA G
TAMASSIA R
Citation: G. Dibattista et R. Tamassia, UNTITLED, Algorithmica, 16(1), 1996, pp. 1-3
Authors:
KANT G
Citation: G. Kant, DRAWING PLANAR GRAPHS USING THE CANONICAL ORDERING, Algorithmica, 16(1), 1996, pp. 4-32
Authors:
JUNGER M
MUTZEL P
Citation: M. Junger et P. Mutzel, MAXIMUM PLANAR SUBGRAPHS AND NICE EMBEDDINGS - PRACTICAL LAYOUT TOOLS, Algorithmica, 16(1), 1996, pp. 33-59
Authors:
EADES P
WHITESIDES S
Citation: P. Eades et S. Whitesides, THE REALIZATION PROBLEM FOR EUCLIDEAN MINIMUM SPANNING-TREES IS NP-HARD, Algorithmica, 16(1), 1996, pp. 60-82
Authors:
BOSE P
LENHART W
LIOTTA G
Citation: P. Bose et al., CHARACTERIZING PROXIMITY TREES, Algorithmica, 16(1), 1996, pp. 83-110