Search

Your search keyword '"Taubenfeld, Gadi"' showing total 375 results
Start Over Author "Taubenfeld, Gadi"
375 results on '"Taubenfeld, Gadi"'

151. The Wakeup Problem

Author

Fischer, Michael J., primary, Moran, Shlomo, additional, Rudich, Steven, additional, and Taubenfeld, Gadi, additional

Published
1996
Full Text
View/download PDF

164. Fairness of shared objects.

Author

Goos, Gerhard, Hartmanis, Juris, Leeuwen, Jan, Kutten, Shay, Merritt, Michael, and Taubenfeld, Gadi

Abstract

Fairness in concurrent systems can be viewed as an abstraction that bridges low-level timing guarantees and make them available to programmers with a minimal loss of power and a maximal ease of use. We investigate the implementation and power of a range of fairness models that are appropriate to the synchronous, semi-synchronous and asynchronous contexts of various concurrent systems. [ABSTRACT FROM AUTHOR]

Published
1998
Full Text
View/download PDF

168. Constructing a reliable test & set bit.

Author

Stomp, Frank and Taubenfeld, Gadi

Subjects
*COMPUTER multitasking, *FAULT-tolerant computing
Abstract

Describes the construction of reliable test & set bits which can tolerate omission faults in concurrent computing. Modeling of faults by allowing operations on the faulty bits to return a special distinguished value, signaling that the operation may not have taken place; Optimal nongracefully degrading construction; Optimal gracefully degrading construction; Use of atomic bits; Lower bounds for processes.

Published
1999
Full Text
View/download PDF

169. On the performance of distributed lock-based synchronization?

Author

Lubowich, Yuval and Taubenfeld, Gadi

Abstract

Distributed mutual exclusion locks are the de facto mechanism for concurrency control on distributed data structures. A process accesses the data structure only while holding the lock, and hence the process is guaranteed exclusive access. The popularity of this approach is largely due to the apparently simple programming model of such locks and the availability of efficient implementations. We study the relation between classical types of distributed locking mechanisms and several distributed data structures which use locking for synchronization. Our objectives are:

  1. To determine which one of the two classical locking techniques -- token-based locking or permission-based locking -- is more efficient. Our strategy to achieve this objective is to implement several locks and to compare their performance.
  2. To propose, implement and test several distributed data structures, namely, two different types of counters, a queue, a stack and a linked list; and for each one of the data structures to determine what is the preferred mutual exclusion lock to be used as the underling locking mechanism.
  3. To determine which one of the two proposed counters is better to be used either as a stand-alone data structure or when used as a building block for implementing other high level data structures.
Our testing environment is consisting of 20 Intel XEON 2.4 GHz machines running theWindows XP OS with 2GB of RAM and using a JRE version 1.4.2_08. All the machines were located inside the same LAN and were connected using a 20 port Cisco switch.

Published
2011
Full Text
View/download PDF

170. Atomic m-register operations.

Author

Merritt, Michael and Taubenfeld, Gadi

Abstract

We investigate systems where it is possible to access several shared registers in one atomic step. We characterize those systems in which the consensus problem can be solved in the presence of faults and give bounds on the space required. We also describe a fast solution to the mutual exclusion problem using atomic m-register operations. [ABSTRACT FROM AUTHOR]

Published
1994
Full Text
View/download PDF

171. Script: A communication abstraction mechanism and its verification

Author

Francez, Nissim, Hailpern, Brent, and Taubenfeld, Gadi

Subjects
Software
Abstract

In this paper, we introduce a new abstraction mechanism, called a script, which hides the low-level details that implement patterns of communication. A script localizes the communication between a set of roles (formal processes), to which actual processes enroll to participate in the action of the script. The paper discusses the addition of scripts to the languages CSP and ADA, and to a shared-variable language with monitors. Proof rules are presented for proving partial correctness and freedom from deadlock in concurrent programs using scripts.

Published
1986

174. Preface.

Author

Taubenfeld, Gadi

Published
2018

175. Reaching agreement in the presence of contention-related crash failures.

Author

Durand, Anaïs, Raynal, Michel, and Taubenfeld, Gadi

Subjects
*SYSTEM failures
Abstract

While consensus (and more generally agreement problems) is at the heart of many coordination problems in asynchronous distributed systems prone to process crashes, it has been shown to be impossible to solve in such systems where processes communicate by message-passing or by reading and writing a shared memory. Hence, these systems must be enriched with additional computational power for consensus to be solved on top of them. This article presents a new restriction of the classical basic computational model that combines process participation and a constraint on failure occurrences that can happen only while a predefined contention threshold has not yet been bypassed. This type of failure is called λ-constrained crashes , where λ defines the considered contention threshold. It appears that when assuming such contention-related crash failures and enriching the system with objects whose consensus number is x ≥ 1 , consensus for n processes can be solved for any n ≥ x assuming up to x failures. The article proceeds incrementally. It first presents an algorithm that solves consensus on top of read/write registers if at most one crash occurs before the contention threshold λ = n − 1 has been bypassed. Then, the article considers two extensions. The first one assumes that the system is enriched with objects whose consensus number is x ≥ 1 , and shows that when λ = n − x , consensus can be solved despite up to x λ -constrained crashes, for any n ≥ x , and when λ = n − 2 x + 1 , consensus can be solved despite up to 2 x − 1 λ -constrained crashes, assuming x divides n. The second extension prolongs the previous results to the k -set agreement problem (which is a natural generalization of consensus). Impossibility results are also presented for the number of λ -constrained failures that can be tolerated. [ABSTRACT FROM AUTHOR]

Published
2023
Full Text
View/download PDF

176. Distributed Universality.

Author

Raynal, Michel, Stainer, Julien, and Taubenfeld, Gadi

Subjects
*DISTRIBUTED computing, *COMPUTER algorithms, *SEQUENTIAL analysis, *SYNCHRONIZATION, *SYSTEM analysis
Abstract

A notion of a universal construction suited to distributed computing has been introduced by Herlihy in his celebrated paper ' Wait-free synchronization' (ACM Trans Program Lang Syst 13(1):124-149, 1991). A universal construction is an algorithm that can be used to wait-free implement any object defined by a sequential specification. Herlihy's paper shows that the basic system model, which supports only atomic read/write registers, has to be enriched with consensus objects to allow the design of universal constructions. The generalized notion of a k -universal construction has been recently introduced by Gafni and Guerraoui (Proceedings of 22nd international conference on concurrency theory (CONCUR'11), Springer LNCS 6901, pp 17-27, 2011). A k-universal construction is an algorithm that can be used to simultaneously implement k objects (instead of just one object), with the guarantee that at least one of the k constructed objects progresses forever. While Herlihy's universal construction relies on atomic registers and consensus objects, a k-universal construction relies on atomic registers and k-simultaneous consensus objects (which are wait-free equivalent to k-set agreement objects in the read/write system model). This paper significantly extends the universality results introduced by Herlihy and Gafni-Guerraoui. In particular, we present a k-universal construction which satisfies the following five desired properties, which are not satisfied by the previous k-universal construction: (1) among the k objects that are constructed, at least $$\ell $$ objects (and not just one) are guaranteed to progress forever; (2) the progress condition for processes is wait-freedom, which means that each correct process executes an infinite number of operations on each object that progresses forever; (3) if any of the k constructed objects stops progressing, all its copies (one at each process) stop in the same state; (4) the proposed construction is contention-aware, in the sense that it uses only read/write registers in the absence of contention; and (5) it is generous with respect to the obstruction-freedom progress condition, which means that each process is able to complete any one of its pending operations on the k objects if all the other processes hold still long enough. The proposed construction, which is based on new design principles, is called a $$(k,\ell )$$ -universal construction. It uses a natural extension of k-simultaneous consensus objects, called $$(k,\ell )$$ -simultaneous consensus objects ( $$(k,\ell )$$ -SC). Together with atomic registers, $$(k,\ell )$$ -SC objects are shown to be necessary and sufficient for building a $$(k,\ell )$$ -universal construction, and, in that sense, $$(k,\ell )$$ -SC objects are $$(k,\ell )$$ - $$ {universal}$$ . [ABSTRACT FROM AUTHOR]

Published
2016
Full Text
View/download PDF

177. A Limit to the Power of Multiple Nucleation in Self-assembly

Author

Sterling, Aaron D., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Taubenfeld, Gadi, editor

Published
2008
Full Text
View/download PDF

178. Local Maps: New Insights into Mobile Agent Algorithms

Author

Derbel, Bilel, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Taubenfeld, Gadi, editor

Published
2008
Full Text
View/download PDF

179. The Weakest Failure Detector for Message Passing Set-Agreement

Author

Delporte-Gallet, Carole, Fauconnier, Hugues, Guerraoui, Rachid, Tielmann, Andreas, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Taubenfeld, Gadi, editor

Published
2008
Full Text
View/download PDF

180. Local Terminations and Distributed Computability in Anonymous Networks

Author

Chalopin, Jérémie, Godard, Emmanuel, Métivier, Yves, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Taubenfeld, Gadi, editor

Published
2008
Full Text
View/download PDF

181. Fast Distributed Approximations in Planar Graphs

Author

Czygrinow, Andrzej, Hańćkowiak, Michal, Wawrzyniak, Wojciech, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Taubenfeld, Gadi, editor

Published
2008
Full Text
View/download PDF

182. Closing the Complexity Gap between FCFS Mutual Exclusion and Mutual Exclusion

Author

Danek, Robert, Golab, Wojciech, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Taubenfeld, Gadi, editor

Published
2008
Full Text
View/download PDF

183. A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring : (Extended Abstract)

Author

Chernoy, Viacheslav, Shalom, Mordechai, Zaks, Shmuel, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Taubenfeld, Gadi, editor

Published
2008
Full Text
View/download PDF

184. Using Bounded Model Checking to Verify Consensus Algorithms

Author

Tsuchiya, Tatsuhiro, Schiper, André, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Taubenfeld, Gadi, editor

Published
2008
Full Text
View/download PDF

185. How to Solve Consensus in the Smallest Window of Synchrony

Author

Alistarh, Dan, Gilbert, Seth, Guerraoui, Rachid, Travers, Corentin, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Taubenfeld, Gadi, editor

Published
2008
Full Text
View/download PDF

186. Theoretical Bound and Practical Analysis of Connected Dominating Set in Ad Hoc and Sensor Networks

Author

Vahdatpour, Alireza, Dabiri, Foad, Moazeni, Maryam, Sarrafzadeh, Majid, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Taubenfeld, Gadi, editor

Published
2008
Full Text
View/download PDF

187. Broadcasting in UDG Radio Networks with Missing and Inaccurate Information

Author

Fusco, Emanuele G., Pelc, Andrzej, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Taubenfeld, Gadi, editor

Published
2008
Full Text
View/download PDF

188. Matrix Signatures: From MACs to Digital Signatures in Distributed Systems

Author

Aiyer, Amitanand S., Alvisi, Lorenzo, Bazzi, Rida A., Clement, Allen, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Taubenfeld, Gadi, editor

Published
2008
Full Text
View/download PDF

189. Bosco: One-Step Byzantine Asynchronous Consensus

Author

Song, Yee Jiun, van Renesse, Robbert, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Taubenfeld, Gadi, editor

Published
2008
Full Text
View/download PDF

190. No Double Discount: Condition-Based Simultaneity Yields Limited Gain

Author

Moses, Yoram, Raynal, Michel, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Taubenfeld, Gadi, editor

Published
2008
Full Text
View/download PDF

191. Continuous Consensus with Failures and Recoveries

Author

Mizrahi, Tal, Moses, Yoram, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Taubenfeld, Gadi, editor

Published
2008
Full Text
View/download PDF

192. Leveraging Linial’s Locality Limit

Author

Lenzen, Christoph, Wattenhofer, Roger, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Taubenfeld, Gadi, editor

Published
2008
Full Text
View/download PDF

193. r 3: Resilient Random Regular Graphs

Author

Dimitrov, Stanko, Krishnan, P., Mallows, Colin, Meloche, Jean, Yajnik, Shalini, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Taubenfeld, Gadi, editor

Published
2008
Full Text
View/download PDF

194. Dynamic Routing and Location Services in Metrics of Low Doubling Dimension : (Extended Abstract)

Author

Konjevod, Goran, Richa, Andréa W., Xia, Donglin, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Taubenfeld, Gadi, editor

Published
2008
Full Text
View/download PDF

195. Computing Lightweight Spanners Locally

Author

Kanj, Iyad A., Perković, Ljubomir, Xia, Ge, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Taubenfeld, Gadi, editor

Published
2008
Full Text
View/download PDF

196. Permissiveness in Transactional Memories

Author

Guerraoui, Rachid, Henzinger, Thomas A., Singh, Vasu, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Taubenfeld, Gadi, editor

Published
2008
Full Text
View/download PDF

197. Hopscotch Hashing

Author

Herlihy, Maurice, Shavit, Nir, Tzafrir, Moran, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Taubenfeld, Gadi, editor

Published
2008
Full Text
View/download PDF

198. Optimizing Threshold Protocols in Adversarial Structures

Author

Herlihy, Maurice, Junqueira, Flavio P., Marzullo, Keith, Penso, Lucia Draque, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Taubenfeld, Gadi, editor

Published
2008
Full Text
View/download PDF

199. The Synchronization Power of Coalesced Memory Accesses

Author

Ha, Phuong Hoai, Tsigas, Philippas, Anshus, Otto J., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Taubenfeld, Gadi, editor

Published
2008
Full Text
View/download PDF

200. On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory

Author

Georgiou, Chryssis, Nicolaou, Nicolas C., Shvartsman, Alexander A., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Taubenfeld, Gadi, editor

Published
2008
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results