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="Jones, Neil"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Flow analysis of lazy higher-order functional programs
Neil D. Jones
,
Nils Andersen
Theoretical Computer Science
375
(1-3), 2007, pp. 120-136
Comparative genomics reveals unusually long motifs in mammalian genomes
Neil C. Jones
,
Pavel A. Pevzner
Bioinformatics
22
(14), 2006, pp. 236-242
Apples to apples: Improving the performance of motif finders and their significance analysis in the Twilight Zone
Patrick Ng
,
Niranjan Nagarajan
,
Neil Jones
,
Uri Keich
Bioinformatics
22
(14), 2006, pp. 393-401
Erratum to ''Computing the
P
-value of the information content from an alignment of multiple sequences''
Niranjan Nagarajan
,
Neil Jones
,
Uri Keich
Bioinformatics
21
(18), 2005, pp. 3700-3700
Computing the
P
-value of the information content from an alignment of multiple sequences
Niranjan Nagarajan
,
Neil Jones
,
Uri Keich
Bioinformatics
21
(S1), 2005, pp. 311-318
De novo identification of repeat families in large genomes
Alkes L. Price
,
Neil C. Jones
,
Pavel A. Pevzner
Bioinformatics
21
(S1), 2005, pp. 351-358
Computational complexity via programming languages: Constant factors do matter
Amir M. Ben-Amram
,
Neil D. Jones
Acta Informatica
37
(2), 2000, pp. 83-120
logspace and ptime characterized by programming languages
Neil D. Jones
Theoretical Computer Science
228
(1-2), 1999, pp. 151-174
Generalizing Cook's transformation to imperative stack programs
Nils Andersen
,
Neil D. Jones
Proceedings of the Colloquium in Honor of Arto Salomaa. Results and Trends in Theoretical Computer Science (Graz, Austria, June 10-11, 1994)
LNCS 812
, 1994, pp. 1-18
Constant time factors do matter(extended matter) (extended abstract)
Neil D. Jones
Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC'93 (San Diego, California, May 16--18, 1993)
, 1993, pp. 602-611
Static semantics, types, and binding time analysis
Neil D. Jones
Theoretical Computer Science
90
, 1991, pp. 95-118
Partial evaluation, self-application and types
Neil D. Jones
Lecture Notes in Computer Science
443
, 1990, pp. 639-659
Flow analysis of lambda expressions
Neil D. Jones
Lecture Notes in Computer Science
115
, 1981, pp. 114-128
Complexity of some problems concerning
L
systems
Neil D. Jones
,
Sven Skyum
Math. Systems Theory
13
, 1979/80, pp. 29-43
Complexity of some problems in Petri nets
Neil D. Jones
,
L.H. Landweber
,
Y.E. Lien
Theoretical Computer Science
4
(3), 1977, pp. 277-299
Recognition of deterministic ETOL languages in logarithmic space
Neil D. Jones
,
Sven Skyum
Information and Control
35
, 1977, pp. 177-181
New problems complete for nondeterministic log space
Neil D. Jones
,
Y. Edmund Lien
,
William T. Laaser
Math. Systems Theory
10
, 1976/77, pp. 1-17
Space-bounded reducibility among combinatorial problems
Neil D. Jones
Journal of Computer and System Sciences
11
, 1975, pp. 68-85
A note on the index of a context-free language
Neil D. Jones
Information and Control
16
, 1970, pp. 201-202
Context-free languages and rudimentary attributes
Neil D. Jones
Math. Systems Theory
3
, 1969, pp. 102-109
Classes of automata and transitive closure
Neil Jones
Information and Control
13
, 1968, pp. 207-229