Proceedings 2001 IEEE International Conference on Cluster Computing

14-17 Oct. 2001

Filter Results

Displaying Results 1 - 25 of 67
  • 42nd IEEE Symposium on Foundations of Computer Science [front matter]

    Publication Year: 2001, Page(s):i - viii
    Request permission for commercial reuse | PDF file iconPDF (146 KB)
    Freely Available from IEEE
  • Game theory and mathematical economics: a theoretical computer scientist's introduction

    Publication Year: 2001, Page(s):4 - 8
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (100 KB) | HTML iconHTML

    There has been recently increasing interaction between game theory and, more generally, economic theory, with theoretical computer science, mainly in the context of the Internet. The paper is an invitation to this important frontier. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithmic applications of low-distortion geometric embeddings

    Publication Year: 2001, Page(s):10 - 33
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (495 KB) | HTML iconHTML

    The author surveys algorithmic results obtained using low-distortion embeddings of metric spaces into (mostly) normed spaces. He shows that low-distortion embeddings provide a powerful and versatile toolkit for solving algorithmic problems. Their fundamental nature makes them applicable in a variety of diverse settings, while their relation to rich mathematical fields (e.g., functional analysis) e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coding theory: tutorial & survey

    Publication Year: 2001, Page(s):36 - 53
    Cited by:  Papers (6)
    Request permission for commercial reuse | PDF file iconPDF (403 KB) | HTML iconHTML
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Almost tight upper bounds for vertical decompositions in four dimensions

    Publication Year: 2001, Page(s):56 - 65
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (294 KB) | HTML iconHTML

    We show that the complexity of the vertical decomposition of an arrangement of n fixed-degree algebraic surfaces or surface patches in four dimensions is O(n/sup 4+/spl epsi//) for any /spl epsi/ > 0. This improves the best previously known upper bound for this problem by a near-linear factor, and settles a major problem in the theory of arrangements of surfaces, open since 1989. The new bound ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximate shape fitting via linearization

    Publication Year: 2001, Page(s):66 - 73
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (182 KB) | HTML iconHTML

    Shape fitting is a fundamental optimization problem in computer science. The authors present a general and unified technique for solving a certain family of such problems. Given a point set P in R/sup d/, this technique can be used to /spl epsi/-approximate: (i) the min-width annulus and shell that contains P, (ii) minimum width cylindrical shell containing P, (iii) diameter, width, minimum volume... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the complexity of many faces in arrangements of circles

    Publication Year: 2001, Page(s):74 - 83
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (207 KB) | HTML iconHTML

    We obtain improved bounds on the complexity of m distinct faces in an arrangement of n circles and in an arrangement of n unit circles. The bounds are worst-case tight for unit circles, and, for general circles, they nearly coincide with the best known bounds for the number of incidences between m points and n circles. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Clustering motion

    Publication Year: 2001, Page(s):84 - 93
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (223 KB) | HTML iconHTML

    Given a set of moving points in R/sup d/, we show that one can cluster them in advance, using a small number of clusters, so that at any point in time this static clustering is competitive with the optimal k-centre clustering of the point-set at this point in time. The advantage of this approach is that it avoids the usage of kinetic data structures and as such it does not need to update the clust... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A replacement for Voronoi diagrams of near linear size

    Publication Year: 2001, Page(s):94 - 103
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (370 KB) | HTML iconHTML

    For a set P of n points in R/sup d/, we define a new type of space decomposition. The new diagram provides an /spl epsi/-approximation to the distance function associated with the Voronoi diagram of P, while being of near linear size, for d/spl ges/2. This contrasts with the standard Voronoi diagram that has /spl Omega/ (n/sup [d/2]/) complexity in the worst case. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • How to go beyond the black-box simulation barrier

    Publication Year: 2001, Page(s):106 - 115
    Cited by:  Papers (78)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (192 KB) | HTML iconHTML

    The simulation paradigm is central to cryptography. A simulator is an algorithm that tries to simulate the interaction of the adversary with an honest party, without knowing the private input of this honest party. Almost all known simulators use the adversary's algorithm as a black-box. We present the first constructions of non-black-box simulators. Using these new non-black-box techniques, we obt... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resettably-sound zero-knowledge and its applications

    Publication Year: 2001, Page(s):116 - 125
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (217 KB) | HTML iconHTML

    Resettably-sound proofs and arguments maintain soundness even when the prover can reset the verifier to use the same random coins in repeated executions of the protocol. We show that resettably-sound zero-knowledge arguments for NP exist if collision-free hash functions exist. In contrast, resettably-sound zero-knowledge proofs are possible only for languages in P/poly. We present two applications... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the impossibility of basing trapdoor functions on trapdoor predicates

    Publication Year: 2001, Page(s):126 - 135
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (237 KB) | HTML iconHTML

    We prove that, somewhat surprisingly, there is no black-box reduction of (poly-to-one) trapdoor functions to trapdoor predicates (equivalently, to public-key encryption schemes). Our proof follows the methodology that was introduced by R. Impagliazzo and S. Rudich (1989), although we use a new, weaker model of separation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Universally composable security: a new paradigm for cryptographic protocols

    Publication Year: 2001, Page(s):136 - 145
    Cited by:  Papers (307)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (220 KB) | HTML iconHTML

    We propose a novel paradigm for defining security of cryptographic protocols, called universally composable security. The salient property of universally composable definitions of security is that they guarantee security even when a secure protocol is composed of an arbitrary set of protocols, or more generally when the protocol is used as a component of an arbitrary system. This is an essential p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Traveling with a Pez dispenser (or, routing issues in MPLS)

    Publication Year: 2001, Page(s):148 - 157
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (250 KB) | HTML iconHTML

    MultiProtocol Label Switching (MPLS) is a routing model proposed by the IETF for the Internet, and is becoming widely popular. In this paper, we initiate a theoretical study of the routing model, and give routing algorithms and lower bounds in a variety of situations. We first study the routing problems on the line. We then build up our results from paths through trees to more general graphs. The ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simple routing strategies for adversarial systems

    Publication Year: 2001, Page(s):158 - 167
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (243 KB) | HTML iconHTML

    In this paper we consider the problem of delivering dynamically changing input streams in dynamically changing networks where both the topology and the input streams can change in an unpredictable way. In particular, we present two simple distributed balancing algorithms (one for packet injections and one for flow injections) and show that for the case of a single receiver these algorithms will al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Source routing and scheduling in packet networks

    Publication Year: 2001, Page(s):168 - 177
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (237 KB) | HTML iconHTML

    We study routing and scheduling in packet-switched networks. We assume an adversary that controls the injection time, source, and destination for each packet injected. A set of paths for these packets is admissible if no link in the network is overloaded. We present the first on-line routing algorithm that finds a set of admissible paths whenever this is feasible. Our algorithm calculates a path f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The natural work-stealing algorithm is stable

    Publication Year: 2001, Page(s):178 - 187
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (232 KB) | HTML iconHTML

    In this paper we analyse a very simple dynamic work-stealing algorithm. In the work-generation model, there are n generators which are arbitrarily distributed among a set of n processors. During each time-step, with probability /spl lambda/, each generator generates a unit-time task which it inserts into the queue of its host processor. After the new tasks are generated, each processor removes one... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lower bounds for polynomial calculus: non-binomial case

    Publication Year: 2001, Page(s):190 - 199
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (282 KB) | HTML iconHTML

    We generalize recent linear lower bounds for Polynomial Calculus based on binomial ideals. We produce a general hardness criterion (that we call immunity) which is satisfied by a random function and prove linear lower bounds on the degree of PC refutations for a wide class of tautologies based on immune functions. As some applications of our techniques, we introduce mod/sub p/ Tseitin tautologies ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Counting axioms do not polynomially simulate counting gates

    Publication Year: 2001, Page(s):200 - 209
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (230 KB) | HTML iconHTML

    We give a family of tautologies whose algebraic translations have constant-degree, polynomial size polynomial calculus refutations over Z/sub 2/, but which require superpolynomial size bounded-depth Frege proofs from Count/sub 2/ axioms. This gives a superpolynomial size separation of bounded-depth Frege plus mod 2 counting axioms from bounded-depth Frege plus parity gates. Combined with another r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resolution is not automatizable unless W[P] is tractable

    Publication Year: 2001, Page(s):210 - 219
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (286 KB) | HTML iconHTML

    We show that neither Resolution nor tree-like Resolution is automatizable unless the class W[P] from the hierarchy of parameterized problems is fixed-parameter tractable by randomized algorithms with one-sided error. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • "Planar" tautologies hard for resolution

    Publication Year: 2001, Page(s):220 - 229
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (227 KB) | HTML iconHTML

    We prove exponential lower bounds on the resolution proofs of some tautologies, based on rectangular grid graphs. More specifically, we show a 2/sup /spl Omega/(n)/ lower bound for any resolution proof of the mutilated chessboard problem on a 2n/spl times/2n chessboard as well as for the Tseitin tautology (G. Tseitin, 1968) based on the n/spl times/n rectangular grid graph. The former result answe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Planar graphs, negative weight edges, shortest paths, and near linear time

    Publication Year: 2001, Page(s):232 - 241
    Cited by:  Papers (10)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (257 KB) | HTML iconHTML

    The authors present an O(n log/sup 3/ n) time algorithm for finding shortest paths in a planar graph with real weights. This can be compared to the best previous strongly polynomial time algorithm developed by R. Lipton et al., (1978 )which ran in O(n/sup 3/2/) time, and the best polynomial algorithm developed by M. Henzinger et al. (1994) which ran in O/spl tilde/(n/sup 4/3/) time. We also presen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compact oracles for reachability and approximate distances in planar digraphs

    Publication Year: 2001, Page(s):242 - 251
    Cited by:  Papers (12)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB) | HTML iconHTML

    It is shown that a planar digraph can be preprocessed in near-linear time, producing a near-linear space distance oracle that can answer reachability queries in constant time. The oracle can be distributed as an O(log n) space label for each vertex and then we can determine if one vertex can reach another considering their two labels only. The approach generalizes to approximate distances in weigh... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Vickrey prices and shortest paths: what is an edge worth?

    Publication Year: 2001, Page(s):252 - 259
    Cited by:  Papers (42)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (207 KB) | HTML iconHTML

    We solve a shortest path problem that is motivated by recent interest in pricing networks or other computational resources. Informally, how much is an edge in a network worth to a user who wants to send data between two nodes along a shortest path? If the network is a decentralized entity, such as the Internet, in which multiple self-interested agents own different parts of the network, then aucti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fully dynamic all pairs shortest paths with real edge weights

    Publication Year: 2001, Page(s):260 - 267
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (235 KB) | HTML iconHTML

    We present the first fully dynamic algorithm for maintaining all pairs shortest paths in directed graphs with real-valued edge weights. Given a dynamic directed graph G such that each edge can assume at most S different real values, we show how to support updates deterministically in O(S/spl middot/n/sup 2.5/log/sup 3/n) amortized time and queries in optimal worst-case time. No previous fully dyna... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.