The thesis is that every sequential algorithm, on any level of abstraction, can be viewed as a
sequential abstract state machine [17, 21]. Abstract state machines (ASMS) used to be …

Das zentrale Thema der vorliegenden Dissertation ist das sogenannte Model-Checking
Problem. In seiner einfachsten Form haben wir eine endliche relationale Struktur 2 und …

We define a model of computation, called the Pipelined Hierarchical Random Access
Machine with access function a (x), denoted the a (x)-PH-RAM. In this model, a processor …

The time to perform a random access to main memory has been increasing for decades
relative to processor speed and is currently of the order of a few hundred cycles. To alleviate …

Abstract We use the Abstract State Machine methodology to give formal operational
semantics for the Location Consistency memory model and cache protocol. With these …

Since its introduction close to a decade ago, the problem of efficient mining of association
rules on market-basket data has attracted tremendous attention. Numerous algorithms have …

Integer sorting has always been an important task in connection with the digital computer. A
classic example is the folklore algorithm radix sort, which according to Knuth [28] is …