Search

Your search keyword '"Pantziou, Grammati E."' showing total 38 results
Start Over Author "Pantziou, Grammati E."
38 results on '"Pantziou, Grammati E."'

2. Competitive call control in mobile networks

Author

Pantziou, Grammati E., Pentaris, George P., Spirakis, Paul G., Goos, Gerhard, editor, Hartmanis, Juris, editor, van Leeuwen, Jan, editor, Leong, Hon Wai, editor, Imai, Hiroshi, editor, and Jain, Sanjay, editor

Published
1997
Full Text
View/download PDF

14. Optimal parallel algorithms for sparse graphs

Author

Pantziou, Grammati E., Spirakis, Paul G., Zaroliagis, Christos D., Goos, G., editor, Hartmanis, J., editor, Barstow, D., editor, Brauer, W., editor, Brinch Hansen, P., editor, Gries, D., editor, Luckham, D., editor, Moler, C., editor, Pnueli, A., editor, Seegmüller, G., editor, Stoer, J., editor, Wirth, N., editor, and Möhring, Rolf H., editor

Published
1991
Full Text
View/download PDF

15. Efficient parallel algorithms for shortest paths in planar graphs

Author

Pantziou, Grammati E., Spirakis, Paul G., Zaroliagis, Christos D., Goos, G., editor, Hartmanis, J., editor, Barstow, D., editor, Brauer, W., editor, Brinch Hansen, P., editor, Gries, D., editor, Luckham, D., editor, Moler, C., editor, Pnueli, A., editor, Seegmüller, G., editor, Stoer, J., editor, Wirth, N., editor, Gilbert, John R., editor, and Karlsson, Rolf, editor

Published
1990
Full Text
View/download PDF

29. The Fourth Moment in Luby's Distribution

Author

Dubhashi, Devdatt P., Pantziou, Grammati E., Spirakis, Paul G., Zaroliagis, Christos D., Dubhashi, Devdatt P., Pantziou, Grammati E., Spirakis, Paul G., and Zaroliagis, Christos D.

Abstract

Luby[10] proposed a way to derandomize randomized computations which is based on the construction of a small probability space whose elements are 3-wise independent. In this paper we prove some new properties of Luby's space. More precisely, we analyzethe fourth moment and prove an interesting technical property which helps to understand better Luby's distribution. As an application, we study the behavior of random edge cuts in a weighted graph.Keywords: Fourth moment, full independence, k-wise independence, derandomization.

Published
1995

38. Competitive Call Control in Mobile Networks.

Author

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

Subjects
*TELECOMMUNICATION traffic, *MOBILE communication systems
Abstract

In this paper we deal with competitive local on-line algorithms for nonpreemptive channel allocation in mobile networks. The signal interferences in a network are modeled using an interference graph G. We prove that the greedy online algorithm is Δ-competitive, where Δ is the maximum degree of G. We employ the "classify and randomly select" paradigm [5], [17], and give a 5-competitive randomized algorithm for the case of planar interference graphs, a 2-competitive randomized algorithm for trees, and a (2c)-competitive randomized algorithm for graphs of arboricity c. We also show that the problem of call control in mobile networks with multiple available frequencies reduces to the problem of call control in mobile networks with a single frequency. Using this reduction, we present on-line algorithms for general networks with a single frequency. We give a local on-line algorithm which is (α(δ + 1 + α)/(½ + α)²)-competitive, where a is the independence number of G, and δ is the average degree of G. The above results hold in the case when the duration of each request is infinite, and the benefit the algorithm gains by accepting each request is equal to one. They are extended to handle requests of arbitrary durations, and arbitrary benefits. [ABSTRACT FROM AUTHOR]

Published
2002
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results