SciDok

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

Nr. Titel Autor Jahr Band
1 Android security framework : enabling generic and extensible access control on Android Backes, Michael et al. 2014 2014/01
2 AppGuard — fine-grained policy enforcement for untrusted android applications Backes, Michael et al. 2013 2013/02
3 What’s in it for my BDD? On causal graphs and variable orders in planning Kissmann, Peter et al. 2013 2013/01
4 AppGuard - real-time policy enforcement for third-party applications Backes, Michael et al. 2012 2012/02
5 A remark on nondecidabilities of initial value problems of ODEs Hotz, Günter 2003 2003/01
6 Approximation von Folgen durch berechenbare Folgen : eine neue Variante der Chaitin-Kolmogorov-Komplexität Gärtner, Tobias et al. 2002 2002/01
7 Foresighted graphlayout Diehl, Stefan et al. 2000 2000/02
8 Tagungsband des GI-Workshops Softwarevisualisierung 2000 : 11.-12. Mai 2000, Schloß Dagstuhl 2000 2000/01
9 Berechnung konvexer Hüllen in erwarteter Linearzeit Son, Jung-Bae 1998 1999/04
10 Darstellung von Schaltfunktionen unter Ausnutzung von Symmetrien boolescher Algebren Hotz, Günter 1999 1999/03
11 Pipeline behavior prediction for superscalar processors Schneider, Jörn et al. 1999 1999/02
12 A graph based parsing algorithm for context-free languages Hotz, Günter 1999 1999/01
13 Proceedings of the Workshop on Principles of Abstract Machines : 19. September, Pisa, Italy 1998 1998/05
14 A parametrized sorting System for a large set of k-bit elements Gamkrelidze, Alexander et al. 1998 1998/04
15 Is electronic cash possible? Schmidt, Max et al. 1998 1998/03
16 Designing correct recursive circuits using semantics-preserving transformations of nets Gamkrelidze, Alexander et al. 1998 1998/02
17 Integer linear programming vs. graph-based methods in code generation Kästner, Daniel et al. 1998 1998/01
18 Algorithmische Informationstheorie Teil 1 : Vorlesung an der Universität des Saarlandes WS 1996/97 Hotz, Guenter 1997 1997/01
19 LEX : a case study in development and validation of formal specifications Heckler, Andreas Ramses et al. 1996 1996/06
20 Ein neues Konzept zur Realisierung von Software-Kopierschutz Kiefer, Klaus 1996 1996/05
21 Efficient and precise sharing domains for logic programs Fecht, Christian 1996 1996/04
22 Layout of compound directed graphs Sander, Georg 1996 1996/03
23 Data partitioning and load balancing in parallel disk systems Scheuermann, Peter et al. 1996 1996/02
24 Graph layout for applications in compiler construction Sander, Georg 1996 1996/01
25 Generating analyzers with PAG Alt, Martin et al. 1995 1995/10
26 Spaces of valuations Heckmann, Reinhold 1995 1995/09
27 Heuristic motion planning with many degrees of freedom Chadzelek, Thomas et al. 1995 1995/08
28 Formula layout Heckmann, Reinhold et al. 1995 1995/07
29 Randomized search trees Seidel, Raimund et al. 1995 1995/06
30 Heuristische Bewegungsplanungsstrategien im IR^3 Eckstein, Jens et al. 1995 1995/05
31 Full abstraction for the second order subset of an ALGOL-like language Sieber, Kurt 1995 1995/04
32 Automatic generation of a compiler and an abstract machine for action notation Diehl, Stephan 1995 1995/03
33 Transformations of evolving algebras Diehl, Stephan 1995 1995/02
34 VCG - visualization of compiler graphs Sander, Georg 1995 1995/01
35 New lower bounds for Hopcroft´s problem Erickson, Jeff 1994 1994/04
36 Graph layout through the VCG tool Sander, Georg 1994 1994/03
37 An abstract machine for an object-oriented language with top-level classes Böschen, Christoph et al. 1994 1994/02
38 Full abstraction for the second order subset of an ALGOL-like language (preliminary report) Sieber, Kurt 1994 1994/01
39 SOLL-Spezifikation aus Sicht der Sicherheit Grosse, Malte et al. 1993 1993/07
40 HDMS-A und OBSCURE in KORSO : die Funktionale Essenz von HDMS-A aus Sicht der algorithmischen Spezifikationsmethode ; Teil 3: Spezifikation der atomaren Funktionen Benzmüller, Christoph 1993 1993/06
41 HDMS-A und OBSCURE in KORSO : die Funktionale Essenz von HDMS-A aus Sicht der algorithmischen Spezifikationsmethode ; Teil 2: Schablonen zur Übersetzung eines E/R-Schemas in eine OBSCURE Spezifikation Autexier, Serge 1993 1993/05
42 HDMS--A und OBSCURE in KORSO --- Die Funktionale Essenz von HDMS-A aus Sicht der algorithmischen Spezifikationsmethode --- TEIL 1: Einführung und Anmerkungen Heckler, Ramses A. 1993 1993/04
43 Leistungssteigerung ereignisgesteuerter Simulation durch Multi-Mikro-Rechnersysteme Mattern, Friedemann et al. 1993 1993/03
44 Principal types for object-oriented languages Hense, Andreas V. et al. 1993 1993/02
45 Generation of distributed supervisors for parallel compilers Alt, Martin et al. 1993 1993/01
46 A verification of extensible record types Hense, Andreas V. et al. 1992 1992/03
47 Primality testing Buchmann, Johannes et al. 1992 1992/02
48 Tree grammars with multilinear interpretation Guan, Yonggang et al. 1992 1992/01
49 An O´small interpreter based on denotational semantics Hense, Andreas V. 1991 1991/07
50 Type inference for O´small Hense, Andreas V. 1991 1991/06
51 Über die relativistische Struktur logischer Zeit in verteilten Systemen Mattern, Friedemann 1991 1991/05
52 Distributed control algorithms : (selected topics) Mattern, Friedemann 1991 1991/04
53 The OBSCURE manual. - Part I: Editing and rapid prototyping Fuchs, Jürgen et al. 1991 1991/03
54 Ein Arbeitsplatz zum rechnerunterstützten handschriftlichen Rechnen mit mathematischen Formeln Marzinkewitsch, Reiner 1991 1991/02
55 First order data types and first order logic Treinen, Ralf 1991 1991/01
56 A lower bound for the worst case of bottom-up-heapsort Fleischer, Rudolf et al. 1990 1990/23
57 Using persistent data structures for adding range restrictions to searching problems Lenhof, Hans-Peter et al. 1990 1990/22
58 Approximate algorithms for approximate congruence Schirra, Stefan 1990 1990/21
59 Polymorphic type inference for a simple object oriented programming language with state Hense, Andreas V. 1990 1990/20
60 OBSCURE, a specification language for abstract data types Lehmann, Thomas et al. 1990 1990/19
61 LEDA user manual : version 2.0 Näher, Stefan 1990 1990/17
62 Power domain constructions Heckmann, Reinhold 1990 1990/16
63 Dynamic data structures on multiple storage media, a tutorial Smid, Michiel et al. 1990 1990/15
64 Wrapper semantics of an object oriented programming language with state Hense, Andreas V. 1990 1990/14
65 Maintaining the minimal distance of a point set in polylogarithmic time Smid, Michiel 1990 1990/13
66 Denotational semantics of an object oriented programming language with explicit wrappers Hense, Andreas V. 1991 1990/11
67 Complexity issues in discrete neurocomputing Wiedermann, Juraj 1990 1990/10
68 A new method for undecidability proofs of first order theories Treinen, Ralf 1990 1990/09
69 Neue Algorithmen für das Maximum-Flow-Problem Hagerup, Torben 1990 1990/08
70 Can a maximum flow be computed in o(nm) time? Cheriyan, Joseph et al. 1990 1990/07
71 Maintaining the minimal distance of a point set in less than linear time Smid, Michiel 1990 1990/06
72 The reconstruction problem for dynamic data structures, an overview Smid, Michiel 1990 1990/05
73 An OPTRAN-generated front-end for Ada Keller, Paul et al. 1990 1990/04
74 A worst-case algorithm for semi-online updates on decomposable problems Smid, Michiel 1990 1990/03
75 Hidden line elimination for isooriented rectangles Mehlhorn, Kurt et al. 1990 1990/02
76 The denotational semantics of an object oriented programming language Hense, Andreas V. 1990 1990/01
77 OBSCURE : eine Spezifikations- und Verifikationsumgebung Loeckx, Jacques 1989 1989/06
78 LEDA : a library of efficient data types and algorithms Mehlhorn, Kurt et al. 1989 1989/04
79 On the construction of abstract Voronoi diagrams, II Klein, Rolf et al. 1989 1989/03
80 Data structures Mehlhorn, Kurt et al. 1989 1989/02
81 On the construction of abstract Voronoi diagrams Mehlhorn, Kurt et al. 1989 1989/01
82 Dynamic deferred data structuring Ching, Y. T. et al. 1988 1988/05
83 Faster algorithms for the shortest path problem Ahuja, Ravindra K. et al. 1988 1988/04
84 Constructive Hopf´s theorem : or how to untangle closed planar curves Mehlhorn, Kurt et al. 1988 1988/01
85 Notes on TRAFOLA, III : semantics of patterns Heckmann, Reinhold 1987 1987/09
86 Notes on TRAFOLA, II : the objects of the transformation language and the operations upon them Heckmann, Reinhold 1987 1987/08
87 The specification language of OBSCURE Lehmann, Thomas et al. 1987 1987/07
88 OBSCURE : a specification environment for abstract data types Lehmann, Thomas et al. 1987 1987/06
89 Congruence, similarity and symmetries of geometric objects Alt, Helmut et al. 1987 1987/02
90 Attribute (re)evaluation in OPTRAN Lipps, Peter et al. 1987 1987/01
91 Two tree pattern matchers for code selection : (including targeting) Weisgerber, Beatrix et al. 1986 1986/09
92 A lower bound for the complexity of the union-split-find problem Mehlhorn, Kurt et al. 1986 1986/07
93 Dynamic fractional cascading Mehlhorn, Kurt et al. 1986 1986/06
94 Manual for the ELL (2) - parser generator and tree generator generator Heckmann, Reinhold 1986 1986/05
95 Grammar flow analysis Möncke, Ulrich R. 1986 1986/04
96 New algorithms for shortest paths avoiding convex polygonal obstacles Rohnert, Hans 1986 1986/02
97 Iterative monoide Marzinkewitsch, Reiner 1985 1985/18
98 A formal description of the specification language OBSCURE Loeckx, Jacques 1985 1985/15
99 OBSCURE : an interactive specification language for model-oriented specification methods (extended abstract) Lermen, Claus-Werner et al. 1985 1985/12
100 Ein logisch-topologischer Kalkül zur Konstruktion von integrierten Schaltkreisen Hotz, Günter et al. 1985 1985/10
101 Report on the 5th International Workshop on the Semantics of Programming Languages in Bad Honnef : March 11-15, 1985 1985 1985/09
102 The algorithmic specification method of abstract data types : an overview Loeckx, Jacques 1985 1985/07

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