| Publication | Date of Publication | Type |
|---|
| Hidden community detection on two-layer stochastic models: a theoretical perspective | 2022-12-22 | Paper |
| Isomorphism of planar graphs (working paper) | 2021-07-06 | Paper |
| Foundations of data science | 2021-06-23 | Paper |
| Foundations of Data Science | 2020-02-11 | Paper |
| Nonlinear Dimension Reduction by Local Multidimensional Scaling | 2019-04-26 | Paper |
| Neighbourhood-preserving dimension reduction via localised multidimensional scaling | 2018-06-05 | Paper |
| Correctness of a gossip based membership protocol | 2015-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934697 | 2014-12-18 | Paper |
| Extracting the Core Structure of Social Networks Using (α, β)-Communities | 2013-06-28 | Paper |
| Making the World a Better Place | 2012-07-16 | Paper |
| On the impact of Turing machines | 2012-07-16 | Paper |
| Detecting the Structure of Social Networks Using (α,β)-Communities | 2011-06-08 | Paper |
| Manipulation-resistant reputations using hitting time | 2011-02-28 | Paper |
| Local Computation of PageRank Contributions | 2011-02-28 | Paper |
| Recovering social networks from contagion information | 2010-06-17 | Paper |
| Community structure in large complex networks | 2010-06-17 | Paper |
| On the Stability of Web Crawling and Web Search | 2009-01-29 | Paper |
| Manipulation-Resistant Reputations Using Hitting Time | 2008-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5450093 | 2008-03-19 | Paper |
| Spectral Clustering by Recursive Partitioning | 2008-03-11 | Paper |
| The work of Jon Kleinberg | 2007-10-24 | Paper |
| Finding (Short) Paths in Social Networks | 2007-08-20 | Paper |
| Automata theory: Its past and future | 2002-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4506483 | 2000-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4851834 | 1995-10-12 | Paper |
| A paradigm for robust geometric algorithms | 1992-06-28 | Paper |
| The geometry of projective blending surfaces | 1988-01-01 | Paper |
| Geometric ambiguities in boundary representations | 1987-01-01 | Paper |
| Reducing Multiple Object Motion Planning to Graph Searching | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3786055 | 1986-01-01 | Paper |
| Routing, merging, and sorting on parallel models of computation | 1985-01-01 | Paper |
| Automatic surface generation in computer aided design | 1985-01-01 | Paper |
| On the Movement of Robot Arms in 2-Dimensional Bounded Regions | 1985-01-01 | Paper |
| Decreasing the nesting depth of expressions involving square roots | 1985-01-01 | Paper |
| Movement Problems for 2-Dimensional Linkages | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3948568 | 1983-01-01 | Paper |
| On the Harmonious Coloring of Graphs | 1983-01-01 | Paper |
| On Edge Coloring Bipartite Graphs | 1982-01-01 | Paper |
| Fast parallel matrix and GCD computations | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3929039 | 1981-01-01 | Paper |
| The directed subgraph homeomorphism problem | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3912839 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3862379 | 1979-01-01 | Paper |
| On the reachability problem for 5-dimensional vector addition systems | 1979-01-01 | Paper |
| A note on Rabin's nearest-neighbor algorithm | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4160379 | 1978-01-01 | Paper |
| On Time Versus Space | 1977-01-01 | Paper |
| On Finding Lowest Common Ancestors in Trees | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4065052 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4065051 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4072875 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4066629 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4091421 | 1974-01-01 | Paper |
| Efficient Planarity Testing | 1974-01-01 | Paper |
| Triangular Factorization and Inversion by Fast Matrix Multiplication | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4045961 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778264 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4050139 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778267 | 1974-01-01 | Paper |
| An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs | 1973-01-01 | Paper |
| Dividing a Graph into Triconnected Components | 1973-01-01 | Paper |
| Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms | 1973-01-01 | Paper |
| A V log V algorithm for isomorphism of triconnected planar graphs | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4061956 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4062636 | 1973-01-01 | Paper |
| Set Merging Algorithms | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5666587 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3875946 | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5668808 | 1972-01-01 | Paper |
| On Minimizing the Number of Multiplications Necessary for Matrix Multiplication | 1971-01-01 | Paper |
| An Overview of the Theory of Computational Complexity | 1971-01-01 | Paper |
| \(A\,V^ 2\) algorithm for determining isomorphism of planar graphs | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5639367 | 1971-01-01 | Paper |
| Images of AFL under certain families of homomorphisms | 1971-01-01 | Paper |
| On the computational power of pushdown automata | 1970-01-01 | Paper |
| What makes some language theory problems undecidable | 1970-01-01 | Paper |
| Two-way balloon automata and AFL | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5592246 | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4773298 | 1969-01-01 | Paper |
| On the equivalence and containment problems for context-free languages | 1969-01-01 | Paper |
| Scattered context grammars | 1969-01-01 | Paper |
| A general theory of translation | 1969-01-01 | Paper |
| Some Results on Tape-Bounded Turing Machines | 1969-01-01 | Paper |
| Studies in abstract families of languages | 1969-01-01 | Paper |
| On the equivalence and containment problems for context-free languages | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5590813 | 1969-01-01 | Paper |
| Time and tape complexity of pushdown automaton languages | 1968-01-01 | Paper |
| Relations Between Time and Tape Complexities | 1968-01-01 | Paper |
| Deterministic stack automata and the quotient operator | 1968-01-01 | Paper |
| Decidable and Undecidable Questions About Automata | 1968-01-01 | Paper |
| Sets accepted by one-way stack automata are context sensitive | 1968-01-01 | Paper |
| An Approach to a Unified Theory of Automata | 1967-01-01 | Paper |
| Nonerasing stack automata | 1967-01-01 | Paper |
| Encoding of analog signals for binary symmetric channels | 1966-01-01 | Paper |
| Synthesis of Minimal Threshold Logic Networks | 1965-01-01 | Paper |
