| Publication | Date of Publication | Type |
|---|
Computational thinking. First algorithms, then code
Undergraduate Topics in Computer Science | 2024-11-08 | Paper |
Literal Selection in Switching Lattice Design
Advanced Boolean Techniques | 2024-01-23 | Paper |
Computational thinking. First algorithms, then code
| 2018-10-12 | Paper |
On a new Boolean function with applications
IEEE Transactions on Computers | 2018-07-09 | Paper |
On the parallel dynamic dictionary matching problem: new results with applications
Algorithms — ESA '96 | 2017-12-05 | Paper |
Lower bounds on the rotation distance of binary trees
Information Processing Letters | 2017-11-03 | Paper |
An arithmetic for rooted trees
| 2017-07-17 | Paper |
Arithmetic for rooted trees
Theory of Computing Systems | 2017-03-31 | 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 |
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 |
Chain rotations: a new look at tree distance
Information Processing Letters | 2013-03-20 | 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 |
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 |
scientific article; zbMATH DE number 5204525 (Why is no real title available?)
| 2007-10-24 | 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 |
scientific article; zbMATH DE number 2086215 (Why is no real title available?)
| 2004-08-11 | Paper |
Dynamic monopolies in tori.
Discrete Applied Mathematics | 2004-03-14 | Paper |
scientific article; zbMATH DE number 1638646 (Why is no real title available?)
| 2001-08-29 | Paper |
Dynamic dictionary matching in external memory
Information and Computation | 2000-05-18 | Paper |
String search in coarse-grained parallel computers
Algorithmica | 2000-01-03 | 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 |
Computing with time-varying data: Sequential complexity and parallel speed-up
Theory of Computing Systems | 1998-04-20 | 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 |
A model of sequential computation with Pipelined access to memory
Mathematical Systems Theory | 1994-05-19 | Paper |
scientific article; zbMATH DE number 140469 (Why is no real title available?)
| 1993-03-28 | Paper |
Finding all the palindromes in a binary tree in linear time and space
Information Processing Letters | 1993-01-17 | Paper |
ANALYSIS AND IMPLEMENTATION OF PARALLEL UNIFORM HASHING
International Journal of Foundations of Computer Science | 1993-01-16 | Paper |
An efficient algorithm for some tree matching problems
Information Processing Letters | 1992-06-27 | Paper |
Analysis of parallel uniform hashing
Information Processing Letters | 1991-01-01 | Paper |
scientific article; zbMATH DE number 4126691 (Why is no real title available?)
| 1990-01-01 | Paper |
A new scheme for the deterministic simulation of PRAMs in VLSI
Algorithmica | 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 |
Simple and efficient string matching with k mismatches
Information Processing Letters | 1989-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 |
A probabilistic simulation of PRAMs on a bounded degree network
Information Processing Letters | 1988-01-01 | Paper |
scientific article; zbMATH DE number 3896340 (Why is no real title available?)
| 1985-01-01 | Paper |
scientific article; zbMATH DE number 3845045 (Why is no real title available?)
| 1984-01-01 | Paper |
A linear algorithm to determine minimal spanning forests in chain graphs
Information Processing Letters | 1982-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 |
Permutation of data blocks in a bubble memory
Communications of the ACM | 1979-01-01 | Paper |
The problem of quasi sorting
Calcolo | 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 |
A technique for graph embedding with constraints on node and arc correspondences
Information Sciences | 1973-01-01 | Paper |
Some aspects of the recognition of convex polyhedra from two plane projections. II
Information Sciences | 1973-01-01 | Paper |
scientific article; zbMATH DE number 3430533 (Why is no real title available?)
| 1971-01-01 | Paper |
Some aspects of the recognition of convex polyhedra from two plane projections. I
Information Sciences | 1970-01-01 | Paper |
Extending the Definition of Prime Compatibility Classes of States in Incomplete Sequential Machine Reduction
IEEE Transactions on Computers | 1969-01-01 | Paper |
