SciDok

Schriftenreihe: Technischer Bericht / A / Fachbereich Informatik, Universität des Saarlandes

Nr. Titel Autor Jahr Band
1 AppGuard — fine-grained policy enforcement for untrusted android applications Backes, Michael et al. 2013 2013/02
2 What’s in it for my BDD? On causal graphs and variable orders in planning Kissmann, Peter et al. 2013 2013/01
3 AppGuard - real-time policy enforcement for third-party applications Backes, Michael et al. 2012 2012/02
4 A remark on nondecidabilities of initial value problems of ODEs Hotz, Günter 2003 2003/01
5 Approximation von Folgen durch berechenbare Folgen : eine neue Variante der Chaitin-Kolmogorov-Komplexität Gärtner, Tobias et al. 2002 2002/01
6 Tagungsband des GI-Workshops Softwarevisualisierung 2000 : 11.-12. Mai 2000, Schloß Dagstuhl 2000 2000/01
7 Darstellung von Schaltfunktionen unter Ausnutzung von Symmetrien boolescher Algebren Hotz, Günter 1999 1999/03
8 A graph based parsing algorithm for context-free languages Hotz, Günter 1999 1999/01
9 Proceedings of the Workshop on Principles of Abstract Machines : 19. September, Pisa, Italy 1998 1998/05
10 Designing correct recursive circuits using semantics-preserving transformations of nets Gamkrelidze, Alexander et al. 1998 1998/02
11 Generating analyzers with PAG Alt, Martin et al. 1995 1995/10
12 Randomized search trees Seidel, Raimund et al. 1995 1995/06
13 New lower bounds for Hopcroft´s problem Erickson, Jeff 1994 1994/04
14 An abstract machine for an object-oriented language with top-level classes Böschen, Christoph et al. 1994 1994/02
15 SOLL-Spezifikation aus Sicht der Sicherheit Grosse, Malte et al. 1993 1993/07
16 Leistungssteigerung ereignisgesteuerter Simulation durch Multi-Mikro-Rechnersysteme Mattern, Friedemann et al. 1993 1993/03
17 Principal types for object-oriented languages Hense, Andreas V. et al. 1993 1993/02
18 Generation of distributed supervisors for parallel compilers Alt, Martin et al. 1993 1993/01
19 A verification of extensible record types Hense, Andreas V. et al. 1992 1992/03
20 Primality testing Buchmann, Johannes et al. 1992 1992/02
21 Tree grammars with multilinear interpretation Guan, Yonggang et al. 1992 1992/01
22 An O´small interpreter based on denotational semantics Hense, Andreas V. 1991 1991/07
23 Type inference for O´small Hense, Andreas V. 1991 1991/06
24 Über die relativistische Struktur logischer Zeit in verteilten Systemen Mattern, Friedemann 1991 1991/05
25 Distributed control algorithms : (selected topics) Mattern, Friedemann 1991 1991/04
26 The OBSCURE manual. - Part I: Editing and rapid prototyping Fuchs, Jürgen et al. 1991 1991/03
27 Ein Arbeitsplatz zum rechnerunterstützten handschriftlichen Rechnen mit mathematischen Formeln Marzinkewitsch, Reiner 1991 1991/02
28 First order data types and first order logic Treinen, Ralf 1991 1991/01
29 A lower bound for the worst case of bottom-up-heapsort Fleischer, Rudolf et al. 1990 1990/23
30 Using persistent data structures for adding range restrictions to searching problems Lenhof, Hans-Peter et al. 1990 1990/22
31 Approximate algorithms for approximate congruence Schirra, Stefan 1990 1990/21
32 Polymorphic type inference for a simple object oriented programming language with state Hense, Andreas V. 1990 1990/20
33 OBSCURE, a specification language for abstract data types Lehmann, Thomas et al. 1990 1990/19
34 LEDA user manual : version 2.0 Näher, Stefan 1990 1990/17
35 Power domain constructions Heckmann, Reinhold 1990 1990/16
36 Dynamic data structures on multiple storage media, a tutorial Smid, Michiel et al. 1990 1990/15
37 Wrapper semantics of an object oriented programming language with state Hense, Andreas V. 1990 1990/14
38 Maintaining the minimal distance of a point set in polylogarithmic time Smid, Michiel 1990 1990/13
39 Denotational semantics of an object oriented programming language with explicit wrappers Hense, Andreas V. 1991 1990/11
40 Complexity issues in discrete neurocomputing Wiedermann, Juraj 1990 1990/10
41 A new method for undecidability proofs of first order theories Treinen, Ralf 1990 1990/09
42 Neue Algorithmen für das Maximum-Flow-Problem Hagerup, Torben 1990 1990/08
43 Can a maximum flow be computed in o(nm) time? Cheriyan, Joseph et al. 1990 1990/07
44 Maintaining the minimal distance of a point set in less than linear time Smid, Michiel 1990 1990/06
45 The reconstruction problem for dynamic data structures, an overview Smid, Michiel 1990 1990/05
46 An OPTRAN-generated front-end for Ada Keller, Paul et al. 1990 1990/04
47 A worst-case algorithm for semi-online updates on decomposable problems Smid, Michiel 1990 1990/03
48 Hidden line elimination for isooriented rectangles Mehlhorn, Kurt et al. 1990 1990/02
49 The denotational semantics of an object oriented programming language Hense, Andreas V. 1990 1990/01
50 OBSCURE : eine Spezifikations- und Verifikationsumgebung Loeckx, Jacques 1989 1989/06
51 LEDA : a library of efficient data types and algorithms Mehlhorn, Kurt et al. 1989 1989/04
52 On the construction of abstract Voronoi diagrams, II Klein, Rolf et al. 1989 1989/03
53 Data structures Mehlhorn, Kurt et al. 1989 1989/02
54 On the construction of abstract Voronoi diagrams Mehlhorn, Kurt et al. 1989 1989/01
55 Dynamic deferred data structuring Ching, Y. T. et al. 1988 1988/05
56 Faster algorithms for the shortest path problem Ahuja, Ravindra K. et al. 1988 1988/04
57 Constructive Hopf´s theorem : or how to untangle closed planar curves Mehlhorn, Kurt et al. 1988 1988/01
58 Notes on TRAFOLA, III : semantics of patterns Heckmann, Reinhold 1987 1987/09
59 Notes on TRAFOLA, II : the objects of the transformation language and the operations upon them Heckmann, Reinhold 1987 1987/08
60 The specification language of OBSCURE Lehmann, Thomas et al. 1987 1987/07
61 OBSCURE : a specification environment for abstract data types Lehmann, Thomas et al. 1987 1987/06
62 Congruence, similarity and symmetries of geometric objects Alt, Helmut et al. 1987 1987/02
63 Attribute (re)evaluation in OPTRAN Lipps, Peter et al. 1987 1987/01
64 Two tree pattern matchers for code selection : (including targeting) Weisgerber, Beatrix et al. 1986 1986/09
65 A lower bound for the complexity of the union-split-find problem Mehlhorn, Kurt et al. 1986 1986/07
66 Dynamic fractional cascading Mehlhorn, Kurt et al. 1986 1986/06
67 Manual for the ELL (2) - parser generator and tree generator generator Heckmann, Reinhold 1986 1986/05
68 Grammar flow analysis Möncke, Ulrich R. 1986 1986/04
69 New algorithms for shortest paths avoiding convex polygonal obstacles Rohnert, Hans 1986 1986/02
70 Iterative monoide Marzinkewitsch, Reiner 1985 1985/18
71 A formal description of the specification language OBSCURE Loeckx, Jacques 1985 1985/15
72 OBSCURE : an interactive specification language for model-oriented specification methods (extended abstract) Lermen, Claus-Werner et al. 1985 1985/12
73 Ein logisch-topologischer Kalkül zur Konstruktion von integrierten Schaltkreisen Hotz, Günter et al. 1985 1985/10
74 Report on the 5th International Workshop on the Semantics of Programming Languages in Bad Honnef : March 11-15, 1985 1985 1985/09
75 The algorithmic specification method of abstract data types : an overview Loeckx, Jacques 1985 1985/07

Home | Impressum | Über SciDok | Policy | Kontakt | Datenschutzerklärung | English