AAAAAA
Results:
1-10
|
Results: 10
Authors:
LINGAS A
SOLTAN V
Citation: A. Lingas et V. Soltan, MINIMUM CONVEX PARTITION OF A POLYGON WITH HOLES BY CUTS IN GIVEN DIRECTIONS, theory of computing systems, 31(5), 1998, pp. 507-538
Authors:
DESSMARK A
LINGAS A
Citation: A. Dessmark et A. Lingas, IMPROVED BOUNDS FOR INTEGER SORTING IN THE EREW PRAM MODEL, Journal of parallel and distributed computing, 48(1), 1998, pp. 64-70
Authors:
DESSMARK A
GARRIDO O
LINGAS A
Citation: A. Dessmark et al., A NOTE ON PARALLEL COMPLEXITY OF MAXIMUM F-MATCHING, Information processing letters, 65(2), 1998, pp. 107-109
Authors:
LINGAS A
Citation: A. Lingas, MAXIMUM TREE-PACKING IN TIME O(N(5 2)), Theoretical computer science, 181(2), 1997, pp. 307-316
Authors:
BERMAN P
LINGAS A
Citation: P. Berman et A. Lingas, A NEARLY OPTIMAL PARALLEL ALGORITHM FOR THE VORONOI DIAGRAM OF A CONVEX POLYGON, Theoretical computer science, 174(1-2), 1997, pp. 193-202
Authors:
LINGAS A
Citation: A. Lingas, SELECTED PAPERS OF THE 20TH INTERNATIONAL-COLLOQUIUM ON AUTOMATA, LANGUAGES AND PROGRAMMING (ICALP), LUND, SWEDEN, JULY 1993 - PREFACE, Theoretical computer science, 154(1), 1996, pp. 1-2
Authors:
GARRIDO O
JAROMINEK S
LINGAS A
RYTTER W
Citation: O. Garrido et al., A SIMPLE RANDOMIZED PARALLEL ALGORITHM FOR MAXIMAL F-MATCHINGS, Information processing letters, 57(2), 1996, pp. 83-87
Authors:
ASPVALL B
LEVCOPOULOS C
LINGAS A
STORLIND R
Citation: B. Aspvall et al., ON 2-QBF TRUTH TESTING IN PARALLEL, Information processing letters, 57(2), 1996, pp. 89-93
Authors:
DESSMARK A
LINGAS A
MAHESHWARI A
Citation: A. Dessmark et al., MULTILIST LAYERING - COMPLEXITY AND APPLICATIONS, Theoretical computer science, 141(1-2), 1995, pp. 337-350
Authors:
LINGAS A
MAHESHWARI A
SACK JR
Citation: A. Lingas et al., OPTIMAL PARALLEL ALGORITHMS FOR RECTILINEAR LINK-DISTANCE PROBLEMS, Algorithmica, 14(3), 1995, pp. 261-289
Risultati:
1-10
|