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="Ding, Chris"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Definability and transformations for cost logics and automatic structures
Martin Lang
,
Christof Löding
,
Amaldev Manuel
Lecture Notes in Computer Science
8634
, 2014, pp. 390-401
Decidability results on the existence of lookahead delegators for NFA
Christof Löding
,
Stefan Repke
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 327-338
Joint stage recognition and anatomical annotation of drosophila gene expression patterns
Xiao Cai
,
Hua Wang
,
Heng Huang
,
Chris Ding
Bioinformatics
28
(12), 2012, pp. 16-24
Efficient inclusion testing for simple classes of unambiguous
\omega
-automata
Dimitri Isaak
,
Christof Löding
Information Processing Letters
112
(14-15), 2012, pp. 578-582
Regularity problems for weak pushdown
\omega
-automata and games
Christof Löding
,
Stefan Repke
Lecture Notes in Computer Science
7464
, 2012, pp. 764-776
Predicting protein-protein interactions from multimodal biological data sources via nonnegative matrix tri-factorization
Hua Wang
,
Heng Huang
,
Chris Ding
,
Feiping Nie
Lecture Notes in Computer Science
7262
, 2012, pp. 314-325
Function-function correlated multi-label protein function prediction over interaction networks
Hua Wang
,
Heng Huang
,
Chris Ding
Lecture Notes in Computer Science
7262
, 2012, pp. 302-313
On nondeterministic unranked tree automata with sibling constraints
Christof Löding
,
Karianto Wong
Leibniz International Proceedings in Informatics (LIPIcs)
4
, 2009, pp. 311-322
The non-deterministic Mostowski hierarchy and distance-parity automata
Thomas Colcombet
,
Christof Löding
Lecture Notes in Computer Science
5126
, 2008, pp. 398-409
Unranked tree automata with sibling equalities and disequalities
Wong Karianto
,
Christof Löding
Lecture Notes in Computer Science
4596
, 2007, pp. 875-887
Transition graphs of rewriting systems over unranked trees
Christof Löding
,
Alex Spelten
Lecture Notes in Computer Science
4708
, 2007, pp. 67-77
Regularity problems for visibly pushdown languages
Vince Bárány
,
Christof Löding
,
Olivier Serre
Lecture Notes in Computer Science
3884
, 2006, pp. 420-431
A characterization of first-order topological properties of planar spatial data
Michael Benedikt
,
Bart Kuijpers
,
Christof Löding
,
Jan Van den Bussche
,
Thomas Wilke
Journal of the ACM
53
(2), 2006, pp. 273-305
Reachability problems on regular ground tree rewriting graphs
Christof Löding
Theory of Computing Systems
39
(2), 2006, pp. 347-383
PSoL: A positive sample only learning algorithm for finding non-coding RNA genes
Chunlin Wang
,
Chris Ding
,
Richard F. Meraz
,
Stephen R. Holbrook
Bioinformatics
22
(21), 2006, pp. 2590-2596
On the expressiveness of deterministic transducers over infinite trees
Thomas Colcombet
,
Christof Löding
Lecture Notes in Computer Science
2996
, 2004, pp. 428-439
Link analysis: Hubs and authorities on the World Wide Web
Chris H.Q. Ding
,
Hongyuan Zha
,
Xiaofeng He
,
Parry Husbands
,
Horst D. Simon
SIAM Review
46
(2), 2004, pp. 256-268
Visibly pushdown games
Christof Löding
,
P. Madhusudan
,
Olivier Serre
Lecture Notes in Computer Science
3328
, 2004, pp. 408-420
Unsupervised feature selection via two-way ordering in gene expression analysis
Chris H.Q. Ding
Bioinformatics
19
(10), 2003, pp. 1259-1266
Solving the sabotage game is
P
SPACE-hard
Christof Löding
,
Philipp Rohde
Lecture Notes in Computer Science
2747
, 2003, pp. 531-540
Model checking and satisfiability for sabotage modal logic
Christof Löding
,
Philipp Rohde
Lecture Notes in Computer Science
2914
, 2003, pp. 302-313
Analysis of gene expression profiles: Class discovery and leaf ordering
Chris H.Q. Ding
Proceedings of the 6th Annual International Conference on Computational Molecular Biology, RECOMB'2002 (Washington, DC, USA, April 18-21, 2002)
, 2002, pp. 127-136
Ground tree rewriting graphs of bounded tree width
Christof Löding
Lecture Notes in Computer Science
2285
, 2002, pp. 559-570
Multi-class protein fold recognition using support vector machines and neural networks
Chris H.Q. Ding
,
Inna Dubchak
Bioinformatics
17
(4), 2001, pp. 349-358
An optimal index reshuffle algorithm for multidimensional arrays and its applications for parallel architectures
Chris H.Q. Ding
IEEE Transactions on Parallel and Distributed Systems
12
(3), 2001, pp. 306-315
Seiten 1
2
>