| Publication | Date of Publication | Type |
|---|
| The forgotten scientists: Margaret Hamilton, Moon missions, mathematics and programming | 2024-03-19 | Paper |
Literal Selection in Switching Lattice Design
Advanced Boolean Techniques | 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
Information Processing Letters | 2020-08-04 | Paper |
Gathering in dynamic rings
Theoretical Computer Science | 2020-02-13 | Paper |
| Compacting and grouping mobile agents on dynamic rings | 2019-10-15 | Paper |
| scientific article; zbMATH DE number 6988797 (Why is no real title available?) | 2018-12-04 | Paper |
On a new Boolean function with applications
IEEE Transactions on Computers | 2018-07-09 | Paper |
Gathering in dynamic rings
Structural Information and Communication Complexity | 2018-04-12 | Paper |
Lower bounds on the rotation distance of binary trees
Information Processing Letters | 2017-11-03 | Paper |
Distributed Minimum Spanning Tree Maintenance for Transient Node Failures
IEEE Transactions on Computers | 2017-07-12 | Paper |
More agents may decrease global work: a case in butterfly decontamination
Theoretical Computer Science | 2016-11-29 | Paper |
An insight on PRAM computational bounds
Information Processing Letters | 2016-05-26 | Paper |
Network decontamination under \(m\)-immunity
Discrete Applied Mathematics | 2016-02-04 | Paper |
Getting close without touching: near-gathering for autonomous mobile robots
Distributed Computing | 2015-10-20 | Paper |
Compact DSOP and partial DSOP forms
Theory of Computing Systems | 2013-12-02 | Paper |
Optimal network decontamination with threshold immunity
Lecture Notes in Computer Science | 2013-06-07 | Paper |
Linear time distributed swap edge algorithms
Lecture Notes in Computer Science | 2013-06-07 | Paper |
Chain rotations: a new look at tree distance
Information Processing Letters | 2013-03-20 | Paper |
Computing all the best swap edges distributively
Journal of Parallel and Distributed Computing | 2012-07-26 | Paper |
| Mathematical and algorithmic foundations of the internet. | 2011-01-07 | Paper |
The Fermat star of binary trees
Information Processing Letters | 2010-08-16 | Paper |
\(k\)-restricted rotation distance between binary trees
Information Processing Letters | 2010-01-29 | Paper |
On formal descriptions for knitting recursive patterns
Journal of Mathematics and the Arts | 2008-11-25 | Paper |
Synthesis of autosymmetric functions in a new three-level form
Theory of Computing Systems | 2008-06-06 | Paper |
| Bottom-up subtree isomorphism for unordered labeled trees | 2008-02-15 | Paper |
Web Marshals Fighting Curly Link Farms
Lecture Notes in Computer Science | 2007-11-15 | Paper |
Knitting for Fun: A Recursive Sweater
Lecture Notes in Computer Science | 2007-11-15 | Paper |
Refined upper bounds for right-arm rotation distances
Theoretical Computer Science | 2007-06-06 | Paper |
NETWORK DECONTAMINATION IN PRESENCE OF LOCAL IMMUNITY
International Journal of Foundations of Computer Science | 2007-06-05 | Paper |
Dense trees: a new look at degenerate graphs
Journal of Discrete Algorithms | 2006-10-31 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
Exploiting regularities for Boolean function synthesis
Theory of Computing Systems | 2006-10-25 | Paper |
Approximate matching for two families of trees
Information and Computation | 2006-10-10 | Paper |
Principles of Distributed Systems
Lecture Notes in Computer Science | 2005-12-15 | Paper |
Preface: Fun with algorithms
Discrete Applied Mathematics | 2005-09-27 | Paper |
Distributed Computing - IWDC 2004
Lecture Notes in Computer Science | 2005-08-12 | Paper |
| scientific article; zbMATH DE number 2163017 (Why is no real title available?) | 2005-04-29 | Paper |
| scientific article; zbMATH DE number 2086215 (Why is no real title available?) | 2004-08-11 | Paper |
Implicit \(B\)-trees: A new data structure for the dictionary problem
Journal of Computer and System Sciences | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2080210 (Why is no real title available?) | 2004-08-04 | Paper |
Dynamic monopolies in tori.
Discrete Applied Mathematics | 2004-03-14 | Paper |
Text sparsification via local maxima.
Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1638646 (Why is no real title available?) | 2001-08-29 | Paper |
| scientific article; zbMATH DE number 1156631 (Why is no real title available?) | 1999-08-10 | Paper |
| scientific article; zbMATH DE number 1185589 (Why is no real title available?) | 1999-02-02 | Paper |
Testing and reconfiguration of VLSI linear arrays
Theoretical Computer Science | 1998-08-13 | Paper |
Computing with time-varying data: Sequential complexity and parallel speed-up
Theory of Computing Systems | 1998-04-20 | Paper |
On testing for catastrophic faults in reconfigurable arrays with arbitrary link redundancy
Integration | 1997-02-27 | Paper |
| scientific article; zbMATH DE number 826058 (Why is no real title available?) | 1996-05-27 | Paper |
Diagonal channel routing with vias at unit distance
Calcolo | 1995-05-10 | Paper |
Efficient construction of catastrophic patterns for VLSI reconfigurable arrays
Integration | 1994-10-04 | Paper |
Counting the number of fault patterns in redundant VLSI arrays
Information Processing Letters | 1994-07-21 | Paper |
A model of sequential computation with Pipelined access to memory
Mathematical Systems Theory | 1994-05-19 | Paper |
| scientific article; zbMATH DE number 434680 (Why is no real title available?) | 1994-01-02 | Paper |
A new model for large memories
Calcolo | 1993-05-24 | Paper |
An efficient algorithm for some tree matching problems
Information Processing Letters | 1992-06-27 | Paper |
| scientific article; zbMATH DE number 4126691 (Why is no real title available?) | 1990-01-01 | Paper |
String matching with weighted errors
Theoretical Computer Science | 1990-01-01 | Paper |
Routing in times square mode
Information Processing Letters | 1990-01-01 | Paper |
On the upper bound on the rotation distance of binary trees
Information Processing Letters | 1989-01-01 | Paper |
A preliminary study of a diagonal channel-routing model
Algorithmica | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 3967925 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3894498 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3896340 (Why is no real title available?) | 1985-01-01 | Paper |
A linear algorithm to determine minimal spanning forests in chain graphs
Information Processing Letters | 1982-01-01 | Paper |
A note on optimal allocation of files in a symmetric and homogeneous network
Information Systems | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3700274 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3655397 (Why is no real title available?) | 1979-01-01 | Paper |
The problem of quasi sorting
Calcolo | 1979-01-01 | Paper |
Height-balanced multiway trees
Information Systems | 1979-01-01 | Paper |
Rebalancing Height Balanced Trees
IEEE Transactions on Computers | 1978-01-01 | Paper |
Power trees
Communications of the ACM | 1978-01-01 | Paper |
On the Height of Height-Balanced Trees
IEEE Transactions on Computers | 1976-01-01 | Paper |
