We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...
This paper presents the rst approximation method of the nite-failure set of a logic program by set-based analysis. In a dual view, the method yields a type analysis for programs wi...
Andreas Podelski, Witold Charatonik, Martin Mü...
This paper presents OpenJava, which is a macro system that we have developed for Java. With traditional macro systems designed for non object-oriented languages, it is difficult to...
This paper describes a new sampling-based heuristic for tree search named SAGE and presents an analysis of its performance on the problem of grammar induction. This last work has b...
XML-based databases have become a major area of in database research. Abstractly speaking they can be considered as a resurrection of complexvalue databases using constructors for...
Markus Kirchberg, Faizal Riaz-ud-Din, Klaus-Dieter...