Shimon Even
Affiliations: Weizmann Institute of Science, Israel
According to our database^{1},
Shimon Even
authored at least 91 papers
between 1962 and 2012.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on zbmath.org

on id.loc.gov

on dnb.info

on isni.org
On csauthors.net:
Bibliography
2012
Cambridge University Press, ISBN: 9780521736534, 2012
2007
J. Interconnect. 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
J. Interconnect. Networks, 2003
J. Interconnect. Networks, 2003
2002
Theory Comput. Syst., 2002
J. Graph Algorithms Appl., 2002
Proceedings of the Thirteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2002
2001
Networks, 2001
2000
Networks, 2000
1999
Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, 1999
1998
Theor. Comput. Sci., 1998
SIAM J. Discret. Math., 1998
Parallel Process. Lett., 1998
Theory Comput. Syst., 1998
Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures, 1998
1997
Networks, 1997
The Use of a Synchronizer Yields the Maximum Computation Rate in Distributed Networks.
Theory Comput. Syst., 1997
J. Cryptol., 1997
J. Algorithms, 1997
1996
J. Cryptol., 1996
1995
Math. Syst. Theory, 1995
Proceedings of the Algorithms, 1995
1994
Math. Syst. Theory, 1994
Proceedings of the Graph Drawing, DIMACS International Workshop, 1994
Proceedings of the Algorithms and Complexity, Second Italian Conference, 1994
1991
Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, 1991
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
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990
Proceedings of the Advances in Cryptology, 1990
1989
Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989
Proceedings of the Advances in Cryptology, 1989
1985
J. ACM, January, 1985
ACM Trans. Comput. Syst., 1985
Commun. ACM, 1985
Proceedings of the Advances in Cryptology, 1985
1984
Inf. Control., May, 1984
Correction to 'DESlike functions can generate the alternating group' (Nov 83 863865).
IEEE Trans. Inf. Theory, 1984
Networks, 1984
Discret. Appl. Math., 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
IEEE Trans. Inf. Theory, 1983
SIGACT News, 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
1982
Inf. Control., 1982
Inf. Control., 1982
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982
Proceedings of the Advances in Cryptology: Proceedings of CRYPTO '82, 1982
1981
J. Algorithms, 1981
J. Algorithms, 1981
J. ACM, 1981
J. ACM, 1981
On Protocols for Cake Cutting.
Proceedings of the 7th Conference Graphtheoretic Concepts in Computer Science (WG '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
Proceedings of the Automata, 1980
1978
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 <i>st</i>Numbering. TCS 2(1976):339344.
Theor. Comput. Sci., 1977
1976
Theor. Comput. Sci., 1976
SIAM J. Comput., 1976
J. Comb. Theory B, 1976
J. ACM, 1976
1975
SIAM J. Comput., 1975
SIAM J. Comput., 1975
Efficient Generation of Optimal Prefix Code: Equiprobable Words Using Unequal Cost Letters.
J. ACM, 1975
Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975
Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975
1974
Commun. ACM, 1974
1973
IEEE Trans. Inf. Theory, 1973
1972
Inf. Control., December, 1972
J. ACM, 1972
1971
IEEE Trans. Computers, 1971
J. Comput. Syst. Sci., 1971
1970
Minimizing the Number of Operations in Certain DiscreteVariable Optimization Problems.
Oper. Res., 1970
1969
IEEE Trans. Computers, 1969
IEEE Trans. Computers, 1969
IEEE Trans. Computers, 1969
1967
IEEE Trans. Electron. Comput., 1967
1966
IEEE Trans. Inf. Theory, 1966
IEEE Trans. Electron. Comput., 1966
1965
IEEE Trans. Electron. Comput., 1965
IEEE Trans. Electron. Comput., 1965
IEEE Trans. Electron. Comput., 1965
1964
IEEE Trans. Inf. Theory, 1964
IEEE Trans. Inf. Theory, 1964
IEEE Trans. Electron. Comput., 1964
1963
IEEE Trans. Inf. Theory, 1963
1962
Proceedings of the 3rd Annual Symposium on Switching Circuit Theory and Logical Design, 1962