Proceedings 2001 IEEE International Conference on Cluster Computing

8-11 Oct. 2001

Filter Results

Displaying Results 1 - 25 of 67
  • 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 (264 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.
  • Random evolution in massive graphs

    Publication Year: 2001, Page(s):510 - 519
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (240 KB) | HTML iconHTML

    Many massive graphs (such as the WWW graph and Call graphs) share certain universal characteristics which can be described by the so-called "power law." In this paper, we, examine three important aspects of power law graphs, (1) the evolution of power law graphs, (2) the asymmetry of in-degrees and out-degrees, (3) the "scale invariance" of power law graphs. In particular, we give three increasing... 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 (248)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (232 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.
  • Web search via hub synthesis

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

    We present a model for web search that captures in a unified manner three critical components of the problem: how the link structure of the web is generated, how the content of a web document is generated, and how a human searcher generates a query. The key to this unification lies in capturing the correlations between these components in terms of proximity in a shared latent semantic space. Given... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deterministic computation of the Frobenius form

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

    A deterministic algorithm for computing the Frobenius canonical-form of a matrix over a field is described. A similarity transformation-matrix is recovered in the same time. The algorithm is nearly optimal, requiring about the same number of field operations as required for matrix multiplication. Previously-known reductions to matrix multiplication are probabilistic. 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 (11)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (248 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.
  • Building low-diameter P2P networks

    Publication Year: 2001, Page(s):492 - 499
    Cited by:  Papers (47)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (216 KB) | HTML iconHTML

    In a peer-to-peer (P2P) network, nodes connect into an existing network and participate in providing and availing of services. There is no dichotomy between a central server and distributed clients. Current P2P networks (e.g., Gnutella) are constructed by participants following their own uncoordinated (and often whimsical) protocols; they consequently suffer from frequent network overload and frag... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lower bounds for matrix product

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

    We prove lower bounds on the number of product gates in bilinear and quadratic circuits that compute the product of two n × n matrices over finite fields. In particular we obtain the following results: 1. We show that the number of product gates in any bilinear (or quadratic) circuit that computes the product of two n × n matrices over GF(2) is at least 3n2 o(n2).... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sorting and selection with structured costs

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

    The study of the effect of priced information on basic algorithmic problems was initiated by M. Charikar et al. (2000). The authors continue the study of sorting and selection in the priced comparison model, i.e., when each comparison has an associated cost, and answer some of the open problems suggested by Charikar et al. If the comparison costs are allowed to be arbitrary, we show that one canno... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lower bounds for quantum communication complexity

    Publication Year: 2001, Page(s):288 - 297
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (264 KB) | HTML iconHTML

    We prove new lower bounds for bounded error quantum communication complexity. Our methods are based on the Fourier transform of the considered functions. First we generalize a method for proving classical communication complexity lower bounds developed by R. Raz (1995) to the quantum case. Applying this method we give an exponential separation between bounded error quantum communication complexity... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributions on level-sets with applications to approximation algorithms

    Publication Year: 2001, Page(s):588 - 597
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (272 KB) | HTML iconHTML

    We consider a family of distributions on fixed-weight vectors in {0, 1}t; these distributions enjoy certain negative correlation properties and also satisfy pre-specified conditions on their marginal distributions. We show the existence of such families, and present a linear-time algorithm to sample from them. This yields improved approximation algorithms for the following problems: (a)... 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 (11)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (272 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.
  • Testing subgraphs in large graphs

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

    Let H be a fixed graph with h vertices, let G be a graph on n vertices and suppose that at least εn2 edges have to be deleted from it to make it H-free. It is known that in this case G contains at least f (ε, H)nh copies of H. We show that the largest possible function f (ε, H) is polynomial in ε if and only if H is bipartite. This implies that there is a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Query efficient PCPs with perfect completeness

    Publication Year: 2001, Page(s):610 - 619
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (224 KB) | HTML iconHTML

    For every integer k>1, we present a PCP characterization of NP where the verifier uses logarithmic randomness, queries 4k+k2 bits in the proof, accepts a correct proof with probability 1 (i.e. it is has perfect completeness) and accepts any supposed proof of a false statement with a certain maximum probability. In particular, the verifier achieves optimal amortized query complexity of 1... 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 (14)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (232 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.
  • Sequential and parallel algorithms for mixed packing and covering

    Publication Year: 2001, Page(s):538 - 546
    Cited by:  Papers (26)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (256 KB) | HTML iconHTML

    We describe sequential and parallel algorithms that approximately solve linear programs with no negative coefficients (aka mixed packing and covering problems). For explicitly given problems, our fastest sequential algorithm returns a solution satisfying all constraints within a 1±ε factor in O(mdlog(m)/ε2) time, where m is the number of constraints and d is the maximum... View full abstract»

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

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

    The seminal paper of F.T. Leighton and S. Rao (1988) and subsequent papers presented approximate min-max theorems relating multicommodity flow values and cut capacities in undirected networks, developed the divide-and-conquer method for designing approximation algorithms, and generated novel tools for utilizing linear programming relaxations. Yet, despite persistent research efforts, these achieve... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Truthful mechanisms for one-parameter agents

    Publication Year: 2001, Page(s):482 - 491
    Cited by:  Papers (89)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (248 KB) | HTML iconHTML

    The authors show how to design truthful (dominant strategy) mechanisms for several combinatorial problems where each agent's secret data is naturally expressed by a single positive real number. The goal of the mechanisms we consider is to allocate loads placed on the agents, and an agent's secret data is the cost she incurs per unit load. We give an exact characterization for the algorithms that c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximation algorithms for the job interval selection problem and related scheduling problems

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

    The authors consider the job interval selection problem (JISP), a simple scheduling model with a rich history and numerous applications. Special cases of this problem include the so-called real-time scheduling problem (also known as the throughput maximization problem) in single and multiple machine environments. In these special cases we have to maximize the number of jobs scheduled between their... View full abstract»

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

    Publication Year: 2001, Page(s):406 - 415
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (240 KB) | HTML iconHTML

    We consider the problem of incrementally designing a network to route demand to a single sink on an underlying metric space. We are given cables whose costs per unit length scale in a concave fashion with capacity. Under certain natural restrictions on the costs (called the Access Network Design constraints), we present a simple and efficient randomized algorithm that is competitive to the minimum... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • How powerful is adiabatic quantum computation?

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

    The authors analyze the computational power and limitations of the recently proposed 'quantum adiabatic evolution algorithm'. Adiabatic quantum computation is a novel paradigm for the design of quantum algorithms; it is truly quantum in the sense that it can be used to speed up searching by a quadratic factor over any classical algorithm. On the question of whether this new paradigm may be used to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Randomly colouring graphs with lower bounds on girth and maximum degree

    Publication Year: 2001, Page(s):579 - 587
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (368 KB) | HTML iconHTML

    We consider the problem of generating a random q-colouring of a graph G=(V, E). We consider the simple Glauber Dynamics chain. We show that if the maximum degree Δ>cl ln n and the girth g>c2 ln ln n (n=|V|), then this chain mixes rapidly provided C1, C2 are sufficiently large, q/A>β, where β≈1.763 is the root of β=e1... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Expander-based constructions of efficiently decodable codes

    Publication Year: 2001, Page(s):658 - 667
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (280 KB) | HTML iconHTML

    We present several novel constructions of codes which share the common thread of using expander (or expander-like) graphs as a component. The expanders enable the design of efficient decoding algorithms that correct a large number of errors through various forms of "voting" procedures. We consider both the notions of unique and list decoding, and in all cases obtain asymptotically good codes which... 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 (22)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (384 KB) | HTML iconHTML

    For a set P of n points in Rd, we define a new type of space decomposition. The new diagram provides an ε-approximation to the distance function associated with the Voronoi diagram of P, while being of near linear size, for d≥2. This contrasts with the standard Voronoi diagram that has Ω (n[d2]/) 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.
  • 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 (272 KB) | HTML iconHTML

    The authors present an O(n log3 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(n32/) time, and the best polynomial algorithm developed by M. Henzinger et al. (1994) which ran in O˜(n43/) time. We ... View full abstract»

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