Shimon Even - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 100 from 101

2012

Graph Algorithms, Second EditionShimon Even, Guy Even. Cambridge University Press, 2012. [doi]

2007

Layout of an Arbitrary Permutation in a Minimal Right Triangle AreaMaria Artishchev-Zapolotsky, Yefim Dinitz, Shimon Even, Vladimir Yanovski. join, 8(2):101-118, 2007. [doi]

2005

Layout of an Arbitrary Permutation in a Minimal Right Triangle AreaMaria Artishchev-Zapolotsky, Shimon Even, Vladimir Yanovski. pdpta 2005: 124-130

2003

A Compact Layout of the ButterflyYefim Dinitz, Shimon Even, Maria Zapolotsky. join, 4(1):53-75, 2003. [doi]

Layout Area of the HypercubeShimon Even, Roni Kupershtok. join, 4(4):395-417, 2003. [doi]

2002

Traversing Directed Eulerian MazesSandeep N. Bhatt, Shimon Even, David S. Greenberg, Rafi Tayar. jgaa, 6(2):157-173, 2002. [doi]

Layout area of the hypercube (extended abstract)Shimon Even, Roni Kupershtok. soda 2002: 366-371 [doi]

Laying Out the Interconnection Network of the Transpose BijectionShimon Even, Roni Kupershtok. mst, 35(5):545-558, 2002. [doi]

2001

Area efficient layouts of the Batcher sorting networksShimon Even. networks, 38(4):199-208, 2001. [doi]

2000

Traversing Directed Eulerian MazesSandeep N. Bhatt, Shimon Even, David S. Greenberg, Rafi Tayar. criwg 2000: 35-46 [doi]

Embedding interconnection networks in grids via the layered cross productGuy Even, Shimon Even. networks, 36(2):91-95, 2000. [doi]

1999

Some Compact Layouts of the ButterflyYefim Dinitz, Shimon Even, Roni Kupershtok, Maria Zapolotsky. spaa 1999: 54-63 [doi]

1998

A Tight Layout of the Butterfly NetworkAythan Avior, Tiziana Calamoneri, Shimon Even, Ami Litman, Arnold L. Rosenberg. mst, 31(4):475-488, 1998. [doi]

Monochromatic Paths and Triangulated GraphsShimon Even, Ami Litman, Arnold L. Rosenberg. siamdm, 11(4):546-556, 1998. [doi]

On Mixed Connectivity CertificatesShimon Even, Gene Itkis, Sergio Rajsbaum. TCS, 203(2):253-269, 1998. [doi]

Layout of the Batcher Bitonic Sorter (Extended Abstract)Shimon Even, S. Muthukrishnan, Mike Paterson, Süleyman Cenk Sahinalp. spaa 1998: 172-181 [doi]

A Note on Limited PreemptionEdward G. Coffman Jr., Shimon Even. ppl, 8(1):3-6, 1998.

1997

1996

A Tight Layout of the Butterfly NetworkAythan Avior, Tiziana Calamoneri, Shimon Even, Ami Litman, Arnold L. Rosenberg. spaa 1996: 170-175

On-Line/Off-Line Digital SignaturesShimon Even, Oded Goldreich, Silvio Micali. joc, 9(1):35-67, 1996.

1995

On Mixed Connectivity Certificates (Extended Abstract)Shimon Even, Gene Itkis, Sergio Rajsbaum. esa 1995: 1-16

Unison, Canon, and Sluggish Clocks in Networks Controlled by a SynchronizerShimon Even, Sergio Rajsbaum. mst, 28(5):421-435, 1995.

1994

On the Capabilities of Systolic SystemsShimon Even, Ami Litman. mst, 27(1):3-28, 1994.

A Unified Scheme for Routing in Expander Based NetworksShimon Even, Ami Litman. ciac 1994: 125-135

Grid Layouts of Block Diagrams - Bounding the Number of Bends in Each ConnectionShimon Even, G. Granot. gd 1995: 64-75

1992

Layered Cross Product - A Technique to Construct Interconnection NetworksShimon Even, Ami Litman. spaa 1992: 60-69 [doi]

1991

On the Capabilities of Systolic Systems (Extended Abstract)Shimon Even, Ami Litman. spaa 1991: 357-367 [doi]

A Construction of a Cioher From a Single Pseudorandom PermutationShimon Even, Yishay Mansour. asiacrypt 1993: 210-224

1990

Systolic Modular MultiplicationShimon Even. crypto 1991: 619-624 [doi]

Computing with Snakes in Directed Networks of Automata (Extended Abstract)Shimon Even, Ami Litman, Peter Winkler. focs 1990: 740-745

How to keep a dynamic distributive directed graph acyclic and yet grant all requests of edge additionsShimon Even, Yachin Pnueli. jcit 1990: 414-425 [doi]

The Use of a Synchronizer Yields Maximum Computation Rate in Distributed Networks (Extended Abstract)Shimon Even, Sergio Rajsbaum. stoc 1990: 95-105

1989

On-Line/Off-Line Digital SchemesShimon Even, Oded Goldreich, Silvio Micali. crypto 1990: 263-275 [doi]

On the Number of Rounds Necessary to Disseminate InformationShimon Even, Burkhard Monien. spaa 1989: 318-327 [doi]

1985

On the Power of Cascade CiphersShimon Even, Oded Goldreich. tocs, 3(2):108-116, 1985. [doi]

Hard-Core Theorems for Complexity ClassesShimon Even, Alan L. Selman, Yacov Yacobi. JACM, 32(1):205-217, January 1985. [doi]

A Randomized Protocol for Signing ContractsShimon Even, Oded Goldreich, Abraham Lempel. CACM, 28(6):637-647, 1985.

On the Security of Ping-Pong Protocols when Implemented using the RSAShimon Even, Oded Goldreich, Adi Shamir. crypto 1986: 58-72 [doi]

1984

1983

1982

On Approximating a Vertex Cover for Planar GraphsReuven Bar-Yehuda, Shimon Even. stoc 1982: 303-309

On the Security of Ping-Pong ProtocolsDanny Dolev, Shimon Even, Richard M. Karp. iandc, 55(1-3):57-68, October/November/December 1982.

On the Security of Ping-Pong ProtocolsDanny Dolev, Shimon Even, Richard M. Karp. crypto 1982: 177-186

A Randomized Protocol for Signing ContractsShimon Even, Oded Goldreich, Abraham Lempel. crypto 1982: 205-210

On the Security of Multi-Party Ping-Pong ProtocolsShimon Even, Oded Goldreich. crypto 1982: 315

1981

A Linear-Time Approximation Algorithm for the Weighted Vertex Cover ProblemReuven Bar-Yehuda, Shimon Even. jal, 2(2):198-203, 1981.

Protocol for Signing ContractsShimon Even. crypto 1981: 148-153

The Minimum-Length Generator Sequence Problem is NP-HardShimon Even, Oded Goldreich. jal, 2(3):311-313, 1981.

An On-Line Edge-Deletion ProblemShimon Even, Yossi Shiloach. JACM, 28(1):1-4, 1981. [doi]

On Protocols for Cake CuttingShimon Even. wg 1982: 183-194

Linear Algorithm for Data Compression via String MatchingMichael Rodeh, Vaughan R. Pratt, Shimon Even. JACM, 28(1):16-24, 1981. [doi]

1980

Cryptocomplexity and NP-CompletenessShimon Even, Yacov Yacobi. icalp 1980: 195-207

An Observation Concerning the Complexity of Problems with Few Solutions and its Application to CryptographyShimon Even, Yacov Yacobi. criwg 1981: 270-278

1978

Economical Encoding of Commas Between StringsShimon Even, Michael Rodeh. CACM, 21(4):315-317, 1978.

The Max Flow of Dinic and Karzanov: An ExpositionShimon Even. jcit 1978: 233-237

1977

Corrigendum: Computing an ::::st::::-Numbering. TCS 2(1976):339-344Shimon Even, Robert Endre Tarjan. TCS, 4(1):123, 1977.

1976

Intersection graphs of curves in the planeGideon Ehrlich, Shimon Even, Robert Endre Tarjan. JCT, 21(1):8-20, 1976. [doi]

A Combinatorial Problem Which Is Complete in Polynomial SpaceShimon Even, Robert Endre Tarjan. JACM, 23(4):710-719, 1976. [doi]

Computing an :::: st :::: -NumberingShimon Even, Robert Endre Tarjan. TCS, 2(3):339-344, 1976.

On the Complexity of Timetable and Multicommodity Flow ProblemsShimon Even, Alon Itai, Adi Shamir. SICOMP, 5(4):691-703, 1976.

1975

1974

Parallelism in Tape-SortingShimon Even. CACM, 17(4):202-204, 1974.

1973

An algorithm for optimal prefix parsing of a noiseless and memoryless channelAbraham Lempel, Shimon Even, Martin Cohn. TIT, 19(2):208-214, 1973. [doi]

1972

Permutation Graphs and Transitive GraphsShimon Even, Amir Pnueli, Abraham Lempel. JACM, 19(3):400-410, 1972. [doi]

Generation and Enumeration of All Solutions of the Characteristic Sum ConditionShimon Even, Abraham Lempel. iandc, 21(5):476-482, December 1972.

1971

Ambiguity in Graphs and ExpressionsRonald Vernon Book, Shimon Even, Sheila A. Greibach, Gene Ott. TC, 20(2):149-153, 1971. [doi]

Marked Directed GraphsF. Commoner, Anatol W. Holt, Shimon Even, Amir Pnueli. jcss, 5(5):511-523, 1971.

1970

Minimizing the Number of Operations in Certain Discrete-Variable Optimization ProblemsFrancesco Brioschi, Shimon Even. ior, 18(1):66-81, 1970. [doi]

1969

The Design of Shift Register Generators for Finite SequencesMartin Cohn, Shimon Even. TC, 18(7):660-662, 1969. [doi]

A Gray Code CounterMartin Cohn, Shimon Even. TC, 18(7):662-664, 1969. [doi]

Sequential Boolean EquationsShimon Even, Albert R. Meyer. TC, 18(3):230-240, 1969. [doi]

1967

On Minimal Modulo 2 Sums of Products for Switching FunctionsShimon Even, Igal Kohavi, Azaria Paz. TC, 16(5):671-674, 1967. [doi]

1966

Some further results on synchronizable block codes (Corresp.)Willard L. Eastman, Shimon Even. TIT, 12(3):404-406, 1966. [doi]

Test for Planarity of a Circuit Given by an ExpressionShimon Even, Albert R. Meyer. TC, 15(3):372-375, 1966. [doi]

On Minimal Modulo 2 Sums of Products for Switching FunctionsShimon Even, I. Kohavi, Azaria Paz. focs 1966: 201-206

1965

Identification and Minimization of Linear MachinesMartin Cohn, Shimon Even. TC, 14(3):367-376, 1965. [doi]

Comments on the Minimization of Stochastic MachinesShimon Even. TC, 14(4):634-637, 1965. [doi]

On Information Lossless Automata of Finite OrderShimon Even. TC, 14(4):561-569, 1965. [doi]

1964

On synchronizable and PSK-synchronizable block codesWillard L. Eastman, Shimon Even. TIT, 10(4):351-356, 1964. [doi]

Test for synchronizability of finite automata and variable length codesShimon Even. TIT, 10(3):185-189, 1964. [doi]

Rational Numbers and Regular EventsShimon Even. TC, 13(6):740-741, 1964. [doi]

1963

Tests for unique decipherabilityShimon Even. TIT, 9(2):109-112, 1963. [doi]

Sign in or sign up to see more results.

runs on WebDSL