| Publication | Date of Publication | Type |
|---|
| Computational thinking. First algorithms, then code | 2024-11-08 | Paper |
| Literal Selection in Switching Lattice Design | 2024-01-23 | Paper |
| Computational Thinking | 2018-10-12 | Paper |
| On a new Boolean function with applications | 2018-07-09 | Paper |
| On the Parallel Dynamic Dictionary Matching problem: New results with applications | 2017-12-05 | Paper |
| Lower bounds on the rotation distance of binary trees | 2017-11-03 | Paper |
| Arithmetic for rooted trees | 2017-07-17 | Paper |
| Arithmetic for rooted trees | 2017-03-31 | Paper |
| More agents may decrease global work: a case in butterfly decontamination | 2016-11-29 | Paper |
| An insight on PRAM computational bounds | 2016-05-26 | Paper |
| Network decontamination under \(m\)-immunity | 2016-02-04 | Paper |
| Compact DSOP and partial DSOP forms | 2013-12-02 | Paper |
| Optimal Network Decontamination with Threshold Immunity | 2013-06-07 | Paper |
| Chain rotations: a new look at tree distance | 2013-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3065865 | 2011-01-07 | Paper |
| The Fermat star of binary trees | 2010-08-16 | Paper |
| \(k\)-restricted rotation distance between binary trees | 2010-01-29 | Paper |
| Synthesis of autosymmetric functions in a new three-level form | 2008-06-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5441560 | 2008-02-15 | Paper |
| Web Marshals Fighting Curly Link Farms | 2007-11-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5421617 | 2007-10-24 | Paper |
| Refined upper bounds for right-arm rotation distances | 2007-06-06 | Paper |
| NETWORK DECONTAMINATION IN PRESENCE OF LOCAL IMMUNITY | 2007-06-05 | Paper |
| Dense trees: a new look at degenerate graphs | 2006-10-31 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| Exploiting regularities for Boolean function synthesis | 2006-10-25 | Paper |
| Approximate matching for two families of trees | 2006-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044312 | 2004-08-11 | Paper |
| Dynamic monopolies in tori. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2736343 | 2001-08-29 | Paper |
| Dynamic dictionary matching in external memory | 2000-05-18 | Paper |
| String search in coarse-grained parallel computers | 2000-01-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4390662 | 1999-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3838394 | 1999-02-02 | Paper |
| Computing with time-varying data: Sequential complexity and parallel speed-up | 1998-04-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858444 | 1996-05-27 | Paper |
| Diagonal channel routing with vias at unit distance | 1995-05-10 | Paper |
| A model of sequential computation with Pipelined access to memory | 1994-05-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028886 | 1993-03-28 | Paper |
| Finding all the palindromes in a binary tree in linear time and space | 1993-01-17 | Paper |
| ANALYSIS AND IMPLEMENTATION OF PARALLEL UNIFORM HASHING | 1993-01-16 | Paper |
| An efficient algorithm for some tree matching problems | 1992-06-27 | Paper |
| Analysis of parallel uniform hashing | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4206395 | 1990-01-01 | Paper |
| A new scheme for the deterministic simulation of PRAMs in VLSI | 1990-01-01 | Paper |
| String matching with weighted errors | 1990-01-01 | Paper |
| Routing in times square mode | 1990-01-01 | Paper |
| Simple and efficient string matching with k mismatches | 1989-01-01 | Paper |
| On the upper bound on the rotation distance of binary trees | 1989-01-01 | Paper |
| A preliminary study of a diagonal channel-routing model | 1989-01-01 | Paper |
| A probabilistic simulation of PRAMs on a bounded degree network | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3675556 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3314986 | 1984-01-01 | Paper |
| A linear algorithm to determine minimal spanning forests in chain graphs | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3893361 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3854665 | 1979-01-01 | Paper |
| Permutation of data blocks in a bubble memory | 1979-01-01 | Paper |
| The problem of quasi sorting | 1979-01-01 | Paper |
| Rebalancing Height Balanced Trees | 1978-01-01 | Paper |
| Power trees | 1978-01-01 | Paper |
| On the Height of Height-Balanced Trees | 1976-01-01 | Paper |
| A technique for graph embedding with constraints on node and arc correspondences | 1973-01-01 | Paper |
| Some aspects of the recognition of convex polyhedra from two plane projections. II | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5181244 | 1971-01-01 | Paper |
| Some aspects of the recognition of convex polyhedra from two plane projections. I | 1970-01-01 | Paper |
| Extending the Definition of Prime Compatibility Classes of States in Incomplete Sequential Machine Reduction | 1969-01-01 | Paper |
