Searching for authors named "Andreas Jakoby" – sorted by Relevance.
21 documents found, showing 1 through 10.
Next 10 →
-
The Average Time Complexity to Compute Prefix Functions in Processor Networks
- …We analyze the average time complexity of evaluating all prefixes of an input vector over a given algebraic structure h\Sigma; . As a computational model networks of finite controls are used and a complexity measure for the average delay of such networks is introduced. Based on this notion, we then …
- Cited by 1 (1 self) – Add To MetaCart
-
The Non-Recursive Power of Erroneous Computation
- …. We present two new complexity classes which are based on a complexity class C and an error probability function F . The first, F-Err C, reflects the (weak) feasibility of problems that can be computed within the error bound F . As a more adequate measure to investigate lower bounds we introduc…
- Add To MetaCart
-
The Complexity of Some Basic Problems for Dynamic Process Graphs
- …A fundamental problem in programming multiprocessors is scheduling elementary tasks on the available hardware efficiently. Traditionally, one represents tasks and precedence constraints by a data-flow graph. This representation requires that the set of tasks is known beforehand.…
- Add To MetaCart
-
Privacy in non-private environments
- …Abstract. We study private computations in information-theoretical settings on networks that are not 2-connected. Non-2-connected networks are “non-private ” in the sense that most functions cannot privately be computed on them. We relax the notion of privacy by introducing lossy private protocols, …
- Cited by 3 (1 self) – Add To MetaCart
-
On the Complexity of Worst Case and Expected Time in a Circuit
- …. The computational delay of a circuit can be described by the natural concept of time [Jakoby et al. STOC94]. We show that for a given input x and circuit C the computation of timeC (x) is P-complete. Moreover, we show that it is NP-complete to decide whether there exists an input x such that t…
- Cited by 3 (3 self) – Add To MetaCart
-
Computational Error Complexity Classes
- …The complexity classes Nearly- BPP and Med DisP had been recently proposed as limits of efficient computation [Yam1 96, Schi 96]. For both classes, a polynomial time bounded algorithm with bounded probabilistic error has to compute correct outputs for at least 1 \Gamma 1 n !(1) of inputs of len…
- Cited by 1 (1 self) – Add To MetaCart
-
Average Case Complexity of Unbounded Fanin Circuits
- …Several authors have shown that the PARITY-function cannot be computed by unbounded fanin circuits of small depth and polynomial size. Even more, constant depth k circuits of size exp(n \Theta(1=k) ) give wrong results for PARITY for almost half of all inputs. We generalize these results in two di…
- Cited by 1 (1 self) – Add To MetaCart
-
Scheduling Trees with Communication Delays
- …Several variants of scheduling task graphs with interprocessor communication delays have been shown to be NP -complete. This paper completely characterizes the complexity of this problem under the restriction that the task graphs are trees and that each task has unit execution time. It is shown that…
- Cited by 1 (0 self) – Add To MetaCart
-
R.: Space efficient algorithms for directed series-parallel graphs
- …The subclass of directed series-parallel graphs plays an important role in computer science. Whether a given graph is series-parallel is a well studied problem in algorithmic graph theory, for which fast sequential and parallel algorithms have been developed in a sequence of papers. Also methods are…
- Cited by 1 (0 self) – Add To MetaCart
-
Preserving Privacy versus Data Retention
- …The retention of communication data has recently attracted much public interest, mostly because of the possibility of its misuse. In this paper, we present protocols that address the privacy concerns of the communication partners. Our data retention protocols store streams of encrypted data items, s…
- Add To MetaCart
Showing 1 through 10.
Next 10 →
