The following pages link to Shimon Even (Q699817):
Displaying 50 items.
- Laying out the interconnection network of the transpose bijection (Q699819) (← links)
- Computing an st-numbering (Q1231771) (← links)
- A tight layout of the butterfly network (Q1265167) (← links)
- On mixed connectivity certificates (Q1274334) (← links)
- (Q1364126) (redirect page) (← links)
- The use of a synchronizer yields the maximum computation rate in distributed networks (Q1364128) (← links)
- A construction of a cipher from a single pseudorandom permutation. (Q1364898) (← links)
- On-line/off-line digital signatures (Q1912770) (← links)
- Marked directed graphs (Q2552879) (← links)
- (Q2766668) (← links)
- Graph Algorithms (Q3105755) (← links)
- DES-like functions can generate the alternating group (Q3323836) (← links)
- On the security of ping-pong protocols (Q3323837) (← links)
- (Q3325625) (← links)
- A note on deterministic and nondeterministic time complexity (Q3331208) (← links)
- On the Security of Ping-Pong Protocols (Q3661462) (← links)
- (Q3679232) (← links)
- (Q3695176) (← links)
- The complexity of promise problems with applications to public-key cryptography (Q3722415) (← links)
- (Q3731512) (← links)
- Hard-core theorems for complexity classes (Q3769964) (← links)
- Tests for unique decipherability (Q3849267) (← links)
- (Q3883524) (← links)
- Cryptocomplexity and NP-completeness (Q3888962) (← links)
- (Q3902479) (← links)
- An On-Line Edge-Deletion Problem (Q3902517) (← links)
- Linear Algorithm for Data Compression via String Matching (Q3912479) (← links)
- The minimum-length generator sequence problem is NP-hard (Q3920644) (← links)
- (Q4047460) (← links)
- An Algorithm for Determining Whether the Connectivity of a Graph is at Least<i>k</i> (Q4068762) (← links)
- Network Flow and Testing Graph Connectivity (Q4094634) (← links)
- A Combinatorial Problem Which Is Complete in Polynomial Space (Q4127387) (← links)
- On the Complexity of Timetable and Multicommodity Flow Problems (Q4132234) (← links)
- Economical encoding of commas between strings (Q4149628) (← links)
- (Q4206383) (← links)
- Monochromatic Paths and Triangulated Graphs (Q4210223) (← links)
- On the capabilities of systolic systems (Q4277374) (← links)
- (Q4279608) (← links)
- (Q4314029) (← links)
- Layered cross product&mdashA technique to construct interconnection networks (Q4347276) (← links)
- Computing with Snakes in Directed Networks of Automata (Q4349702) (← links)
- Parallelism in tape-sorting (Q4401566) (← links)
- Traversing Directed Eulerian Mazes (Q4405605) (← links)
- (Q4519130) (← links)
- Area efficient layouts of the Batcher sorting networks (Q4537608) (← links)
- (Q4828955) (← links)
- Unison, canon, and sluggish clocks in networks controlled by a synchronizer (Q4850331) (← links)
- (Q4858440) (← links)
- On the Power of Cascade Ciphers (Q5019317) (← links)
- Comments on the Minimization of Stochastic Machines (Q5523676) (← links)
