Searching for authors named "Nicholas Pippenger" – sorted by Relevance.
11 documents found, showing 1 through 10.
Next 10 →
-
Average-Case Bounds for the Complexity of Path-Search
- …: A channel graph is the union of all paths between a given input and a given output in an interconnection network. At any moment in time, each vertex in such a graph is either idle or busy. The search problem we consider is to find a path (from the given input to the given output) consisting entire…
- Add To MetaCart
-
Random Interval Graphs
- …: We consider models for random interval graphs that are based on stochastic service systems, with vertices corresponding to customers and edges corresponding to pairs of customers that are in the system simultaneously. The number N of vertices in a connected component thus corresponds to the number…
- Add To MetaCart
-
Topological Aspects of Regular Languages
- …: We establish a number of new results (and rederive some old results) concerning regular languages, using essentially topological methods. Our development is based on the duality (established by Stone) between Boolean algebras and certain topological spaces (which are now called "Stone spaces"). (T…
- Add To MetaCart
-
Pure versus Impure Lisp
- …: The aspect of purity versus impurity that we address involves the absence versus presence of mutation: the use of primitives (RPLACA and RPLACD in Lisp, set-car! and set-cdr! in Scheme) that change the state of pairs without creating new pairs. It is well known that cyclic list structures can be c…
- Cited by 12 (0 self) – Add To MetaCart
-
Analysis of a Recurrence Arising from a Construction for Non-Blocking Networks
- …: Define f on the integers n ? 1 by the recurrence f(n) = minfn; min mjn 2f(m) + 3f(n=m)g: The function f has f(n) = n as its upper envelope, attained for all prime n. Our goal in this paper is to determine the corresponding lower envelope. We shall show that this has the form f(n) C(log n) 1+1…
- Cited by 1 (0 self) – Add To MetaCart
-
Juggling Networks
- …: Switching networks of various kinds have come to occupy a prominent position in computer science as well as communication engineering. The classical switching network technology has been space-division-multiplex switching, in which each switching function is performed by a spatially separate switc…
- Cited by 15 (0 self) – Add To MetaCart
-
Self-Routing Superconcentrators
- …: Superconcentrators are switching systems that solve the generic problem of interconnecting clients and servers during sessions, in situations where either the clients or the servers are interchangeable (so that it does not matter which client is connected to which server). Previous constructions o…
- Cited by 22 (0 self) – Add To MetaCart
-
Average-Case Lower Bounds for Noisy Boolean Decision Trees
- …: We present a new method for deriving lower bounds to the expected number of queries made by noisy decision trees computing Boolean functions. The new method has the feature that expectations are taken with respect to a uniformly distributed random input, as well as with respect to the random noise…
- Cited by 12 (1 self) – Add To MetaCart
-
Characterizations of 1-Way Quantum Finite Automata
- …The 2-way quantum finite automaton introduced by Kondacs and Watrous[KW97] can accept non-regular languages with bounded error in polynomial time. If we restrict the head of the automaton to moving classically and to moving only in one direction, the acceptance power of this 1-way quantum finite aut…
- Cited by 11 (0 self) – Add To MetaCart
-
On the Maximum Tolerable Noise for Reliable Computation by Formulas
- …: It is shown that if a formula is constructed from noisy 2-input NAND gates, with each gate failing independently with probability ", then reliable computation can or cannot take place according as " is less than or greater than " 0 = (3 \Gamma p 7)=4 = 0:08856 : : : . * This research was supporte…
- Cited by 11 (0 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
