Results 1  10
of
28
The Impact of the Lambda Calculus in Logic and Computer Science
 BULLETIN OF SYMBOLIC LOGIC
, 1997
"... One of the most important contributions of A. Church to logic is his invention of the lambda calculus. We present the genesis of this theory and its two major areas of application: the representation of computations and the resulting functional programming languages on the one hand and the represent ..."
Abstract

Cited by 24 (0 self)
 Add to MetaCart
One of the most important contributions of A. Church to logic is his invention of the lambda calculus. We present the genesis of this theory and its two major areas of application: the representation of computations and the resulting functional programming languages on the one hand and the representation of reasoning and the resulting systems of computer mathematics on the other hand.
Proving primality in essentially quartic random time
 Math. Comp
, 2003
"... Abstract. This paper presents an algorithm that, given a prime n, finds and verifies a proof of the primality of n in random time (lg n) 4+o(1). Several practical speedups are incorporated into the algorithm and discussed in detail. 1. ..."
Abstract

Cited by 19 (0 self)
 Add to MetaCart
Abstract. This paper presents an algorithm that, given a prime n, finds and verifies a proof of the primality of n in random time (lg n) 4+o(1). Several practical speedups are incorporated into the algorithm and discussed in detail. 1.
OffLine and OnLine CallScheduling in Stars and Trees
 in Proceedings of the 23rd International Workshop on GraphTheoretic Concepts in Computer Science, WG ‘97, LNCS1335, SpringerVerlag
, 1997
"... . Given a communication network and a set of call requests, the goal is to find a minimum makespan schedule for the calls such that the sum of the bandwidth requirements of simultaneously active calls using the same link does not exceed the capacity of that link. In this paper the callschedulin ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
. Given a communication network and a set of call requests, the goal is to find a minimum makespan schedule for the calls such that the sum of the bandwidth requirements of simultaneously active calls using the same link does not exceed the capacity of that link. In this paper the callscheduling problem is studied for star and tree networks. Lower and upper bounds on the worstcase performance of ListScheduling (LS) and variants of it are obtained for callscheduling with arbitrary bandwidth requirements and either unit call durations or arbitrary call durations. LS does not require advance knowledge of call durations and, hence, is an online algorithm. It has performance ratio (competitive ratio) at most 5 in star networks. A variant of LS for calls with unit durations is shown to have performance ratio at most 2 2 3 . In tree networks with n nodes, a variant of LS for calls with unit durations has performance ratio at most 6, and a variant for calls with arbitrary d...
Complexity Theoretical Results for Randomized Branching Programs
, 1998
"... This work is settled in the area of complexity theory for restricted variants of branching programs. Today, branching programs can be considered one of the standard nonuniform models of computation. One reason for their popularity is that they allow to describe computations in an intuitively straigh ..."
Abstract

Cited by 9 (8 self)
 Add to MetaCart
This work is settled in the area of complexity theory for restricted variants of branching programs. Today, branching programs can be considered one of the standard nonuniform models of computation. One reason for their popularity is that they allow to describe computations in an intuitively straightforward way and promise to be easier to analyze than the traditional models. In complexity theory, we are mainly interested in upper and lower bounds on the size of branching programs. Although proving superpolynomial lower bounds on the size of general branching programs still remains a challenging open problem, there has been considerable success in the study of lower bound techniques for various restricted variants, most notably perhaps readonce branching programs and OBDDs (ordered binary decision diagrams). Surprisingly, OBDDs have also turned out to be extremely useful in practical applications as a data structure for Boolean functions. So far, research has concentrated on determinis...
Approximation Algorithms for Survivable Optical Networks (Extended Abstract)
 In The 14th international Symposium on Distributed Computing (DISC
, 2000
"... ) T. Eilam S. Moran S. Zaks Department of Computer Science The Technion Haifa 32000, Israel email: feilam,moran,zaksg@cs.technion.ac.il We are motivated by the developments in alloptical networks  a new technology that supports high bandwidth demands. These networks provide a set of lightpa ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
) T. Eilam S. Moran S. Zaks Department of Computer Science The Technion Haifa 32000, Israel email: feilam,moran,zaksg@cs.technion.ac.il We are motivated by the developments in alloptical networks  a new technology that supports high bandwidth demands. These networks provide a set of lightpaths which can be seen as highbandwidth pipes on which communication is performed. Since the capacity enabled by this technology substantially exceeds the one provided by conventional networks, its ability to recover from failures within the optical layer is important. In this paper we study the design of a survivable optical layer. We assume that an initial set of lightpaths (designed according to the expected communication pattern) is given, and we are targeted at augmenting this initial set with additional lightpaths such that the result will guarantee survivability. For this purpose, we define and motivate a ring partition survivability condition that the solution must satisfy. Generally...
Factorizations of the ThompsonHigman groups, and circuit complexity
 Preprint: Mathematics ArXiv, math.GR/0607349
, 2008
"... ..."
On the Relations Between Dynamical Systems and Boolean Circuits
, 1993
"... We study the computational capabilities of dynamical systems defined by iterated functions on [0, 1]^n. The computations are performed with infinite precision on arbitrary real numbers, like in the model of analog computation recently proposed by Hava Siegelmann and Eduardo Sontag. We concentrate ma ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We study the computational capabilities of dynamical systems defined by iterated functions on [0, 1]^n. The computations are performed with infinite precision on arbitrary real numbers, like in the model of analog computation recently proposed by Hava Siegelmann and Eduardo Sontag. We concentrate mainly on the lowdimensional case and on the relations with the BlumShubSmale model of computation over the real numbers.
Aviv: A Retargetable Code Generator for Embedded Processors
, 1999
"... Embedded systems are broadly defined as systems designed for a particular application. The functionality of an embedded system is divided into hardware and software components. Synthesis of the hardware component involves designing a custom circuit for the hardware portion of the input application. ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Embedded systems are broadly defined as systems designed for a particular application. The functionality of an embedded system is divided into hardware and software components. Synthesis of the hardware component involves designing a custom circuit for the hardware portion of the input application. Synthesis of the software component consists of designing a processor that is suited for the software portion of the input application and generating code that implements the functionality of the software component on the designed processor. Short design cycles and increasing embedded system complexity make it impractical to perform manual processor architecture exploration and code generation. In order to effectively explore the design space for the software component of embedded systems, a retargetable code generator is required. This thesis presents the Aviv retargetable code generator that generates optimized machine code for a specified target processor. Aviv is capable of compiling ap...
SEMANTICS FOR MULTIRATE FAUST
"... Abstract. Faust is a functional programming language dedicated to the specification of executable monorate musical applications. We present here a multirate extension of the core of the Faust language, called MR Faust, together with a typing semantics, a denotational semantics and correctness theore ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. Faust is a functional programming language dedicated to the specification of executable monorate musical applications. We present here a multirate extension of the core of the Faust language, called MR Faust, together with a typing semantics, a denotational semantics and correctness theorems that link them together. 1.