Publication | Date of Publication | Type |
---|
Fast Parallel Algorithm for Prefix Computation in Multi-Mesh Architecture | 2022-07-04 | Paper |
Fast parallel algorithms for binary multiplication and their implementation on systolic architectures | 2018-09-14 | Paper |
A new network topology with multiple meshes | 2018-07-09 | Paper |
High-Performance Hardware Implementation for RC4 Stream Cipher | 2017-07-12 | Paper |
https://portal.mardi4nfdi.de/entity/Q2998615 | 2011-05-18 | Paper |
One Byte per Clock: A Novel RC4 Hardware | 2010-12-07 | Paper |
On the distribution of runs of ones in binary strings | 2010-06-28 | Paper |
Channel Assignment in Multimedia Cellular Networks | 2008-03-06 | Paper |
Efficient algorithm for placing a given number of base stations to cover a convex region | 2007-01-09 | Paper |
Distributed Computing – IWDC 2005 | 2006-10-10 | Paper |
Distributed Computing – IWDC 2005 | 2006-10-10 | Paper |
A New Approach to Efficient Channel Assignment for Hexagonal Cellular Networks | 2005-10-19 | Paper |
Euro-Par 2004 Parallel Processing | 2005-08-23 | Paper |
Distributed Computing - IWDC 2004 | 2005-08-12 | Paper |
Distributed Computing - IWDC 2004 | 2005-08-12 | Paper |
A new family of bridged and twisted hypercubes | 2003-10-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q4417475 | 2003-07-29 | Paper |
https://portal.mardi4nfdi.de/entity/Q4414574 | 2003-07-25 | Paper |
Parallel prefix computation on extended multi-mesh network. | 2003-01-21 | Paper |
A simple \(O(\log N)\) time parallel algorithm for testing isomorphism of maximal outerplanar graphs | 1999-05-11 | Paper |
Fast parallel algorithms for Graeffe's root squaring technique | 1999-03-22 | Paper |
A family of network topologies with multiple loops and logarithmic diameter | 1998-07-23 | Paper |
Fast parallel algorithms for forecasting | 1998-01-21 | Paper |
A new topology with odd degree for multiprocessor systems. | 1997-08-07 | Paper |
https://portal.mardi4nfdi.de/entity/Q4893347 | 1996-11-20 | Paper |
Fast parallel algorithm for polynomial interpolation | 1995-08-15 | Paper |
Implementation of four common functions on an LNS co-processor | 1995-01-01 | Paper |
Fault-tolerant routing in distributed loop networks | 1995-01-01 | Paper |
Geometric classification of triangulations and their enumeration in a convex polygon | 1994-09-15 | Paper |
An extensible fault-tolerant network architecture | 1994-08-22 | Paper |
A lower bound for the worst case of bottom-up-heapsort | 1993-05-16 | Paper |
Hamiltonian graphs with minimum number of edges for fault-tolerant topologies | 1993-01-17 | Paper |
Reliability analysis of networks using stochastic model | 1992-09-27 | Paper |
Properties of a class of trivalent network graphs and optimal routing | 1992-06-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q3735728 | 1986-01-01 | Paper |
A Parallel Algorithm to Compute the Shortest Paths and Diameter of a Graph and Its VLSI Implementation | 1986-01-01 | Paper |
On the Numerical Complexity of Short-Circuit Faults in Logic Networks | 1985-01-01 | Paper |
A new approach to program verification | 1984-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3343427 | 1984-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3481706 | 1984-01-01 | Paper |
A simple way to near minimization of microprogram control memory | 1983-01-01 | Paper |
Impossible pair constrained test path generation in a program | 1982-01-01 | Paper |
A new algorithm to compute vertex cutsets in a graph | 1981-01-01 | Paper |
A new method to find out the chromatic partition of a symmetric graph | 1978-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4138757 | 1976-01-01 | Paper |