SciDok

Schriftenreihe: Bericht / A / Fachbereich Angewandte Mathematik und Informatik, Universität des Saarlandes

Nr. Titel Autor Jahr Band
1 Bemerkungen zur Übersetzbarkeit rekursiver in nichtrekursive Unterprogrammstrukturen Kopp, Herbert 1974 A 1974/12
2 Finding a negative cycle in a directed graph Tsakalidis, Athanasios K. 1985 1985/05
3 An efficient ELL (1) - parser generator Heckmann, Reinhold 1985 1985/04
4 Biconnected graph assembly and recognition of DFS trees Hagerup, Torben 1985 1985/03
5 POCO compiler generator : user manual Eulenstein, Michael 1985 1985/02
6 A note on the equational calculus for many-sorted algebras with possibly empty carrier sets Loeckx, Jacques et al. 1985 1985/01
7 New bounds for the longest edge of a tree in a VLSI layout Kaufmann, Michael 1984 1984/14
8 A partial correctness logic for procedures (in an ALGOL-like language) Sieber, Kurt 1984 1984/13
9 Local routing of two-terminal nets is easy (extended abstract) Kaufmann, Michael et al. 1984 1984/12
10 Routing through a generalized switchbox Kaufmann, Michael et al. 1984 1984/11
11 Sorting Jordan sequences in linear time Hoffmann, Kurt et al. 1984 1984/09
12 Algorithms for routing in planar graphs Becker, Michael et al. 1984 1984/07
13 Space sweep solves intersection of two convex polyhedra elegantly Hertel, Stefan et al. 1984 1984/02
14 A representation theorem of infinite dimensional algebras and applications to language theory Hotz, Günter 1983 1983/14
15 Routing through a rectangle Mehlhorn, Kurt et al. 1983 1983/12
16 Granularity of parallel memories Mehlhorn, Kurt et al. 1983 1983/10
17 Abstracts of the talks at the Fourth International Workshop on the Semantics of Programming Languages in Bad Honnef : March 14-18, 1983 1983 1983/07
18 Efficient algorithms for the constraint generation for integrated circuit layout compaction Lengauer, Thomas 1983 1983/06
19 The HILL system : a design environment for the hierarchical specification, compaction, and simulation of integrated circuit layouts Lengauer, Thomas et al. 1983 1983/04
20 VLSI complexity, efficient VLSI algorithms and the HILL design system Lengauer, Thomas et al. 1983 1983/03
21 Four results on the complexity of VLSI computations Lengauer, Thomas et al. 1983 1983/01
22 The communication complexity of VLSI circuits Lengauer, Thomas 1982 1982/14
23 A boolean function requiring 3n network size Blum, Norbert 1982 1982/13
24 Parallelmultiplizierer : schnelle, platzeffiziente Algorithmen - VLSI-gerechte Realisierungen Becker, Bernd 1982 1982/12
25 Smoothsort's behavior on presorted sequences Hertel, Stefan 1982 1982/11
26 Algorithmic specifications : a new specification method for abstract data types Loeckx, Jacques 1981 1981/14
27 A new Hoare-calculs for programs with recursive parameterless procedures Sieber, Kurt 1981 1981/02
28 Some properties of implementations of abstract data types Loeckx, Jacques 1980 1980/14
29 Implementations of abstract data types and their correctness proofs Loeckx, Jacques 1980 1980/13
30 Lower bounds on the efficiency of transforming static data structures into dynamic structures (revised) Mehlhorn, Kurt 1981 1980/05
31 Operationaler Vergleich der Rechner TR 440, Siemens 7.760, VAX11/780 und Modcomp 7870. - 2., überarb. und erw. Aufl. Weck, Gerhard 1980 1980/04
32 Relative completeness of a Hoare-calculus for while-programs Sieber, Kurt 1980 1980/01
33 Monotonie und Galerkin Verfahren bei gewöhnlichen nichtlinearen periodischen Systemen insbesondere unstetige und mehrwertige Taubert, Klaus 1979 1979/25
34 Ghosts in tomography : the null space of the radon transform Louis, Alfred K. 1979 1979/19
35 Picture reconstruction from projections in restricted range Louis, Alfred K. 1979 1979/12
36 Abstracts of the talks at the Second International Workshop on the Semantics of Programming Languages in Bad Honnef : March 19-23, 1979 1979 1979/10
37 Informationssysteme im Bibliotheks- und IuD-Bereich Langendörfer, Horst et al. 1979 1979/05
38 Konzept eines allgemeinen Bibliotheksverbundsystems Langendörfer, Horst et al. 1978 1978/20
39 Codes : unequal probabilities, unequal letter costs Altenkamp, Doris et al. 1978 1978/18
40 On the smoothing property of the Bayes approach to picture reconstruction Natterer, Frank 1978 1978/16
41 Der Text-Editor SB&EDIT : Beschreibung der Version (4.08) ; (Sprachversion 2) Weck, Gerhard 1978 1978/15
42 An efficient algorithm for constructing nearly optimal prefix codes Mehlhorn, Kurt 1978 1978/13
43 Sorting presorted files Mehlhorn, Kurt 1978 1978/12
44 Complexity arguments in algebraic language theory Alt, Helmut et al. 1978 1978/10
45 A calculus for proving properties of while-programs Glasner, Ingrid et al. 1978 1978/09
46 On the average number of rebalancing operations in weight-balanced trees Blum, Norbert et al. 1978 1978/06
47 Semantics of programs in a formal system with partially defined functions Hertel, Joachim 1978 1978/05
48 Arbitrary weight changes in dynamic trees Mehlhorn, Kurt 1978 1978/04
49 Effiziente Algorithmen : ein Beispiel Mehlhorn, Kurt 1978 1978/02
50 Struktur eines integrierten Bibliotheks- und IuD-Informationssystems Langendörfer, Horst et al. 1978 1978-18
51 Network complexity Hotz, Günter et al. 1977 1977/06
52 Top down parsing of macro grammars : (preliminary report) Heydthausen, Manfred et al. 1976 1976/3
53 The exponential storage cost of d-schemes Tindell, Ralph 1976 1976/10
54 An O(n log n) lower bound for the synchronous circuit size of integer multiplication Mehlhorn, Kurt 1976 1976/06
55 Binary search trees: average and worst case behavior Güttler, Rainer et al. 1976 1976/05
56 Dynamic binary search Mehlhorn, Kurt 1976 1976/02
57 A few comments on a correctness proof of a program for the "McCarthy Airline" reservation system Barth, Wolfgang et al. 1976 1976/01
58 Untere Schranken für den Platzbedarf bei der kontext-freien Analyse Alt, Helmut et al. 1975 1975/13
59 Bracket-languages are recognizable in logarithmic space Mehlhorn, Kurt 1975 1975/12
60 Das erweiterte DATAS-System : [Datenstrukturen in assoziativer Speicherung] Weck, Gerhard 1975 1975/11
61 A mathematical approach to program behaviour and look-ahead replacement algorithms Spaniol, Otto 1974 1974/16
62 AHPL - eine hardware-beschreibende Sprache auf APL-Basis Eckert, Rolf 1974 1974/15
63 Definition und Implementierung der Programmiersprache PAL : Ausarbeitung einer Vorbereitung von Fortgeschrittenen-Praktika Peters, Ulrich 1974 1974/14
64 Über die Effizienz von LR(k)-Analysatoren Kopp, Herbert 1974 1974/13
65 On the interpretation of recursive program schemes Nivat, Maurice 1974 1974/09
66 On a theorem of McGowan concerning the most recent property of programs Kandzia, Peter et al. 1974 1974/07
67 Eine Implementierung von DATAS (Dataenstrukturen in assoziativer Speicherung) Encarnação, José L. et al. 1974 1974/01
68 Replacement algorithms basing on generalized models for program behaviour Spaniol, Otto 1973 1973/12
69 Optimale Nachladestrategien für Pufferspeicher unter Berücksichtigung der Programmstruktur Spaniol, Otto 1973 1973/02
70 A bibliography on formal languages and related topics 1972 1972/2
71 Ein Nachtrag zu den Extrapolationsverfahren der numerischen Integration Kandzia, Peter 1972 1972/04
72 On correct procedure parameter transmission in higher programming languages Langmaack, Hans 1972 1972/03
73 A bibliography on formal languages and related topics 1972 1972/02
74 Wittgruppen von symmetrisch bilinearen Gittern über Bewertungsringen Knebusch, Manfred 1971 1971/02
75 Bemerkungen zur Theorie der quadratischen Formen über semilokalen Ringen Knebusch, Manfred 1970 1970/04

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