FORMAL CORRECTNESS PROOFS OF A NONDETERMINISTIC PROGRAMUPFAL E.1982; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1982; VOL. 14; NO 2; PP. 86-92; BIBL. 7 REF.Article

Tolerating a linear number of faults in networks of bounded degreeUPFAL, E.Information and computation (Print). 1994, Vol 115, Num 2, pp 312-320, issn 0890-5401Article

ONE-FACTOR IN RANDOM GRAPHS BASED ON VERTEX CHOICESHAMIR E; UPFAL E.1982; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1982; VOL. 41; NO 3; PP. 281-286; BIBL. 8 REF.Article

An O(log N) deterministic packet-routing schemeUPFAL, E.Journal of the Association for Computing Machinery. 1992, Vol 39, Num 1, pp 55-70, issn 0004-5411Article

ON FACTORS IN RANDOM GRAPHSSHAMIR E; UPFAL E.1981; ISR. J. MATH.; ISSN 0021-2172; ISR; DA. 1981; VOL. 39; NO 4; PP. 296-302; BIBL. 8 REF.Article

How to share memory in a distributed systemUPFAL, E; WIGDERSON, A.Journal of the Association for Computing Machinery. 1987, Vol 34, Num 1, pp 116-127, issn 0004-5411Article

A trade-off between space and efficiency for routing tablesPELEG, D; UPFAL, E.Journal of the Association for Computing Machinery. 1989, Vol 36, Num 3, pp 510-530, issn 0004-5411Article

Real-time communication scheduling in a multicomputer video serverNARASIMHA REDDY, A. L; UPFAL, E.Journal of parallel and distributed computing (Print). 1999, Vol 58, Num 3, pp 425-445, issn 0743-7315Article

Computing with noisy informationPEIGE, U; PRABHAKAR RAGHAVAN; PELEG, D et al.SIAM journal on computing (Print). 1994, Vol 23, Num 5, pp 1001-1018, issn 0097-5397Article

Existence and construction of edge-disjoint paths on expander graphsBRODER, A. Z; FRIEZE, A. M; UPFAL, E et al.SIAM journal on computing (Print). 1994, Vol 23, Num 5, pp 976-989, issn 0097-5397Article

Randomized routing with shorter pathsUPFAL, E; FELPERIN, S; SNIR, M et al.IEEE transactions on parallel and distributed systems. 1996, Vol 7, Num 4, pp 356-362, issn 1045-9219Article

Random hypergraph coloring algorithms and the weak chromatic numberSCHMIDT-PRUZAN, J; SHAMIR, E; UPFAL, E et al.Journal of graph theory. 1985, Vol 9, Num 3, pp 347-362, issn 0364-9024Article

A theory of wormhole routing in parallel computersFELPERIN, S; RAGHAVAN, P; UPFAL, E et al.IEEE transactions on computers. 1996, Vol 45, Num 6, pp 704-713, issn 0018-9340Article

Constructing a perfect matching is in Random NCKARP, R. M; UPFAL, E; WIGDERSON, A et al.Combinatorica (Print). 1986, Vol 6, Num 1, pp 35-48, issn 0209-9683Article

Optimal construction of edge-disjoint paths in random graphsBRODER, A. Z; FRIEZE, A. M; SUEN, S et al.SIAM journal on computing (Print). 1999, Vol 28, Num 2, pp 541-573, issn 0097-5397Article

Trading space for time in undirected s-t connectivityBRODER, A. Z; KARLIN, A. R; PRABHAKAR RAGHAVAN et al.SIAM journal on computing (Print). 1994, Vol 23, Num 2, pp 324-334, issn 0097-5397Article

A time-space tradeoff for element distinctnessBORODIN, A; FICH, F; MEYER AUF DER HEIDE, F et al.SIAM journal on computing (Print). 1987, Vol 16, Num 1, pp 97-99, issn 0097-5397Article

Design and analysis of dynamic processes : A stochastic approachUPFAL, E.Lecture notes in computer science. 1998, pp 26-34, issn 0302-9743, isbn 3-540-64848-8Conference Paper

Dynamic packet routing on arrays with bounded buffersBRODER, A. Z; FRIEZE, A. M; UPFAL, E et al.Lecture notes in computer science. 1998, pp 273-281, issn 0302-9743, isbn 3-540-64275-7Conference Paper

On balls and bins with deletionsCOLE, R; FRIEZE, A; MAGGS, B. M et al.Lecture notes in computer science. 1998, pp 145-158, issn 0302-9743, isbn 3-540-65142-XConference Paper

Updates to the QBIC systemNIBLACK, W; XIAOMING ZHU; DOM, B et al.SPIE proceedings series. 1997, Vol 3312, pp 150-161, isbn 0-8194-2752-7Conference Paper