#### Filter Results:

#### Publication Year

1977

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

In practice, almost all dynamic systems require decisions to be made online, without full knowledge of their future impact on the system. We introduce a general model for the processing of sequences of tasks and develop a general online decision algorithm. We show that, for an important class of special cases, this algorithm is optimal among all online… (More)

A syntactic read-k-times branching program has the restriction that no variable occurs more than k times on any path (whether or not consistent) of the branching program. We first extend the result in [31], to show that the "n/2 clique only function", which is easily seen to be computable by deterministic polynomial size read-twice programs , cannot be… (More)

A novel algorithm for actively trading stocks is presented. While traditional universal algorithms (and technical trading heuristics) attempt to predict winners or trends, our approach relies on predictable statistical relations between all pairs of stocks in the market. Our empirical results on historical markets provide strong evidence that this type of… (More)

In practice, almost all dynamic systems require decisions to be made on-line, without full knowledge of their future impact on the system. A general model for the processing of sequences of tasks is introduced, and a general on-line decision algorithm is developed. It is shown that, for an important class of special cases, this algorithm is optimal among… (More)

Recently, there have been a number of algorithms proposed for analyzing hypertext link structure so as to determine the best " authorities " for a given topic or query. While such analysis is usually combined with content analysis, there is a sense in which some algorithms are deemed to be " more balanced " and others " more focused ". We undertake a… (More)

1 Introduction

We consider packet routing when packets are injected continuously into a network. We develop an adversarial theory of queueing aimed at addressing some of the restrictions inherent in probabilistic analysis and queueing theory based on stochastic generation. Our approach sheds light on various queueing policies in simple networks, and paves the way for the… (More)

Following the recent independent proofs of Immerman [SLAM J. nondeterministic space-bounded complexity classes are closed under complementation, two further applications of the inductive counting technique are developed. First, an errorless probabilistic algorithm for the undirected graph s-t connectivity problem that runs in O(log n) space and polynomial… (More)

It is shown that a probabilistic Turing acceptor or transducer running within space bound S can be simulated by a time S 2 parallel machine and therefore by a space S 2 deterministic machine. (Previous simulations ran in space $6.) In order to achieve these simulations, known algorithms are extended for the computation of determinants in small arithmetic… (More)