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="Nock, Richard"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the smallest enclosing information disk
Frank Nielsen
,
Richard Nock
Information Processing Letters
105
(3), 2007, pp. 93-97
Self-improved gaps almost everywhere for the agnostic approximation of monomials
Richard Nock
,
Frank Nielsen
Theoretical Computer Science
377
(1-3), 2007, pp. 139-150
A fast deterministic smallest enclosing disk approximation algorithm
Frank Nielsen
,
Richard Nock
Information Processing Letters
93
(6), 2005, pp. 263-268
On domain-partitioning induction criteria: Worst-case bounds for the worst-case based
Richard Nock
,
Frank Nielsen
Theoretical Computer Science
321
(2-3), 2004, pp. 371-382
Reduced error pruning of branching programs cannot be approximated to within a logarithmic factor
Richard Nock
,
Tapio Elomaa
,
Matti Kääriäinen
Information Processing Letters
87
(2), 2003, pp. 73-78
Complexity in the case against accuracy estimation
Richard Nock
Theoretical Computer Science
301
(1-3), 2003, pp. 143-165
Generalized graph colorability and compressibility of Boolean formulae
Richard Nock
,
Pascal Jappy
,
Jean Sallantin
Lecture Notes in Computer Science
1533
, 1998, pp. 237-246