ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Fundamental control algorithms in mobile networks
Full text PdfPdf (1.22 MB)
Source ACM Symposium on Parallel Algorithms and Architectures archive
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures table of contents
Saint Malo, France
Pages: 251 - 260  
Year of Publication: 1999
ISBN:1-58113-124-0
Authors
Kostas P. Hatzis  Computer Technology Institute Kolokotroni 3, 26221 Patras, Greece and Computer Engineering and Informatics Department, Patras University, 26500 Rion, Patras, Greece
George P. Pentaris  Computer Technology Institute Kolokotroni 3, 26221 Patras, Greece and Computer Engineering and Informatics Department, Patras University, 26500 Rion, Patras, Greece
Paul G. Spirakis  Computer Technology Institute Kolokotroni 3, 26221 Patras, Greece and Computer Engineering and Informatics Department, Patras University, 26500 Rion, Patras, Greece
Vasilis T. Tampakas  Computer Technology Institute Kolokotroni 3, 26221 Patras, Greece and Technological Educational Institute (TEI) of Patras, M Alexandrou 1, 26334, Koukouli, Patras, Greece
Richard B. Tan  Universiteit Utrecht, Department of Computer Science, Centrumgebouw Noord, Padualaan 14, De Uithof, 3584 C4 Utrecht, The Netherlands
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 56,   Citation Count: 13
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/305619.305649
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
"Structuring distributed algorithms for Mobile Hosts", A. Acharya, B. R. Badrinath, T. Imielinski, 14th International Conference on Distributed Computing systems, June 1994.
3
 
4
 
5
"Reversible Markov Chains and Random Walks on Graphs", D. Aldous, J. Fill, unpublished manuscript, http://stat-www.berkeley.edu/users/aldous/book.html
6
 
7
"Approximating the Size of a Dynamically Growing Asynchronous Distributed Network", B. Awerbuch, S. A. Plotkin, MIT.
 
8
"Echo algorithms: Depth parallel operations on general graphs", E. J-H. Chang, IEEE Transactions on Software Engineering, SE-8, 1982.
9
 
10
 
11
"Comparison Theorems for reversible Markov Chains", P. Diaconis, L. Saloff-Coste, The Annals of Applied Probability, Vol. 3, No. 3, 1993, pp. 696-730.
 
12
"Frequency Assignment in Mobile and Radio Networks", D. Fotakis, G. Pantziou, G. Pentaris and P. Spirakis, to appear in the special issue of the American Mathematical Society D IMACS series with the proceedings of the workshop on "Networks in Distributed Computing".
 
13
 
14
"Mobile Computing", T. Imielinski, H. F. Korth, Kluwer Academic Publishers, 1996.
15
 
16
"Distributed Systems towards a formal approach", G. Le Lann, IFIP Congress, 1977.
 
17
"Randomized algorithms", R. Motwani, P. Raghavan, Cambridge University Press, 1996.
 
18
19
 
20
21
22
 
23
 
24
DSP Web Site, http://helios.cti.gr/alcom-it/dsp

CITED BY  13

Collaborative Colleagues:
Kostas P. Hatzis: colleagues
George P. Pentaris: colleagues
Paul G. Spirakis: colleagues
Vasilis T. Tampakas: colleagues
Richard B. Tan: colleagues