Shimon Even
According to our database^{1},
Shimon Even
authored at least 100 papers
between 1962 and 2012.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at zbmath.org

at id.loc.gov

at isni.org
On csauthors.net:
Bibliography
2012
Graph Algorithms, Second Edition.
Cambridge University Press, ISBN: 9780521736534, 2012
2007
Layout of an Arbitrary Permutation in a Minimal Right Triangle Area.
Journal of Interconnection Networks, 2007
2005
Layout of an Arbitrary Permutation in a Minimal Right Triangle Area.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2005
2003
Layout Area of the Hypercube.
Journal of Interconnection Networks, 2003
A Compact Layout of the Butterfly.
Journal of Interconnection Networks, 2003
2002
Laying Out the Interconnection Network of the Transpose Bijection.
Theory Comput. Syst., 2002
Traversing Directed Eulerian Mazes.
J. Graph Algorithms Appl., 2002
Layout area of the hypercube (extended abstract).
Proceedings of the Thirteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2002
2001
Area efficient layouts of the Batcher sorting networks.
Networks, 2001
2000
Embedding interconnection networks in grids via the layered cross product.
Networks, 2000
Traversing Directed Eulerian Mazes.
Proceedings of the GraphTheoretic Concepts in Computer Science, 2000
1999
Some Compact Layouts of the Butterfly.
Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, 1999
1998
On Mixed Connectivity Certificates.
Theor. Comput. Sci., 1998
Monochromatic Paths and Triangulated Graphs.
SIAM J. Discrete Math., 1998
A Note on Limited Preemption.
Parallel Processing Letters, 1998
A Tight Layout of the Butterfly Network.
Theory Comput. Syst., 1998
Layout of the Batcher Bitonic Sorter (Extended Abstract).
Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures, 1998
1997
Layered cross product  A technique to construct interconnection networks.
Networks, 1997
The Use of a Synchronizer Yields the Maximum Computation Rate in Distributed Networks.
Theory Comput. Syst., 1997
A Construction of a Cipher from a Single Pseudorandom Permutation.
J. Cryptology, 1997
Computing with Snakes in Directed Networks of Automata.
J. Algorithms, 1997
Embedding Interconnection Networks in Grids via the Layered Cross Product.
Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997
1996
OnLine/OffLine Digital Signatures.
J. Cryptology, 1996
A Tight Layout of the Butterfly Network.
Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 1996
1995
Unison, Canon, and Sluggish Clocks in Networks Controlled by a Synchronizer.
Mathematical Systems Theory, 1995
On Mixed Connectivity Certificates (Extended Abstract).
Proceedings of the Algorithms, 1995
1994
On the Capabilities of Systolic Systems.
Mathematical Systems Theory, 1994
Grid Layouts of Block Diagrams  Bounding the Number of Bends in Each Connection.
Proceedings of the Graph Drawing, DIMACS International Workshop, 1994
A Unified Scheme for Routing in Expander Based Networks.
Proceedings of the Algorithms and Complexity, Second Italian Conference, 1994
1992
Layered Cross Product  A Technique to Construct Interconnection Networks.
Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, 1992
1991
On the Capabilities of Systolic Systems (Extended Abstract).
Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, 1991
A Construction of a Cioher From a Single Pseudorandom Permutation.
Proceedings of the Advances in Cryptology, 1991
1990
The Use of a Synchronizer Yields Maximum Computation Rate in Distributed Networks (Extended Abstract)
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990
How to keep a dynamic distributive directed graph acyclic and yet grant all requests of edge additions.
Proceedings of the Next Decade in Information Technology: Proceedings of the 5th Jerusalem Conference on Information Technology 1990, 1990
Computing with Snakes in Directed Networks of Automata (Extended Abstract)
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990
Systolic Modular Multiplication.
Proceedings of the Advances in Cryptology, 1990
1989
On the Number of Rounds Necessary to Disseminate Information.
Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989
OnLine/OffLine Digital Schemes.
Proceedings of the Advances in Cryptology, 1989
1985
HardCore Theorems for Complexity Classes
J. ACM, January, 1985
On the Power of Cascade Ciphers
ACM Trans. Comput. Syst., 1985
A Randomized Protocol for Signing Contracts.
Commun. ACM, 1985
On the Security of PingPong Protocols when Implemented using the RSA.
Proceedings of the Advances in Cryptology, 1985
1984
The Complexity of Promise Problems with Applications to PublicKey Cryptography
Information and Control, May, 1984
Correction to 'DESlike functions can generate the alternating group' (Nov 83 863865).
IEEE Trans. Information Theory, 1984
On the npcompleteness of certain network testing problems.
Networks, 1984
A note on cake cutting.
Discrete Applied Mathematics, 1984
Efficient and Reliable Broadcast is Achievable in an Eventually Connected Network.
Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, 1984
1983
DESlike functions can generate the alternating group.
IEEE Trans. Information Theory, 1983
A LocalRatio Theorem for Approximating the Weighted Vertex Cover Problem.
Proceedings of the WG '83, 1983
Electronic Wallet.
Proceedings of the Advances in Cryptology, 1983
On the Power of Cascade Ciphers.
Proceedings of the Advances in Cryptology, 1983
1982
A Note on Deterministic and Nondeterministic Time Complexity
Information and Control, 1982
On the Security of PingPong Protocols
Information and Control, 1982
On Approximating a Vertex Cover for Planar Graphs
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982
A Randomized Protocol for Signing Contracts.
Proceedings of the Advances in Cryptology: Proceedings of CRYPTO '82, 1982
On the Security of PingPong Protocols.
Proceedings of the Advances in Cryptology: Proceedings of CRYPTO '82, 1982
On the Security of MultiParty PingPong Protocols.
Proceedings of the Advances in Cryptology: Proceedings of CRYPTO '82, 1982
1981
The MinimumLength Generator Sequence Problem is NPHard.
J. Algorithms, 1981
A LinearTime Approximation Algorithm for the Weighted Vertex Cover Problem.
J. Algorithms, 1981
Linear Algorithm for Data Compression via String Matching.
J. ACM, 1981
An OnLine EdgeDeletion Problem.
J. ACM, 1981
On Protocols for Cake Cutting.
Proceedings of the 7th Conference Graphtheoretic Concepts in Computer Science (WG '81), 1981
Protocol for Signing Contracts.
Proceedings of the Advances in Cryptology: A Report on CRYPTO 81, 1981
1980
An Observation Concerning the Complexity of Problems with Few Solutions and its Application to Cryptography.
Proceedings of the Graphtheoretic Concepts in Computer Science, 1980
Cryptocomplexity and NPCompleteness.
Proceedings of the Automata, 1980
1978
Economical Encoding of Commas Between Strings.
Commun. ACM, 1978
The Max Flow of Dinic and Karzanov: An Exposition.
Proceedings of the Information Technology '78: Proceedings of the 3rd Jerusalem Conference on Information Technology (JCIT3), 1978
1977
Corrigendum: Computing an stNumbering. TCS 2(1976):339344.
Theor. Comput. Sci., 1977
1976
Computing an st Numbering.
Theor. Comput. Sci., 1976
On the Complexity of Timetable and Multicommodity Flow Problems.
SIAM J. Comput., 1976
Intersection graphs of curves in the plane.
J. Comb. Theory, Ser. B, 1976
A Combinatorial Problem Which Is Complete in Polynomial Space.
J. ACM, 1976
1975
Network Flow and Testing Graph Connectivity.
SIAM J. Comput., 1975
An Algorithm for Determining Whether the Connectivity of a Graph is at Least k.
SIAM J. Comput., 1975
Efficient Generation of Optimal Prefix Code: Equiprobable Words Using Unequal Cost Letters.
J. ACM, 1975
a Combinatorial Problem which is Complete in Polynomial Space
Proceedings of the 7th Annual ACM Symposium on Theory of Computing, 1975
An O(n^2.5) Algorithm for Maximum Matching in General Graphs
Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975
On the Complexity of Timetable and MultiCommodity Flow Problems
Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975
1974
Parallelism in TapeSorting.
Commun. ACM, 1974
1973
An algorithm for optimal prefix parsing of a noiseless and memoryless channel.
IEEE Trans. Information Theory, 1973
1972
Generation and Enumeration of All Solutions of the Characteristic Sum Condition
Information and Control, December, 1972
Permutation Graphs and Transitive Graphs.
J. ACM, 1972
1971
Ambiguity in Graphs and Expressions.
IEEE Trans. Computers, 1971
Marked Directed Graphs.
J. Comput. Syst. Sci., 1971
1970
Minimizing the Number of Operations in Certain DiscreteVariable Optimization Problems.
Operations Research, 1970
1969
Sequential Boolean Equations.
IEEE Trans. Computers, 1969
A Gray Code Counter.
IEEE Trans. Computers, 1969
The Design of Shift Register Generators for Finite Sequences.
IEEE Trans. Computers, 1969
1967
On Minimal Modulo 2 Sums of Products for Switching Functions.
IEEE Trans. Electronic Computers, 1967
1966
Some further results on synchronizable block codes (Corresp.).
IEEE Trans. Information Theory, 1966
Test for Planarity of a Circuit Given by an Expression.
IEEE Trans. Electronic Computers, 1966
On Minimal Modulo 2 Sums of Products for Switching Functions
Proceedings of the 7th Annual Symposium on Switching and Automata Theory, 1966
1965
Comments on the Minimization of Stochastic Machines.
IEEE Trans. Electronic Computers, 1965
On Information Lossless Automata of Finite Order.
IEEE Trans. Electronic Computers, 1965
Identification and Minimization of Linear Machines.
IEEE Trans. Electronic Computers, 1965
1964
Test for synchronizability of finite automata and variable length codes.
IEEE Trans. Information Theory, 1964
On synchronizable and PSKsynchronizable block codes.
IEEE Trans. Information Theory, 1964
Rational Numbers and Regular Events.
IEEE Trans. Electronic Computers, 1964
1963
Tests for unique decipherability.
IEEE Trans. Information Theory, 1963
1962
Generalized automata and their information losslessness
Proceedings of the 3rd Annual Symposium on Switching Circuit Theory and Logical Design, 1962