SciDok

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

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

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