HOME cs.uu.nl home education contact library calendar search UU.NL
about us research people archive services jobs

publications by dr. G. Tel

Gerard  Tel

dr. G. Tel

some publications

Tel, G. (2010). Diepte zien: Stereofotografie. Vakidioot, 3-6.

Tel, G. (2009). Vvedenie b Raspredelennie Algoritmi (Introduction to Distributed Algorithms). St Petersburg: MTsNMO (www.biblio.mccme.ru).

Alt, H., Bodlaender, H.L., Kreveld, M.J. van, Rote, G. & Tel, G. (2009). Wooden Geometric Puzzles: Design and Hardness Proofs. Theory Comput. Syst., 44(2), 160-174.

Kwisthout, J.H.P. & Tel, G. (2008). Complexity Results for Enhanced Qualitative Probabilistic Networks. International Journal of Approximate Reasoning, 48, 879-888.

Kwisthout, J., Bodlaender, H.L. & Tel, G. (2008). Complexity results for local monotonicity in probabilistic networks. In M.M. Dastani & E. de Jong (Eds.), Proceedings of the 19th Belgisch-Nederlandse conferentie class = Wet, Artificiële Intelligentie BNAIC'07.

Chalopin, J., Godard, E., Métivier, Y. & Tel, G. (2007). About the termination detection in the asynchronous message passing model. In J. van Leeuwen (Ed.), SOFSEM2007: Theory and Practice of Computer Science Vol. 3831. Lecture Notes in Computer Science (pp. 200-211). Springer Verlag.

Kwisthout, J.H.P., Bodlaender, H.L. & Tel, G. (2007). Complexity Results for Local Monotonicity in Probabilistic Networks (extended abstract). In M.M. Dastani & E. de Jong (Eds.), Proceedings of the 19th BNAIC, October 17-19, 2007 (pp. 369-370).

Kwisthout, J.H.P., Bodlaender, H.L. & Tel, G. (2007). Complexity results for local monotonicity in probabilistic networks. CS-UU 2007-050. onbekend: UU WINFI Informatica en Informatiekunde.

Kwisthout, J.H.P., Bodlaender, H.L. & Tel, G. (2007). Local Monotonicity in Probabilistic Networks. In K. Mellouli & K. Mellouli (Eds.), Procedings of the Ninth European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, ECSQUARU 2007 (pp. 548-559). Springer-Verlag.

Alt, H., Bodlaender, H.L., Kreveld, M.J. van, Rote, G. & Tel, G. (2007). Wooden Geometric Puzzles: Design and Hardness Proofs. In P. Crescenzi, G. Prencipe & G. Pucci (Eds.), Proceedings 4th International Conference on Fun with Algorithms, FUN 2007 (pp. 16-29). Springer, Lecture Notes in Computer Science, volume 4475.

Alt, H., Bodlaender, H.L., Kreveld, M.J. van, Rote, G. & Tel, G. (2007). Wooden Geometric Puzzles: Design and Hardness Proofs. CS-UU 2007-009. onbekend: UU WINFI Informatica en Informatiekunde.

Kwisthout, J.H.P. & Tel, G. (2006). Complexity Results for Enhanced Qualitative Probabilistic Networks. UU-CS 2006-058. onbekend: UU WINFI Informatica en Informatiekunde.

Kwisthout, J.H.P. & Tel, G. (2006). Complexity Results for Enhanced Qualitative Probabilistic Networks. In M. Studeny & J. Vomlel (Eds.), Proceedings of the Third European Workshop on Probabilistic Graphical Models, Prague, Czech Republic, September 12-15, 2006 (pp. 171-178). Action M Agency.

Kwisthout, J.H.P., Bodlaender, H.L. & Tel, G. (2006). Complexity Results for Local Monotonicity in Probabilistic Networks. uu cs UU-CS-2007-050. onbekend: UU WINFI Informatica en Informatiekunde.

Tel, G. (2006). De Chocolade Code: Elgamal Workshop. Nieuwe Wiskrant, 26, 38-41.

Tel, G. (2006). De Chocolade Code: Elgamal Workshop. Vakidioot, '06-'07, 4-8.

Tel, G. (2006). Geheimschrift op de TI-83+. UU-CS 2006-017. onbekend: UU WINFI Informatica en Informatiekunde.

Wiedermann, J., Tel, G., Pokorny, J., Bieliková, M. & Štuller, J. (2006). SOFSEM 2006: Theory and Practice of Computer Science. In LNCS. Springer.

Godard, E., Métivier, Y. & Tel, G. (2006). Termination Detection of Distributed Tasks. Bordeaux: Laboratoire Bordelais de Recherche en Informatique.

Waard, A. de & Tel, G. (2006). The ABCDE Format: Enabling Semantic Conference Proceedings. In European Semantic Web Conference.

Tel, G. (2005). 31st SOFtware SEMinar. EATCS Bulletin, 86, 264-267.

Tel, G. (2004). 30th SOFtware SEMinar (SofSem). EATCS Bulletin, 83, 213-218.

Bodlaender, H.L. & Tel, G. (2004). A note on rectilinearity and angular resolution. Journal on Graph Algorithms and Applications, 8, 89-94.

Bodlaender, H.L. & Tel, G. (2003). Rectilinear Graphs and Angular Resolution. UU-CS 2003-033. Utrecht: Utrecht University: Information and Computing Sciences.

Tel, G. (2002). Cryptografie: Bescherming van de Digitale Maatschappij. Amsterdam, the Netherlands: Addison-Wesley.

Tel, G. (2000). Introduction to Distributed Algorithms (2nd edition). Cambridge, U.K.: Cambridge University Press.

Métivier, Y. & Tel, G. (2000). Termination detection and universal graph reconstruction. In M. Flammini, E. Nardelli, G. Proietti & P. Spirakis (Eds.), The 7th International Colloquium on Structural Information and Communication Complexity (pp. 237-251). Ottawa: Carleton Scientific.

Tel, G. (1999). Cryptografie met getallen. Vakidioot, 30(4), 16-20.

Tel, G. (1999). Distributed Control Algorithms for AI. In G. Weiss (Ed.), MultiAgent Systems: A Modern Approach to Distibuted Artificial Intelligence (pp. 539-580). Cambridge, MA: MIT Press.

Pavelka, J., Tel, G. & Bartosek, M. (Eds.). (1999). Sofsem99: 26th Conference on Current Trends in Theory and Practice of Informatics (LNCS, 1725). Heidelberg: Springer-Verlag.

Tel, G. (1998). Cryptografie: van DES tot Chipknip. UU-CS 1998-43. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.

Tel, G. (1998). Distributed control for AI. UU-CS 1998-17. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.

Tel, G. (1998). Time and bit optimal broadcasting on anonymous unoriented hypercubes. UU-CS 1998-42. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.

Dobrev, S., Ruzicka, P. & Tel, G. (1998). Time and bit optimal broadcasting on anonymous unoriented hypercubes. In L. Gargano & D. Peleg (Eds.), Proceedings 5th Colloquium on Structural Information and Communication (Sirocco'98). Carleton Scientific Press.

Charron-Bost, B. & Tel, G. (1997). Calculs approches de la borne inferieure de valeurs reparties. Informatique théorique et applications, 31, 305-330.

Charron-Bost, B., Mattern, F. & Tel, G. (1996). Synchronous, asynchronous, and causally ordered communication. Distributed Computing, 9, 173-191.

Herman, J. & Tel, G. (1993). Advanced Distributed Algorithms. RUU-CS 93-37. Utrecht.

Tel, G. (1993). Linear election for oriented hypercubes. RUU-CS 93-39. Utrecht.

Mattern, F., Schoone, A.A. & Tel, G. (1991). Global virtual time approximation with distributed termination detection algorithms. RUU-CS 91-32. Utrecht.

Tel, G. (1991). Network Orientation. RUU-CS 91-08. Utrecht.

Tel, G. (1990). The derivation of distributed termination detection algorithms from garbage collection schemes. RUU-CS 90-24. Utrecht.

Bodlaender, H.L. & Tel, G. (1989). Bit-optimal election in synchronous rings. RUU-CS 89-02. Utrecht.

Leeuwen, J. van, Wijshoff, H.A.G. & Tel, G. (1989). The one-dimensional skewing problem. RUU-CS 89-23. Utrecht.

Bodlaender, H.L. & Tel, G. (1989). Trade-offs in non-reversing diameter. RUU-CS 89-22. Utrecht.

Schoone, A.A. & Tel, G. (1988). Assertional verification of a termination detection algorithm. RUU-CS 88-06. Utrecht.

Tel, G. (1988). Optimal Synchronization of ABD Networks. RUU-CS 88-23. Utrecht.

Tel, G. (1988). Total algorithms. RUU-CS 88-16. Utrecht.

Schoone, A.A. & Tel, G. (1988). Transformation of a termination detection algorithm and its assertional correctness proof. RUU-CS 88-40. Utrecht.

Tel, G. (1987). Assertional verification of a timer-based protocol. RUU-CS 87-15. Utrecht.

Tel, G. (1987). Directed network protocols (revised edition). RUU-CS 87-06. Utrecht.

Tel, G. (1986). Distributed infimum approximation. RUU-CS 86-12. Utrecht.

Tel, G., Tan, R.B. & Leeuwen, J. van (1986). The derivation of graph marking algorithms from distributed termination detection protocols. RUU-CS 86-11. Utrecht.

Tel, G., Leeuwen, J. van & Wijshoff, H.A.G. (1986). The one-dimensional skewing problem. RUU-CS 86-08. Utrecht.

Tel, G. & Wijshoff, H.A.G. (1985). Hierarchical memory systems in multiprocessors and multi-periodic skewing schemes. RUU-CS 85-24. Utrecht.


valid-html401 webmaster@cs.uu.nl, Sun, 20 May 2012 10:56:23 +0200 ← Departement Informatica, Universiteit Utrecht