AAAAAA

   
Results: 1-7 |
Results: 7
THE COMPLEXITY OF BROADCASTING IN PLANAR AND DECOMPOSABLE GRAPHS
Authors: JAKOBY A REISCHUK R SCHINDELHAUER C
Citation: A. Jakoby et al., THE COMPLEXITY OF BROADCASTING IN PLANAR AND DECOMPOSABLE GRAPHS, Discrete applied mathematics, 83(1-3), 1998, pp. 179-206
AN AVERAGE COMPLEXITY MEASURE THAT YIELDS TIGHT HIERARCHIES
Authors: REISCHUK R SCHINDELHAUER C
Citation: R. Reischuk et C. Schindelhauer, AN AVERAGE COMPLEXITY MEASURE THAT YIELDS TIGHT HIERARCHIES, Computational complexity, 6(2), 1997, pp. 133-173
REPORT DAGSTUHL SEMINAR ON TIME SERVICES - SCHLOSS-DAGSTUHL, MARCH 11MARCH 15 1996
Authors: DOLEY D REISCHUK R SCHNEIDER FB STRONG HR
Citation: D. Doley et al., REPORT DAGSTUHL SEMINAR ON TIME SERVICES - SCHLOSS-DAGSTUHL, MARCH 11MARCH 15 1996, Real time systems, 12(3), 1997, pp. 329-329
FEASIBLE TIME-OPTIMAL ALGORITHMS FOR BOOLEAN FUNCTIONS ON EXCLUSIVE-WRITE PARALLEL RANDOM-ACCESS MACHINES
Authors: DIETZFELBINGER M KUTYLOWSKI M REISCHUK R
Citation: M. Dietzfelbinger et al., FEASIBLE TIME-OPTIMAL ALGORITHMS FOR BOOLEAN FUNCTIONS ON EXCLUSIVE-WRITE PARALLEL RANDOM-ACCESS MACHINES, SIAM journal on computing, 25(6), 1996, pp. 1196-1230
THE SUBLOGARITHMIC ALTERNATING SPACE WORLD
Authors: LISKIEWICZ M REISCHUK R
Citation: M. Liskiewicz et R. Reischuk, THE SUBLOGARITHMIC ALTERNATING SPACE WORLD, SIAM journal on computing, 25(4), 1996, pp. 828-861
EXACT LOWER TIME-BOUNDS FOR COMPUTING BOOLEAN FUNCTIONS ON CREW PRAMS
Authors: DIETZFELBINGER M KUTYLOWSKI M REISCHUK R
Citation: M. Dietzfelbinger et al., EXACT LOWER TIME-BOUNDS FOR COMPUTING BOOLEAN FUNCTIONS ON CREW PRAMS, Journal of computer and system sciences, 48(2), 1994, pp. 231-254
DIFFERENT MODES OF COMMUNICATION
Authors: HALSTENBERG B REISCHUK R
Citation: B. Halstenberg et R. Reischuk, DIFFERENT MODES OF COMMUNICATION, SIAM journal on computing, 22(5), 1993, pp. 913-934
Risultati: 1-7 |