Publication | Date of Publication | Type |
---|
On mixed connectivity certificates | 2023-05-08 | Paper |
On the Power of Cascade Ciphers | 2022-01-08 | Paper |
Graph Algorithms | 2012-01-06 | Paper |
https://portal.mardi4nfdi.de/entity/Q4828955 | 2004-11-29 | Paper |
Traversing Directed Eulerian Mazes | 2003-06-23 | Paper |
Laying out the interconnection network of the transpose bijection | 2002-09-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q2766668 | 2002-07-22 | Paper |
Area efficient layouts of the Batcher sorting networks | 2002-07-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4519130 | 2001-11-06 | Paper |
On mixed connectivity certificates | 1999-01-12 | Paper |
A tight layout of the butterfly network | 1998-09-27 | Paper |
Monochromatic Paths and Triangulated Graphs | 1998-09-21 | Paper |
Computing with Snakes in Directed Networks of Automata | 1998-02-04 | Paper |
The use of a synchronizer yields the maximum computation rate in distributed networks | 1997-09-28 | Paper |
Layered cross product&mdashA technique to construct interconnection networks | 1997-08-07 | Paper |
A construction of a cipher from a single pseudorandom permutation. | 1997-01-01 | Paper |
On-line/off-line digital signatures | 1996-08-20 | Paper |
https://portal.mardi4nfdi.de/entity/Q4858440 | 1996-02-06 | Paper |
Unison, canon, and sluggish clocks in networks controlled by a synchronizer | 1995-10-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q4314029 | 1994-11-30 | Paper |
On the capabilities of systolic systems | 1994-10-31 | Paper |
https://portal.mardi4nfdi.de/entity/Q4279608 | 1994-02-17 | Paper |
https://portal.mardi4nfdi.de/entity/Q4206383 | 1990-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3731512 | 1986-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3679232 | 1985-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3695176 | 1985-01-01 | Paper |
Hard-core theorems for complexity classes | 1985-01-01 | Paper |
The complexity of promise problems with applications to public-key cryptography | 1984-01-01 | Paper |
DES-like functions can generate the alternating group | 1983-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3325625 | 1983-01-01 | Paper |
On the Security of Ping-Pong Protocols | 1983-01-01 | Paper |
On the security of ping-pong protocols | 1982-01-01 | Paper |
A note on deterministic and nondeterministic time complexity | 1982-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3902479 | 1981-01-01 | Paper |
An On-Line Edge-Deletion Problem | 1981-01-01 | Paper |
Linear Algorithm for Data Compression via String Matching | 1981-01-01 | Paper |
The minimum-length generator sequence problem is NP-hard | 1981-01-01 | Paper |
Cryptocomplexity and NP-completeness | 1980-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3883524 | 1979-01-01 | Paper |
Economical encoding of commas between strings | 1978-01-01 | Paper |
Computing an st-numbering | 1976-01-01 | Paper |
A Combinatorial Problem Which Is Complete in Polynomial Space | 1976-01-01 | Paper |
On the Complexity of Timetable and Multicommodity Flow Problems | 1976-01-01 | Paper |
An Algorithm for Determining Whether the Connectivity of a Graph is at Leastk | 1975-01-01 | Paper |
Network Flow and Testing Graph Connectivity | 1975-01-01 | Paper |
Parallelism in tape-sorting | 1974-01-01 | Paper |
An algorithm for optimal prefix parsing of a noiseless and memoryless channel | 1973-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5672651 | 1973-01-01 | Paper |
Generation and enumeration of all solutions of the characteristic sum condition | 1972-01-01 | Paper |
Permutation Graphs and Transitive Graphs | 1972-01-01 | Paper |
Marked directed graphs | 1971-01-01 | Paper |
Transitive Orientation of Graphs and Identification of Permutation Graphs | 1971-01-01 | Paper |
Ambiguity in Graphs and Expressions | 1971-01-01 | Paper |
The Stability of Counting Sequences Under Stage Delays | 1971-01-01 | Paper |
Minimizing the Number of Operations in Certain Discrete-Variable Optimization Problems | 1970-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5589129 | 1970-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4047460 | 1969-01-01 | Paper |
A Gray Code Counter | 1969-01-01 | Paper |
The Design of Shift Register Generators for Finite Sequences | 1969-01-01 | Paper |
Sequential Boolean Equations | 1969-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5596083 | 1967-01-01 | Paper |
Comments on the Minimization of Stochastic Machines | 1965-01-01 | Paper |
On Information Lossless Automata of Finite Order | 1965-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5596813 | 1965-01-01 | Paper |
Test for synchronizability of finite automata and variable length codes | 1964-01-01 | Paper |
Serial-to-Parallel Transformation of Linear-Feedback Shift-Register Circuits | 1964-01-01 | Paper |
Tests for unique decipherability | 1963-01-01 | Paper |
On the Number of Partitionings of a Set of n Distinct Objects | 1962-01-01 | Paper |