Shimon Even

From MaRDI portal
Person:699817

Available identifiers

zbMath Open even.shimonWikidataQ2910773 ScholiaQ2910773MaRDI QIDQ699817

List of research outcomes

PublicationDate of PublicationType
On mixed connectivity certificates2023-05-08Paper
On the Power of Cascade Ciphers2022-01-08Paper
Graph Algorithms2012-01-06Paper
https://portal.mardi4nfdi.de/entity/Q48289552004-11-29Paper
Traversing Directed Eulerian Mazes2003-06-23Paper
Laying out the interconnection network of the transpose bijection2002-09-25Paper
https://portal.mardi4nfdi.de/entity/Q27666682002-07-22Paper
Area efficient layouts of the Batcher sorting networks2002-07-01Paper
https://portal.mardi4nfdi.de/entity/Q45191302001-11-06Paper
On mixed connectivity certificates1999-01-12Paper
A tight layout of the butterfly network1998-09-27Paper
Monochromatic Paths and Triangulated Graphs1998-09-21Paper
Computing with Snakes in Directed Networks of Automata1998-02-04Paper
The use of a synchronizer yields the maximum computation rate in distributed networks1997-09-28Paper
https://portal.mardi4nfdi.de/entity/Q43472761997-08-07Paper
A construction of a cipher from a single pseudorandom permutation.1997-01-01Paper
On-line/off-line digital signatures1996-08-20Paper
https://portal.mardi4nfdi.de/entity/Q48584401996-02-06Paper
Unison, canon, and sluggish clocks in networks controlled by a synchronizer1995-10-09Paper
https://portal.mardi4nfdi.de/entity/Q43140291994-11-30Paper
On the capabilities of systolic systems1994-10-31Paper
https://portal.mardi4nfdi.de/entity/Q42796081994-02-17Paper
https://portal.mardi4nfdi.de/entity/Q42063831990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37315121986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36792321985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36951761985-01-01Paper
Hard-core theorems for complexity classes1985-01-01Paper
The complexity of promise problems with applications to public-key cryptography1984-01-01Paper
DES-like functions can generate the alternating group1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33256251983-01-01Paper
On the Security of Ping-Pong Protocols1983-01-01Paper
On the security of ping-pong protocols1982-01-01Paper
A note on deterministic and nondeterministic time complexity1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39024791981-01-01Paper
An On-Line Edge-Deletion Problem1981-01-01Paper
Linear Algorithm for Data Compression via String Matching1981-01-01Paper
The minimum-length generator sequence problem is NP-hard1981-01-01Paper
Cryptocomplexity and NP-completeness1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38835241979-01-01Paper
Economical encoding of commas between strings1978-01-01Paper
Computing an st-numbering1976-01-01Paper
A Combinatorial Problem Which Is Complete in Polynomial Space1976-01-01Paper
On the Complexity of Timetable and Multicommodity Flow Problems1976-01-01Paper
An Algorithm for Determining Whether the Connectivity of a Graph is at Leastk1975-01-01Paper
Network Flow and Testing Graph Connectivity1975-01-01Paper
Parallelism in tape-sorting1974-01-01Paper
An algorithm for optimal prefix parsing of a noiseless and memoryless channel1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56726511973-01-01Paper
Generation and enumeration of all solutions of the characteristic sum condition1972-01-01Paper
Permutation Graphs and Transitive Graphs1972-01-01Paper
Marked directed graphs1971-01-01Paper
Transitive Orientation of Graphs and Identification of Permutation Graphs1971-01-01Paper
Ambiguity in Graphs and Expressions1971-01-01Paper
The Stability of Counting Sequences Under Stage Delays1971-01-01Paper
Minimizing the Number of Operations in Certain Discrete-Variable Optimization Problems1970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55891291970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40474601969-01-01Paper
A Gray Code Counter1969-01-01Paper
The Design of Shift Register Generators for Finite Sequences1969-01-01Paper
Sequential Boolean Equations1969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55960831967-01-01Paper
Comments on the Minimization of Stochastic Machines1965-01-01Paper
On Information Lossless Automata of Finite Order1965-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55968131965-01-01Paper
Test for synchronizability of finite automata and variable length codes1964-01-01Paper
Serial-to-Parallel Transformation of Linear-Feedback Shift-Register Circuits1964-01-01Paper
Tests for unique decipherability1963-01-01Paper
On the Number of Partitionings of a Set of n Distinct Objects1962-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Shimon Even