Proceedings 35th Annual Symposium on Foundations of Computer Science

20-22 Nov. 1994

Filter Results

Displaying Results 1 - 25 of 74
  • IP over connection-oriented networks and distributional paging

    Publication Year: 1994, Page(s):424 - 434
    Cited by:  Papers (6)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (895 KB)

    Next generation wide area network are very likely to use connection-oriented protocols such as Asynchronous Transfer Mode (ATM). For the huge existing investment in current IP networks such as the Internet to remain useful, me must devise mechanisms to carry IP traffic over connection-oriented networks. A basic issue is to devise holding policies for virtual circuits carrying datagrams. In this pa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On-line admission control and circuit routing for high performance computing and communication

    Publication Year: 1994, Page(s):412 - 423
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1071 KB)

    This paper considers the problems of admission control and virtual circuit routing in high performance computing and communication systems. Admission control and virtual circuit routing problems arise in numerous applications, including video-servers, real-lime database servers, and the provision of permanent virtual channel in large-scale communications networks. The paper describes both upper an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A theory of competitive analysis for distributed algorithms

    Publication Year: 1994, Page(s):401 - 411
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1056 KB)

    We introduce a theory of competitive analysis for distributed algorithms. The first steps in this direction were made in the seminal papers of Y. Bartal et al. (1992), and of B. Awerbuch et al. (1992), in the context of data management and job scheduling. In these papers, as well as in other subsequent sequent work, the cost of a distributed algorithm is compared to the cost of an optimal global-c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Beyond competitive analysis [on-line algorithms]

    Publication Year: 1994, Page(s):394 - 400
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (629 KB)

    The competitive analysis of on-line algorithms has been criticized as being too crude and unrealistic. We propose two refinements of competitive analysis an two directions: The first restricts the power of the adversary by allowing only certain input distributions, while the other allows for comparisons between information regimes for on-line decision-making. We illustrate the first with an applic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Program result-checking: a theory of testing meets a test of theory

    Publication Year: 1994, Page(s):382 - 392
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (988 KB)

    We review the field of result-checking, discussing simple checkers and self-correctors. We argue that such checkers could profitably be incorporated in software as an aid to efficient debugging and reliable functionality. We consider how to modify traditional checking methodologies to make them more appropriate for use in real-time, real-number computer systems. In particular, we suggest that chec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast and feasible periodic sorting networks of constant depth

    Publication Year: 1994, Page(s):369 - 380
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1112 KB)

    A periodic comparator network has depth (or period) k, if for every t>k, the compare-exchange operations performed at step t are executed between exactly the same registers as at step t-k. We introduce a general method that converts an arbitrary comparator network that sorts n items in time T(n) and that has layout area A into a periodic sorting network of depth 5 that sorts /spl Theta/(n/spl m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling multithreaded computations by work stealing

    Publication Year: 1994, Page(s):356 - 368
    Cited by:  Papers (119)  |  Patents (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1316 KB)

    This paper studies the problem of efficiently scheduling fully strict (i.e., well-structured) multithreaded computations on parallel computers. A popular and practical method of scheduling this kind of dynamic MIMD-style computation is "work stealing," in which processors needing work steal computational threads from other processors. In this paper, we give the first provably good work-stealing sc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nearly tight bounds for wormhole routing

    Publication Year: 1994, Page(s):347 - 355
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (796 KB)

    We present nearly tight bounds for wormhole muting on Butterfly networks which indicate it is fundamentally different from store-and-forward packet routing. For instance, consider the problem of routing N log N (randomly generated) log N length messages from the inputs to the outputs of an N input Butterfly. We show that with high probability that this must take time at least /spl Omega/(log/sup 3... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the design of reliable Boolean circuits that contain partially unreliable gates

    Publication Year: 1994, Page(s):332 - 346
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1298 KB)

    We investigate a model of gate failure for Boolean circuits in which a faulty gate is restricted to output one of its input values. For some types of gates, the model (which we call the short-circuit model of gate failure) is weaker than the traditional von Neumann model where faulty gates always output precisely the wrong value. Our model has the advantage that it allows us to design Boolean circ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Products and help bits in decision trees

    Publication Year: 1994, Page(s):318 - 329
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1039 KB)

    We investigate two problems concerning the complexity of evaluating a function f at k-tuple of unrelated inputs by k parallel decision tree algorithms. In the product problem, for some fixed depth bound d, we seek to maximize the fraction of input k-tuples for which all k decision trees are correct. Assume that for a single input to f, the best decision tree algorithm of depth d is correct on a fr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient oblivious branching programs for threshold functions

    Publication Year: 1994, Page(s):309 - 317
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (653 KB)

    In his survey paper on branching programs, A.A. Razborov (1991) asked the following question: Does every rectifier-switching network computing the majority of n bits have size n/sup 1+/spl Omega/(1/)? We answer this question in the negative by constructing a simple oblivious branching program of size O(n log/sup 3/ n/log log n log log log n) for computing any threshold function. This improves the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A lower bound for the monotone depth of connectivity

    Publication Year: 1994, Page(s):302 - 308
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (463 KB)

    We show that any monotone circuit for computing graph connectivity must have a depth greater than /spl Omega/((log n)/sup 3/2// log log n). This proves that UCONN/sub n/ is not in monotone NC/sup 1/. The proof technique, which is an adaptation of Razborov's approximation method, is also used to derive lower bounds for a general class of graph problems.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the robustness of functional equations

    Publication Year: 1994, Page(s):288 - 299
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1038 KB)

    Given a functional equation, such as /spl forall/x, y f(x)+f(y)=f(x+y), we study the following general question: When can the "for all" quantifiers be replaced by "for most" quantifiers without essentially changing the functions that are characterized by the property? When "for most" quantifiers are sufficient, we say that the functional equation is robust. We show conditions on functional equatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Randomness-efficient oblivious sampling

    Publication Year: 1994, Page(s):276 - 287
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (938 KB)

    We introduce a natural notion of obliviousness of a sampling procedure, and construct a randomness-efficient oblivious sampler. Our sampler uses O(l+log /spl delta//sup -1//spl middot/log l) coins to output m=poly(/spl epsiv//sup -1/, log /spl delta//sup -1/, log l) sample points x/sub 1/, ..., x/sub m/, /spl isin/ {0, 1}/sup 1/ such that Pr[|1/m/spl Sigma//sub i=1//sup m/f(x/sub i/)-E[f]|</spl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computing with very weak random sources

    Publication Year: 1994, Page(s):264 - 275
    Cited by:  Papers (8)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1078 KB)

    For any fixed /spl epsiv/>0, we show how to simulate RP algorithms in time n/sup O(log n/) using the output of a /spl delta/-source with min-entropy R(/spl epsiv/). Such a weak random source is asked once for R(/spl epsiv/) bits; it outputs an R-bit string such that any string has probability at most 2/sup -R/(/spl epsiv//). If /spl epsiv/>1-1/(k+1), our BPP simulations take time n/sup O(log... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • (De)randomized construction of small sample spaces in /spl Nscr//spl Cscr/

    Publication Year: 1994, Page(s):252 - 263
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1205 KB)

    D. Koller and N. Megiddo (1993) introduced the paradigm of constructing compact distributions that satisfy a given set of constraints, and showed how it can be used to efficiently derandomize certain types of algorithm. In this paper, we significantly extend their results in two ways. First, we show how their approach can be applied to deal with more general expectation constraints. More important... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Local optimization of global objectives: competitive distributed deadlock resolution and resource allocation

    Publication Year: 1994, Page(s):240 - 249
    Cited by:  Papers (11)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (838 KB)

    The work is motivated by deadlock resolution and resource allocation problems, occurring in distributed server-client architectures. We consider a very general setting which includes, as special cases, distributed bandwidth management in communication networks, as well as variations of classical problems in distributed computing and communication networking such as deadlock: resolution and "dining... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast and lean self-stabilizing asynchronous protocols

    Publication Year: 1994, Page(s):226 - 239
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1285 KB)

    We consider asynchronous general topology dynamic networks of identical nameless nodes with worst-case transient faults. Starting from any faulty configuration, our protocols self-stabilize any computation in time polynomial in the (unknown) network diameter. This version sacrifices some diversity of tasks and efficiency for simplicity and clarity of details. Appendix gives more efficient procedur... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The load, capacity and availability of quorum systems

    Publication Year: 1994, Page(s):214 - 225
    Cited by:  Papers (14)  |  Patents (39)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1049 KB)

    A quorum system is a collection of sets (quorums) every two of which have a nonempty intersection. Quorum systems have been used for a number of applications in the area of distributed systems. We investigate the load, capacity and availability of quorum systems. We present four novel constructions of quorum system, all featuring optimal or near optimal load, and high availability. These desirable... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rapid rumor ramification: approximating the minimum broadcast time

    Publication Year: 1994, Page(s):202 - 213
    Cited by:  Papers (38)  |  Patents (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1087 KB)

    Given an undirected graph representing a network of processors, and a source node containing a message that must be broadcast to all the nodes, find a scheme that accomplishes the broadcast in the minimum number of time steps. At each time step, any processor that has received the message is allowed to communicate the message to at most one of its neighbors in the network, i.e. can communicate via... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimating the size of the transitive closure in linear time

    Publication Year: 1994, Page(s):190 - 200
    Cited by:  Papers (10)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (863 KB)

    Computing transitive closure and reachability information in directed graphs is a fundamental graph problem with many applications. The fastest known algorithms run in O(sm) time for computing all nodes reachable from each of 1/spl les/s/spl les/n source nodes, or, using fast matrix multiplication, in O(n/sup 2.38/) time for computing the transitive closure, where n is the number of nodes and m th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximum (s,t)-flows in planar networks in O(|V|log|V|) time

    Publication Year: 1994, Page(s):178 - 189
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (773 KB)

    Let G=(V, A) be a directed, planar graph, let s, t /spl isin/ V, s/spl ne/t, and let c/sub a/>0 be the capacity of an arc a/spl isin/A. The problem is to find a maximum flow from s to t in G: subject to these capacities. The fastest algorithm known so far requires /spl Oscr/(|V|/spl middot//sup 3//spl radic/|V|/spl middot/log|V|) time, whereas the algorithm introduced in this paper requires onl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Long tours and short superstrings

    Publication Year: 1994, Page(s):166 - 177
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1058 KB)

    This paper considers weight-maximizing variants of the classical symmetric and asymmetric traveling-salesman problems. Like their weight-minimizing counterparts, these variants are MAX SNP-hard. We present the first nontrivial approximation algorithms for these problems. Our algorithm for directed graphs finds a tour whose weight is at least 38/63/spl ap/0.603 times the weight of a maximum-weight ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finding the k shortest paths

    Publication Year: 1994, Page(s):154 - 165
    Cited by:  Papers (131)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1062 KB)

    We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m+n log n+k). We can also find the k shortest paths from a given source s to each vertex in the graph, in total time O(m+n log n+kn). We describe applications t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient average-case algorithms for the modular group

    Publication Year: 1994, Page(s):143 - 152
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (767 KB)

    The modular group occupies a central position in many branches of mathematical sciences. In this paper we give average polynomial-time algorithms for the unbounded and bounded membership problems for finitely generated subgroups of the modular group. The latter result affirms a conjecture of Y. Gurevich (1990).<<ETX>> View full abstract»

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