Connecting you to content on EBSCOhost

Works matching IS 14324350 AND DT 2002 AND VI 35 AND IP 6

Results: 5

1

Polynomial-Time Algorithms for Minimum-Time Broadcast in Trees.

Published in:

Theory of Computing Systems, 2002, v. 35, n. 6, p. 641, doi. 10.1007/s00224-002-1047-5

By:

Cohen, Johanne;
Fraigniaud, Pierre;
Mitjana, Margarida

Publication type:

Article

2

Competitive Call Control in Mobile Networks.

Published in:

Theory of Computing Systems, 2002, v. 35, n. 6, p. 625, doi. 10.1007/s00224-002-1032-z

By:

Pantziou, Grammati E.;
Pentaris, George P.;
Spirakis, Paul G.

Publication type:

Article

3

Scheduling Time-Constrained Communication in Linear Networks.

Published in:

Theory of Computing Systems, 2002, v. 35, n. 6, p. 599, doi. 10.1007/s00224-002-1001-6

By:

Adler, Micah;
Rosenberg, Arnold L.;
Sitaraman, Ramesh K.;
Unger, Walter

Publication type:

Article

4

Average-Case Analysis of Greedy Packet Scheduling.

Published in:

Theory of Computing Systems, 2002, v. 35, n. 6, p. 667, doi. 10.1007/s00224-002-1095-x

By:

Lotker, Zvi;
Patt-Shamir, Boaz

Publication type:

Article

5

Bulk Synchronous Parallel Algorithms for the External Memory Model.

Published in:

Theory of Computing Systems, 2002, v. 35, n. 6, p. 567, doi. 10.1007/s00224-002-1066-2

By:

Dehne, Frank;
Dittrich, Wolfgang;
Hutchinson, David;
Maheshwari, Anil

Publication type:

Article