Proceedings 2001 IEEE International Conference on Cluster Computing

8-11 Oct. 2001

Filter Results

Displaying Results 1 - 25 of 67
  • 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.
  • How to go beyond the black-box simulation barrier

    Publication Year: 2001, Page(s):106 - 115
    Cited by:  Papers (56)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (208 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.
  • 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.
  • 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.
  • Vickrey prices and shortest paths: what is an edge worth?

    Publication Year: 2001, Page(s):252 - 259
    Cited by:  Papers (35)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (216 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.
  • Distributions on level-sets with applications to approximation algorithms

    Publication Year: 2001, Page(s):588 - 597
    Cited by:  Papers (16)
    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.
  • A replacement for Voronoi diagrams of near linear size

    Publication Year: 2001, Page(s):94 - 103
    Cited by:  Papers (19)
    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.
  • Universally composable security: a new paradigm for cryptographic protocols

    Publication Year: 2001, Page(s):136 - 145
    Cited by:  Papers (212)  |  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.
  • 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.
  • 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.
  • 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.
  • 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.
  • Extractors from Reed-Muller codes

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

    Finding explicit extractors is an important derandomization goal that has received a lot of attention in the past decade. Previous research has focused on two approaches, one related to hashing and the other to pseudorandom generators. A third view, regarding extractors as good error correcting codes, was noticed before. Yet, researchers had failed to build extractors directly from a good code wit... 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 (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (232 KB) | HTML iconHTML

    Given a set of moving points in Rd, 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 ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Three theorems regarding testing graph properties

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

    Property testing is a relaxation of decision problems in which it is required to distinguish YES-instances (i.e., objects having a predetermined property) from instances that are far from any YES-instance. We present three theorems regarding testing graph properties in the adjacency matrix representation. More specifically, these theorems relate to the project of characterizing graph properties ac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear-time recognition of circular-arc graphs

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

    A graph G is a circular-arc graph if it is the intersection graph of a set of arcs on a circle. That is, there is one arc for each vertex of G, and two vertices are adjacent in G if the corresponding arcs intersect. We give a linear time bound for recognizing this class of graphs. When G is a member of the class, the algorithm gives a certificate in the form of a set of arcs that realize it. 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 (7)
    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.
  • 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 (248 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.
  • An iterative rounding 2-approximation algorithm for the element connectivity problem

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

    In the survivable network design problem (SNDP), given an undirected graph and values rij for each pair of vertices i and j, we attempt to find a minimum-cost subgraph such that there are rij disjoint paths between vertices i and j. In the edge connected version of this problem (EC-SNDP), these paths must be edge-disjoint. In the vertex connected version of the problem (VC-SN... 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 (22)
    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.
  • Lower bounds for polynomial calculus: non-binomial case

    Publication Year: 2001, Page(s):190 - 199
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 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 modp Tseitin tautolo... 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 (296 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 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.
  • Glauber dynamics on trees and hyperbolic graphs

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

    We study discrete time Glauber dynamics for random configurations with local constraints (e.g. proper coloring, Ising and Potts models) on finite graphs with n vertices and of bounded degree. We show that the relaxation time (defined as the reciprocal of the spectral gap 1-λ2) for the dynamics on trees and on certain hyperbolic graphs, is polynomial in n. For these hyperbolic gra... 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 (13)  |  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.