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
Hilfe
Suche: Author="Mairson, Harry"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
From Hilbert spaces to Dilbert spaces: Context semantics made simple
Harry G. Mairson
Lecture Notes in Computer Science
2556
, 2002, pp. 2-17
Parallel beta reduction is not elementary recursive
Andrea Asperti
,
Harry G. Mairson
Information and Computation
170
(1), 2001, pp. 49-80
Database query languages embedded in the typed lambda calculus
Gerd G. Hillebrand
,
Paris C. Kanellakis
,
Harry G. Mairson
Information and Computation
127
(2), 1996, pp. 117-144
An analysis of the Core-ML language: Expressive power and type reconstruction
Paris C. Kanellakis
,
Gerd G. Hillebrand
,
Harry G. Mairson
Lecture Notes in Computer Science
820
, 1994, pp. 83-105
Generating words in a context-free language uniformly at random
Harry G. Mairson
Information Processing Letters
49
, 1994, pp. 95-99
Undecidable optimization problems for database logic programs
Haim Gaifman
,
Harry Mairson
,
Yehoshua Sagiv
,
Moshe Y. Vardi
Journal of the ACM
40
(3), 1993, July, pp. 683-713
A simple proof of a theorem of Statman
Harry G. Mairson
Theoretical Computer Science
103
, 1992, pp. 387-394
Average case lower bounds on the construction and searching of partial orders
Harry Mairson
misc
The program complexity of searching a table
Harry Mairson
misc