AAAAAA
Results: 101-125/389
Authors:
RUS D
Citation: D. Rus, COORDINATED MANIPULATION OF OBJECTS IN A PLANE, Algorithmica, 19(1-2), 1997, pp. 129-147
Authors:
DANIELS K
MILENKOVIC VJ
Citation: K. Daniels et Vj. Milenkovic, MULTIPLE TRANSLATIONAL CONTAINMENT .1. AN APPROXIMATE ALGORITHM, Algorithmica, 19(1-2), 1997, pp. 148-182
Authors:
MILENKOVIC V
Citation: V. Milenkovic, MULTIPLE TRANSLATIONAL CONTAINMENT .2. EXACT ALGORITHMS, Algorithmica, 19(1-2), 1997, pp. 183-218
Authors:
EMIRIS IZ
CANNY JF
SEIDEL R
Citation: Iz. Emiris et al., EFFICIENT PERTURBATIONS FOR HANDLING GEOMETRIC DEGENERACIES, Algorithmica, 19(1-2), 1997, pp. 219-242
Authors:
BAJAJ CL
BERNARDINI F
XU G
Citation: Cl. Bajaj et al., RECONSTRUCTING SURFACES AND FUNCTIONS ON SURFACES FROM UNORGANIZED 3-DIMENSIONAL DATA, Algorithmica, 19(1-2), 1997, pp. 243-261
Authors:
BURLEY WR
IRANI S
Citation: Wr. Burley et S. Irani, ON ALGORITHM DESIGN FOR METRICAL TASK SYSTEMS, Algorithmica, 18(4), 1997, pp. 461-485
Authors:
DOLEV S
WELCH JL
Citation: S. Dolev et Jl. Welch, WAIT-FREE CLOCK SYNCHRONIZATION, Algorithmica, 18(4), 1997, pp. 486-511
Authors:
MUTHUKRISHNAN S
Citation: S. Muthukrishnan, DETECTING FALSE MATCHES IN STRING-MATCHING ALGORITHMS, Algorithmica, 18(4), 1997, pp. 512-520
Authors:
BEALS R
Citation: R. Beals, EQUIVALENCE OF BINARY AND TERNARY ALGEBRAIC DECISION TREES, Algorithmica, 18(4), 1997, pp. 521-523
Authors:
BESPAMYATNIKH SN
Citation: Sn. Bespamyatnikh, ON CONSTRUCTING MINIMUM SPANNING-TREES IN R-1(K), Algorithmica, 18(4), 1997, pp. 524-529
Authors:
MATSUI T
Citation: T. Matsui, A FLEXIBLE ALGORITHM FOR GENERATING ALL THE SPANNING-TREES IN UNDIRECTED GRAPHS, Algorithmica, 18(4), 1997, pp. 530-543
Authors:
IMIELINSKA C
KALANTARI B
Citation: C. Imielinska et B. Kalantari, A GENERAL-CLASS OF HEURISTICS FOR MINIMUM WEIGHT PERFECT MATCHING ANDFAST SPECIAL CASES WITH DOUBLY AND TRIPLY LOGARITHMIC ERRORS, Algorithmica, 18(4), 1997, pp. 544-559
Authors:
PAN P
DONG SK
LIU CL
Citation: P. Pan et al., OPTIMAL GRAPH CONSTRAINT REDUCTION FOR SYMBOLIC LAYOUT COMPACTION, Algorithmica, 18(4), 1997, pp. 560-574
Authors:
LENGAUER T
Citation: T. Lengauer, FOREWORD, Algorithmica, 18(3), 1997, pp. 281-282
Authors:
ALBERS S
Citation: S. Albers, ON THE INFLUENCE OF LOOKAHEAD IN COMPETITIVE PAGING-ALGORITHMS, Algorithmica, 18(3), 1997, pp. 283-305
Authors:
DEBERG M
VANKREVELD M
Citation: M. Deberg et M. Vankreveld, TREKKING IN THE ALPS WITHOUT FREEZING OR GETTING TIRED, Algorithmica, 18(3), 1997, pp. 306-323
Authors:
COHEN RF
TAMASSIA R
Citation: Rf. Cohen et R. Tamassia, COMBINE AND CONQUER, Algorithmica, 18(3), 1997, pp. 324-362
Authors:
WEIHE K
Citation: K. Weihe, MULTICOMMODITY FLOWS IN EVEN, PLANAR NETWORKS, Algorithmica, 18(3), 1997, pp. 363-383
Authors:
RAMACHANDRAN V
YANG HH
Citation: V. Ramachandran et Hh. Yang, AN EFFICIENT PARALLEL ALGORITHM FOR THE LAYERED PLANAR MONOTONE CIRCUIT VALUE-PROBLEM, Algorithmica, 18(3), 1997, pp. 384-404
Authors:
GERSTEL O
ZAKS S
Citation: O. Gerstel et S. Zaks, THE BIT COMPLEXITY OF DISTRIBUTED SORTING, Algorithmica, 18(3), 1997, pp. 405-416
Authors:
KAUFMANN M
RAMAN R
SIBEYN JF
Citation: M. Kaufmann et al., ROUTING ON MESHES WITH BUSES, Algorithmica, 18(3), 1997, pp. 417-444
Authors:
MAYR EW
WERCHNER R
Citation: Ew. Mayr et R. Werchner, OPTIMAL TREE CONTRACTION AND TERM MATCHING ON THE HYPERCUBE AND RELATED NETWORKS, Algorithmica, 18(3), 1997, pp. 445-460
Authors:
CHEN YB
IERARDI D
Citation: Yb. Chen et D. Ierardi, TIME-OPTIMAL TRAJECTORIES OF A ROD IN THE PLANE SUBJECT TO VELOCITY CONSTRAINTS, Algorithmica, 18(2), 1997, pp. 165-197
Authors:
TSAI KH
LEE DT
Citation: Kh. Tsai et Dt. Lee, K-BEST CUTS FOR CIRCULAR-ARC GRAPHS, Algorithmica, 18(2), 1997, pp. 198-216
Authors:
CHEW LP
FORTUNE S
Citation: Lp. Chew et S. Fortune, SORTING HELPS FOR VORONOI DIAGRAMS, Algorithmica, 18(2), 1997, pp. 217-228