Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Mahr, B."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Reliability of probabilistic algorithms and their implementation
C. Lautemann
,
B. Mahr
Applied Computer Science
, 1984, pp. 215-223
Characterizing specification languages which admit initial semantics
B. Mahr
,
J.A. Makowsky
Theoretical Computer Science
31
(1,2), 1984, pp. 49-59
Algebraic implementation of abstract data types (in Fundamental Studies)
H. Ehrig
,
H.-J. Kreowski
,
B. Mahr
,
P. Padawitz
Theoretical Computer Science
20
, 1982, pp. 209-263
Graph grammars as a tool for description in computer processed control: A case study
B. Mahr
,
A. Wilharm
Applied Computer Science
, 1982, pp. 165-176
Complexity of algebraic implementations for abstract data types
H. Ehrig
,
B. Mahr
Journal of Computer and System Sciences
23
(2), 1981, October, pp. 223-253
Compound algebraic implementations: An approach to stepwise refinement of software systems
H. Ehrig
,
H.-J. Kreowski
,
B. Mahr
,
P. Padawitz
Lecture Notes in Computer Science
88
, 1980, pp. 231-245
Complexity of implementations on the level of algebraic specifications
H. Ehrig
,
B. Mahr
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, STOC'80 (Los Angeles, CA, April 28-30, 1980)
, 1980, pp. 281-293
Bounded concatenation theory as a uniform method for proving lower complexity bounds
K. Fleischmann
,
B. Mahr
,
D. Siefkes
Technical Report (CSD-TR-202), 1976, October
GrĂ¼nde, Techniken und Konsequenzen der Verallgemeinerung von Wegealgorithmen
B. Mahr
,
J. Perl
Applied Computer Science
1
, 1975, pp. 131-142