| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6197414 | 2024-03-19 | Paper |
| Literal Selection in Switching Lattice Design | 2024-01-23 | Paper |
| From the Earth to the Moon: two stories of women and mathematics | 2021-09-27 | Paper |
| Linear time distributed swap edge algorithms | 2020-08-04 | Paper |
| Gathering in dynamic rings | 2020-02-13 | Paper |
| Compacting and grouping mobile agents on dynamic rings | 2019-10-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4559858 | 2018-12-04 | Paper |
| On a new Boolean function with applications | 2018-07-09 | Paper |
| Gathering in dynamic rings | 2018-04-12 | Paper |
| Lower bounds on the rotation distance of binary trees | 2017-11-03 | Paper |
| Distributed Minimum Spanning Tree Maintenance for Transient Node Failures | 2017-07-12 | 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 |
| Getting close without touching: near-gathering for autonomous mobile robots | 2015-10-20 | Paper |
| Compact DSOP and partial DSOP forms | 2013-12-02 | Paper |
| Linear Time Distributed Swap Edge Algorithms | 2013-06-07 | Paper |
| Optimal Network Decontamination with Threshold Immunity | 2013-06-07 | Paper |
| Chain rotations: a new look at tree distance | 2013-03-20 | Paper |
| Computing all the best swap edges distributively | 2012-07-26 | 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 |
| On formal descriptions for knitting recursive patterns | 2008-11-25 | 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 |
| Knitting for Fun: A Recursive Sweater | 2007-11-15 | Paper |
| Web Marshals Fighting Curly Link Farms | 2007-11-15 | 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 |
| Exploiting regularities for Boolean function synthesis | 2006-10-25 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| Approximate matching for two families of trees | 2006-10-10 | Paper |
| Principles of Distributed Systems | 2005-12-15 | Paper |
| Preface: Fun with algorithms | 2005-09-27 | Paper |
| Distributed Computing - IWDC 2004 | 2005-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4673402 | 2005-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044312 | 2004-08-11 | Paper |
| Implicit \(B\)-trees: A new data structure for the dictionary problem | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472452 | 2004-08-04 | Paper |
| Dynamic monopolies in tori. | 2004-03-14 | Paper |
| Text sparsification via local maxima. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2736343 | 2001-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4390662 | 1999-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3838394 | 1999-02-02 | Paper |
| Testing and reconfiguration of VLSI linear arrays | 1998-08-13 | Paper |
| Computing with time-varying data: Sequential complexity and parallel speed-up | 1998-04-20 | Paper |
| On testing for catastrophic faults in reconfigurable arrays with arbitrary link redundancy | 1997-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858444 | 1996-05-27 | Paper |
| Diagonal channel routing with vias at unit distance | 1995-05-10 | Paper |
| Efficient construction of catastrophic patterns for VLSI reconfigurable arrays | 1994-10-04 | Paper |
| Counting the number of fault patterns in redundant VLSI arrays | 1994-07-21 | Paper |
| A model of sequential computation with Pipelined access to memory | 1994-05-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3139515 | 1994-01-02 | Paper |
| A new model for large memories | 1993-05-24 | Paper |
| An efficient algorithm for some tree matching problems | 1992-06-27 | Paper |
| String matching with weighted errors | 1990-01-01 | Paper |
| Routing in times square mode | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4206395 | 1990-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 |
| https://portal.mardi4nfdi.de/entity/Q3735087 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3675556 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5186760 | 1985-01-01 | Paper |
| A linear algorithm to determine minimal spanning forests in chain graphs | 1982-01-01 | Paper |
| A note on optimal allocation of files in a symmetric and homogeneous network | 1980-01-01 | Paper |
| The problem of quasi sorting | 1979-01-01 | Paper |
| Height-balanced multiway trees | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3854665 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3893361 | 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 |
