We address graph visualization from the viewpoint of compiler construction. Most data structures in compilers are large, dense graphs such as annotated control flow graph, syntax trees, dependency graphs. Our main focus is the animation and interactive exploration of these graphs. Fast layout heuristics and powerful browsing methods are needed. We give a survey of layout heuristics for general directed and undirected graphs and present the browsing facilities that help to manage large structured graph
We present a simple algorithm deciding the word problem of c. f. languages in O(n^{3}). It decides t...
We design new inference systems for total orderings by applying rewrite techniques to chaining calcu...
In this thesis a range of lattice based spatially explicit models of ecosystems are presented and t...
The paper generalizes results of [B] by formulating their background in categories with a sufficient...
This paper first gives an overview of standard PROLOG indexing and then shows, in a step-by-step man...
This annotation style guide was created by and for the Blinker project at the University of Pennsylv...
In this paper, the concept of Abramov’s method for transferring boundary conditions posed for regula...
This paper deals with a special class of quadratic optimization problems with quadratic constraints,...
sc LiPS (sc Library for sc Parallel sc Systems) is a collection of C functions enabling a programmer...
In this paper we consider three embeddings (one-parametric optimization problems) motivated by penal...
The aim of the present paper is to extent the well known fundamental estimates (w.r.t. the $L^2$-nor...
In this work we present the specification and the implementation of a new abstract data type (ADT)...
AbstractThis document is a bibliography on realizability and related matters. It has been collected ...
The paper presents an equivalent characterization of the epi-convergence of lower semicontinuous fun...
We characterise the closure in C∞,(R, R) of the algebra generated by an arbitrary finite point-separ...
We present a simple algorithm deciding the word problem of c. f. languages in O(n^{3}). It decides t...
We design new inference systems for total orderings by applying rewrite techniques to chaining calcu...
In this thesis a range of lattice based spatially explicit models of ecosystems are presented and t...
The paper generalizes results of [B] by formulating their background in categories with a sufficient...
This paper first gives an overview of standard PROLOG indexing and then shows, in a step-by-step man...
This annotation style guide was created by and for the Blinker project at the University of Pennsylv...
In this paper, the concept of Abramov’s method for transferring boundary conditions posed for regula...
This paper deals with a special class of quadratic optimization problems with quadratic constraints,...
sc LiPS (sc Library for sc Parallel sc Systems) is a collection of C functions enabling a programmer...
In this paper we consider three embeddings (one-parametric optimization problems) motivated by penal...
The aim of the present paper is to extent the well known fundamental estimates (w.r.t. the $L^2$-nor...
In this work we present the specification and the implementation of a new abstract data type (ADT)...
AbstractThis document is a bibliography on realizability and related matters. It has been collected ...
The paper presents an equivalent characterization of the epi-convergence of lower semicontinuous fun...
We characterise the closure in C∞,(R, R) of the algebra generated by an arbitrary finite point-separ...
We present a simple algorithm deciding the word problem of c. f. languages in O(n^{3}). It decides t...
We design new inference systems for total orderings by applying rewrite techniques to chaining calcu...
In this thesis a range of lattice based spatially explicit models of ecosystems are presented and t...