AAAAAA
Results:
1-20
|
Results: 20
Authors:
JANIK R
SCHIEBER B
Citation: R. Janik et B. Schieber, PHENOLOGY AND DYNAMICS OF THE ABOVEGROUND AND BELOW-GROUND BIOMASS PRODUCTION OF DENTARIA-BULBIFERA L, EKOLOGIA-BRATISLAVA, 17(2), 1998, pp. 125-133
Authors:
ARRIGO KR
ROBINSON DH
WORTHEN DL
SCHIEBER B
LIZOTTE MP
Citation: Kr. Arrigo et al., BIOOPTICAL PROPERTIES OF THE SOUTHWESTERN ROSS SEA, J GEO RES-O, 103(C10), 1998, pp. 21683-21695
Authors:
SCHIEBER B
Citation: B. Schieber, COMPUTING A MINIMUM WEIGHT K-LINK PATH IN GRAPHS WITH THE CONCAVE MONGE PROPERTY, Journal of algorithms (Print), 29(2), 1998, pp. 204-222
Authors:
EVEN G
NAOR J
SCHIEBER B
SUDAN M
Citation: G. Even et al., APPROXIMATING MINIMUM FEEDBACK SETS AND MULTICUTS IN DIRECTED-GRAPHS, Algorithmica, 20(2), 1998, pp. 151-174
Authors:
BARNES G
BUSS JF
RUZZO WL
SCHIEBER B
Citation: G. Barnes et al., A SUBLINEAR SPACE, POLYNOMIAL-TIME ALGORITHM FOR DIRECTED S-T CONNECTIVITY, SIAM journal on computing, 27(5), 1998, pp. 1273-1282
Authors:
BARNOY A
MAYER A
SCHIEBER B
SUDAN M
Citation: A. Barnoy et al., GUARANTEEING FAIR SERVICE TO PERSISTENT DEPENDENT TASKS, SIAM journal on computing, 27(4), 1998, pp. 1168-1189
Authors:
CAI LZ
SCHIEBER B
Citation: Lz. Cai et B. Schieber, A LINEAR-TIME ALGORITHM FOR COMPUTING THE INTERSECTION OF ALL ODD CYCLES IN A GRAPH, Discrete applied mathematics, 73(1), 1997, pp. 27-34
Authors:
BORODIN A
RABANI Y
SCHIEBER B
Citation: A. Borodin et al., DETERMINISTIC MANY-TO-MANY HOT POTATO ROUTING, IEEE transactions on parallel and distributed systems, 8(6), 1997, pp. 587-596
Authors:
BORODIN A
RAGHAVAN P
SCHIEBER B
UPFAL E
Citation: A. Borodin et al., HOW MUCH CAN HARDWARE HELP ROUTING, JOURNAL OF THE ACM, 44(5), 1997, pp. 726-741
Authors:
BLUM A
RAGHAVAN P
SCHIEBER B
Citation: A. Blum et al., NAVIGATING IN UNFAMILIAR GEOMETRIC TERRAIN, SIAM journal on computing, 26(1), 1997, pp. 110-137
Authors:
BSHOUTY NH
MANSOUR Y
SCHIEBER B
TIWARI P
Citation: Nh. Bshouty et al., A TIGHT BOUND FOR APPROXIMATING THE SQUARE-ROOT, Information processing letters, 63(4), 1997, pp. 211-213
Authors:
AGGARWAL A
BARNOY A
COPPERSMITH D
RAMASWAMI R
SCHIEBER B
SUDAN M
Citation: A. Aggarwal et al., EFFICIENT ROUTING IN OPTICAL NETWORKS, Journal of the ACM, 43(6), 1996, pp. 973-1001
Authors:
BARNOY A
KIPNIS S
SCHIEBER B
Citation: A. Barnoy et al., OPTIMAL COMPUTATION OF CENSUS FUNCTIONS IN THE POSTAL MODEL, Discrete applied mathematics, 58(3), 1995, pp. 213-222
Authors:
BARNOY A
BRUCK J
HO CT
KIPNIS S
SCHIEBER B
Citation: A. Barnoy et al., COMPUTING GLOBAL COMBINE OPERATIONS IN THE MULTIPORT POSTAL MODEL, IEEE transactions on parallel and distributed systems, 6(8), 1995, pp. 896-900
Authors:
AGGARWAL A
BARNOY A
KHULLER S
KRAVETS D
SCHIEBER B
Citation: A. Aggarwal et al., EFFICIENT MINIMUM-COST MATCHING AND TRANSPORTATION USING THE QUADRANGLE INEQUALITY, Journal of algorithms, 19(1), 1995, pp. 116-143
Authors:
BORODIN A
IRANI S
RAGHAVAN P
SCHIEBER B
Citation: A. Borodin et al., COMPETITIVE PAGING WITH LOCALITY OF REFERENCE, Journal of computer and system sciences, 50(2), 1995, pp. 244-258
Authors:
SCHIEBER B
SNIR M
Citation: B. Schieber et M. Snir, CALLING NAMES ON NAMELESS NETWORKS, Information and computation, 113(1), 1994, pp. 80-101
Authors:
AGGARWAL A
SCHIEBER B
TOKUYAMA T
Citation: A. Aggarwal et al., FINDING A MINIMUM-WEIGHT K-LINK PATH IN GRAPHS WITH THE CONCAVE MONGEPROPERTY AND APPLICATIONS, Discrete & computational geometry, 12(3), 1994, pp. 263-280
Authors:
FIAT A
RABANI Y
RAVID Y
SCHIEBER B
Citation: A. Fiat et al., A DETERMINISTIC O(K(3))-COMPETITIVE K-SERVER ALGORITHM FOR THE CIRCLE, Algorithmica, 11(6), 1994, pp. 572-578
Authors:
GUSFIELD D
LANDAU GM
SCHIEBER B
Citation: D. Gusfield et al., AN EFFICIENT ALGORITHM FOR THE ALL PAIRS SUFFIX PREFIX PROBLEM, Information processing letters, 41(4), 1992, pp. 181-185
Risultati:
1-20
|