Hanjo Täubig
Titel
Zitiert von
Zitiert von
Jahr
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
R Jacob, A Richa, C Scheideler, S Schmid, H Täubig
Proceedings of the 28th ACM symposium on Principles of distributed computing …, 2009
792009
PAST: fast structure-based searching in the PDB
H Täubig, A Buchner, J Griebsch
Nucleic acids research 34 (suppl 2), W20-W23, 2006
412006
SKIP+: A Self-Stabilizing Skip Graph
R Jacob, A Richa, C Scheideler, S Schmid, H Täubig
Journal of the ACM (JACM) 61 (6), Article 36, 2014
332014
Computing Cut-Based Hierarchical Decompositions in Almost Linear Time
H Räcke, C Shah, H Täubig
ACM-SIAM Symposium on Discrete Algorithms (SODA'14), 227-238, 2014
282014
Time complexity of distributed topological self-stabilization: The case of graph linearization
D Gall, R Jacob, A Richa, C Scheideler, S Schmid, H Täubig
LATIN 2010: Theoretical Informatics, 294-305, 2010
242010
Acyclic Type-of-Relationship Problems on the Internet
S Kosub, M Maaß, H Täubig
Combinatorial and Algorithmic Aspects of Networking, 98-111, 2006
242006
Acyclic Type-of-Relationship Problems on the Internet
S Kosub, MG Maaß, H Täubig
Technical Report, Technische Universität München, 2006
242006
Connectivity
F Kammer, H Täubig
Network Analysis, 143-177, 2005
242005
Comparing push-and pull-based broadcasting
A Hall, H Täubig
Experimental and Efficient Algorithms, 148-164, 2003
232003
Welfare Maximization in Fractional Hedonic Games
H Aziz, S Gaspers, J Gudmundsson, J Mestre, H Täubig
24th International Joint Conference on Artificial Intelligence (IJCAI'15 …, 2015
212015
The complexity of detecting fixed-density clusters
K Holzapfel, S Kosub, MG Maaß, H Täubig
5th Italian Conference on Algorithms and Complexity (CIAC'03), 201-212, 2003
192003
The Complexity of Detecting Fixed-Density Clusters
K Holzapfel, S Kosub, MG Maaß, H Täubig
Technical Report, Technische Universität München, 2002
192002
A note on the parallel runtime of self-stabilizing graph linearization
D Gall, R Jacob, A Richa, C Scheideler, S Schmid, H Täubig
Theory of Computing Systems 55 (1), 110-135, 2014
172014
Inequalities for the Number of Walks in Graphs
H Täubig, J Weihmann, S Kosub, R Hemmecke, EW Mayr
Algorithmica 66 (4), 804-828, 2013
15*2013
A Method for Fast Approximate Searching of Polypeptide Structures in the PDB.
H Täubig, A Buchner, J Griebsch
German Conference on Bioinformatics (GCB'04), 65-74, 2004
13*2004
Graph connectivity
F Kammer, H Täubig
Technical Report, Technische Universität München, 2004
122004
Matrix power inequalities and the number of walks in graphs
H Täubig, J Weihmann
Discrete Applied Mathematics 176, 122-129, 2013
112013
Combinatorial network abstraction by trees and distances
S Eckhardt, S Kosub, MG Maaß, H Täubig, S Wernicke
Theoretical Computer Science 407 (1), 1-20, 2008
92008
The complexity of detecting fixed-density clusters
K Holzapfel, S Kosub, MG Maaß, H Täubig
Discrete applied mathematics 154 (11), 1547-1562, 2006
92006
Inequalities for the Number of Walks, the Spectral Radius, and the Energy of Graphs
H Täubig, J Weihmann
Technical Report, Technische Universität München, 2012
7*2012
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20