G. Tel, Introduction to Distributed Algorithm. Cambridge, U.K.: Cambridge Univ. Press, 2000. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
DCTC: Dynamic Convoy Tree-Based Collaboration for Target.. - Zhang, Cao (2004) (Correct)
....When a target first enters the detection region of a sensor network, the sensor nodes that are awake and close to the target can detect it. Then, these sensor nodes need to construct an initial convoy tree by first selecting 9 a node to be the root of the tree. Many leader election algorithms [18] can be used to select the root. Since this is not the major concern of this paper, we only present the basic idea of a simple solution, which selects the node closest to the target as the root. If two or more nodes have the same distance to the target, node id (can be the MAC address) is used to ....
G. Tel, "Introduction to distributed algorithm," Cambridge University Press, 2000.
Bit Complexity of Breaking and Achieving Symmetry in.. - Dinitz, Moran, Rajsbaum (Correct)
....the information on the network known to the processors. In more general networks, we may also assume that the processors do not know the structure of the entire network, or even the number of processors in the network. These are the usual assumptions in the distributed computing literature (e.g. [1, 15, 18]) Moreover, in this literature, it is common that the problem which has to be solved is not necessarily a function of the processors inputs, but is speci ed by a task, i.e. an input output relation (several outputs are allowed for the same input, see [17] Also, the output is not required to be ....
....distinct ids, and that processors are identical in the sense that their programs depend only on their id s, and their number of incident links. There are n processors, and the ids are taken from the set ZM = f1; Mg, for n M . This is a standard model used in distributed computing (e.g. [1, 15, 18]) and is not described in detail in this extended abstract. We consider two interconnection topologies: rings and chains. A scheduler speci es the order in which processors take steps, and messages are delivered. In particular, a scheduler de nes which processors wake up spontaneously. An ....
Gerard Tel, Introduction to Distributed Algorithms, Cambridge University Press, 1994.
Self-Stabilizing and Snap-Stabilizing Wave Algorithms (Extended.. - Petit (Correct)
....information, distributed in mum computation, election of a leader, synchronization of processes, mutual exclusion, spanning tree construction, etc. The reader may refer to a large number of books about the principles of distributed systems and their use in computer networks, e.g. Gou98, RH90, Tel94, Tan96, TvS02] Wave algorithms (sometimes referred to as total algorithms [Tel88] are widely used as the basis to solve many network control problems. A wave algorithm is a distributed algorithm where the participation of all processes in the network is required before a particular event, ....
G Tel. Introduction to distributed algorithms. Cambridge University Press, 1994.
Broadcasting in Unlabeled Tori - Diks, Kranakis, Pelc (1998) (2 citations) (Correct)
....Andrzej Pelc uqah.uquebec.ca Research supported in part by NSERC (Natural Sciences and Engineering Research Council of Canada) grant. 1 Introduction The study of the computational power of anonymous networks is an important and well established research area in distributed computing (cf. [12] and the survey [7] In an anonymous network processors do not have distinct identities and execute identical algorithms. The impossibility of distinguishing processors yields symmetry in computations and restricts the power of the network both in terms of the class of functions that can be ....
G. Tel, Introduction to Distributed Algorithms, Cambridge University Press, 1996.
Perfect Broadcasting in Unlabeled Networks - Diks, Kranakis, Pelc (1999) (1 citation) (Correct)
....Andrzej Pelc uqah.uquebec.ca Research supported in part by NSERC (Natural Sciences and Engineering Research Council of Canada) grant. 1 Introduction The study of the computational power of anonymous networks is an important and well established research area in distributed computing (cf. [13] and the survey [8] In an anonymous network, processors do not have distinct identities and execute identical algorithms. The impossibility of distinguishing processors yields symmetry in computations and restricts the power of the network both in terms of the class of functions that can be ....
G. Tel, Introduction to Distributed Algorithms, Cambridge University Press, 1996.
Coverage Control for Mobile Sensing Networks - Cortes, Martínez.. (2002) (12 citations) (Correct)
....with respect to an aggregate objective. The study of distributed algorithms is concerned with providing mathematical models, devising precise specifications for their behavior, and formally proving their correctness and complexity. Via an automata theoretic approach, the references [38] [39] treat distributed consensus, resource allocation, communication, and data consistency problems. From a numerical optimization viewpoint, the works in [40] 41] 42] discuss distributed asynchronous algorithms as networking algorithms, rate and flow control, and gradient descent flows. ....
G. Tel, Introduction to Distributed Algorithms, Cambridge University Press, New York, NY, second edition, 2001.
Broadcasting in Unlabeled Hypercubes with Linear.. - Diks, Dobrev.. (1998) (5 citations) (Correct)
....which uses only O(n) messages. This answers affirmatively an open question of G. Tel [17] Keywords: Broadcasting, Unlabeled Hypercube. 1 Introduction The study of the computational power of anonymous networks is an important and well established research area in distributed computing (cf. [16] and the survey [9] In an anonymous network, processors do not have distinct identities and execute identical algorithms. The impossibility of distinguishing processors yields symmetry in computations and restricts the power of the network both in terms of the class of functions that can be ....
....asked if there exists a broadcasting algorithm in the totally unlabeled n node hypercube, using O(n) messages in the worst case. We answer this question in the affirmative and show such a broadcasting algorithm. The following communication task, related to broadcasting, is called traversal (cf. [16]) A token starting at one node of a network has to visit all other nodes, moving along links. To every move of the token a control message can be attached. The difference between broadcasting and traversal is that in the latter the token cannot be multiplied on its way. In other words, nodes ....
G. Tel, Introduction to Distributed Algorithms, Cambridge University Press, 1994.
DCTC: Dynamic Convoy Tree-Based Collaboration for Target.. - Zhang, Cao (2004) (Correct)
No context found.
G. Tel, Introduction to Distributed Algorithm. Cambridge, U.K.: Cambridge Univ. Press, 2000.
A Distributed Tabling Algorithm for Rule Based Policy.. - Alves, Damasio, Nejdl.. (2006) (Correct)
No context found.
G. Tel, Introduction to Distributed Algorithms. Cambridge Univ. Press, 2000, 2nd Edition.
Self-stabilizing Load Distribution for Replicated Servers on.. - Gärtner, Pagnia (Correct)
No context found.
G. Tel. Introduction to Distributed Algorithms. Cambridge University Press, 1994.
Reducing Fair Exchange to Atomic Commit - Avoine, Gärtner, Guerraoui.. (2004) (Correct)
No context found.
G. Tel. Introduction to Distributed Algorithms. Cambridge University Press, 1994.
An Exercise in Proving Convergence through Transfer Functions - Theel, Gärtner (1999) (3 citations) (Correct)
No context found.
Gerard Tel, Introduction to Distributed Algorithms, Cambridge University Press, 1994.
The essence of P2P: A reference architecture for overlay.. - Karl Aberer Luc (2005) (Correct)
No context found.
G. Tel. Introduction to Distributed Algorithms. Cambridge University Press, 1994.
Reducing Fair Exchange to Atomic Commit - Avoine, Gärtner, Guerraoui.. (2004) (Correct)
No context found.
G. Tel. Introduction to Distributed Algorithms. Cambridge University Press, 1994.
Acyclic Orientations for Deadlock Prevention in Usual.. - Bermond, Di Ianni.. (1996) (Correct)
No context found.
Gerard Tel. Introduction to Distributed Algorithms. Cambridge University Press, Cambridge, U.K., 1994.
Failure Detection Sequencers: Necessary and Sufficient.. - Gärtner, Pleisch (2002) (Correct)
No context found.
Gerard Tel. Introduction to Distributed Algorithms. Cambridge University Press, second edition, 2000.
Distributed Deadlock Detection in Mobile Agent Systems - Ashfield, Deugo, Oppacher.. (2000) (Correct)
No context found.
Tel, G.: Introduction to Distributed Algorithms, Cambridge University Press (1994)
Efficient Decentralized Monitoring of Safety in.. - Sen, Vardhan, Agha, Rosu (2004) (1 citation) (Correct)
No context found.
G. Tel. Introduction to Distributed Algorithms. Cambridge University Press, 2nd edition, September 2000.
Understanding and Modeling Agent Autonomy in Dynamic.. - Tosic, Agha (2003) (Correct)
No context found.
G. Tel, \Introduction To Distributed Algorithms", 2nd ed., Cambridge Univ. Press, 2000
Simplifying Itai-Rodeh Leader Election for Anonymous Rings - Fokkink, Pang (2004) (Correct)
No context found.
G. Tel. Introduction to Distributed Algorithms. Cambridge University Press, 1994.
Maximal Clique Based Distributed Group Formation for Autonomous .. - Tosic, Agha (2004) (1 citation) (Correct)
No context found.
G. Tel, "Introduction To Distributed Algorithms", 2nd ed., Cambridge Univ. Press, 2000
A Framework for Structured Peer-to-Peer Overlay Networks - Alima, Ghodsi, Haridi (2004) (3 citations) (Correct)
No context found.
G. Tel, Introduction to distributed algorithms, Cambridge University Press, 1994, ISBN 0 521 47069 2.
Modeling A System Of UAVs On A Mission - Tosic, Jang, Reddy, Chia, Chen.. (2003) (Correct)
No context found.
Gerald Tel, "Introduction To Distributed Algorithms", 2nd ed., Cambridge Univ. Press, 2000
Efficient Decentralized Monitoring of Safety in.. - Sen, Vardhan, Agha, Rosu (2004) (1 citation) (Correct)
No context found.
G. Tel. Introduction to Distributed Algorithms. Cambridge University Press, 2nd edition, September 2000.
The Use of Interpreted Languages for Implementing.. - Ururahy.. (1996) (Correct)
No context found.
Gerard Tel. Introduction to Distributed Algorithms. Cambridge University Press, 1994.
Simplifying Itai-Rodeh Leader Election for Anonymous Rings - Fokkink, Pang (2004) (Correct)
No context found.
G. Tel. Introduction to Distributed Algorithms.Cambridge University Press, 1994.
jfipa - an Architecture for Agent-based Grid Computing - Amund Tveit Department (2002) (Correct)
No context found.
Gerard Tel. Introduction to Distributed Algorithms, chapter 4, pages 103--154. Cambridge University Press, 2 edition, 2000.
A Distributed TDMA Slot Assignment Algorithm for Wireless.. - Herman, Tixeuil (2003) (3 citations) (Correct)
No context found.
G. Tel. Introduction to Distributed Algorithms, Cambridge University Press, 1994. 27
Unknown - Institut De Recherche (Correct)
No context found.
Tel G., Introduction to Distributed Algorithms. Cambridge University Press, (2d edition), 596 pages, 2000.
Modular Event-Based Systems - Fiege, Mühl, Gärtner (Correct)
No context found.
G. Tel. Introduction to Distributed Algorithms. Cambridge University Press, 1994.
Synchronizers for Local Computations - Metivier, Mosbah, al. (2004) (Correct)
No context found.
G. Tel. Introduction to distributed algorithms. Cambridge University Press, 2000.
A Self-Stabilizing Distributed Algorithm for.. - Goddard.. (2003) (Correct)
No context found.
G. Tel. Introduction to Distributed Algorithms. Cambridge University Press, 1994.
An Anonymous Self-Stabilizing Algorithm for 1-Maximal.. - Shi, Goddard, Hedetniemi (2004) (Correct)
No context found.
G. Tel, Introduction to Distributed Algorithms, second ed., Cambridge Univ. Press, Cambridge, UK, 2000.
Self-stabilization with r-operators in Unreliable.. - Delaet, Ducourthial.. (Correct)
No context found.
G Tel. Introduction to Distributed Algorithms. Cambridge university press, 1994.
A Uniform Probabilistic Election Algorithm in k-Trees - Hibaoui, al. (2004) (Correct)
No context found.
G. Tel. Introduction to distributed algorithms. Cambridge University Press, 2000.
Broadcasting in Unlabeled Networks - Diks, Kranakis, Pelc (1996) (3 citations) (Correct)
No context found.
G. Tel, Introduction to Distributed Algorithms, Cambridge University Press, 1996.
A Note on K-state Self-Stabilization in a Ring with K=N - Fokkink, Hoepman, Pang (2004) (Correct)
No context found.
G. Tel. Introduction to Distributed Algorithms. Cambridge University Press, 1994.
A Distributed Algorithm To Find Hamiltonian Cycles In.. - Levy, Louchard, Petit (2000) (Correct)
No context found.
G. Tel. Introduction to Distributed Algorithms. Cambridge University Press, second edition, 2000.
Laboratoire de l'Informatique du Parall - Lisme Cole Normale (2003) (Correct)
No context found.
G. Tel. Introduction to distributed algorithms. Cambridge University Press, 1994.
Failure Detection Sequencers: Necessary and Sufficient.. - Gärtner, Pleisch (Correct)
No context found.
Gerard Tel. Introduction to Distributed Algorithms. Cambridge University Press, second edition, 2000.
Control Synthesis for a Smart Card Personalization.. - Gebremichael, Vaandrager (2003) (Correct)
No context found.
G. Tel. Introduction to Distributed Algorithms. Cambridge University Press, 1994.
Turntaking: A Case for Agent-Based Programming - Hulstijn, Vreeswijk (2003) (Correct)
No context found.
Gerard Tel. Introduction to Distributed Algorithms. Cambridge University Press, Cambridge U.K., 2000.
Control Synthesis for a Smart Card Personalization.. - Gebremichael, Vaandrager (2003) (Correct)
No context found.
G. Tel. Introduction to Distributed Algorithms. Cambridge University Press. 1994.
An Exercise in Proving Convergence through Transfer Functions - Theel, Gärtner (1999) (3 citations) (Correct)
No context found.
Gerard Tel, Introduction to Distributed Algorithms, Cambridge University Press, 1994.
Detecting Locally Stable Predicates without Modifying.. - Atreya, Mittal, Garg (2003) (Correct)
No context found.
Tel, G.: Introduction to Distributed Algorithms. Second edn. Cambridge University Press (US Server) (2000)
Reducing Fair Exchange to Atomic Commit - Avoine, Gärtner, Guerraoui.. (2004) (Correct)
No context found.
G. Tel. Introduction to Distributed Algorithms. Cambridge University Press, 1994.
Some Problems in Distributed Computational Geometry.. - Rajsbaum, Urrutia (2004) (2 citations) (Correct)
No context found.
Gerard Tel, Introduction to Distributed Algorithms, Cambridge University
Easy Stabilization with an Agent - Beauquier, Herault, Schiller (Correct)
No context found.
G.Tel. Introduction to distributed algorithms. Cambridge University Press, 1994.
Snap-Stabilizing PIF Algorithm in Arbitrary Networks - Cournier, Datta, Petit.. (2002) (Correct)
No context found.
G Tel. Introduction to distributed algorithms. Cambridge University Press, 1994.
the Garbage Collection Bibliography - Richard Jones (2003) (Correct)
No context found.
Gerard Tel. Introduction to Distributed Algorithms. Cambridge University Press, 1994.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC