1992 …2022

Research activity per year

If you made any changes in Pure these will be visible here soon.

Search results

  • Conference contribution

    Embedding interconnection networks in grids via the layered cross product

    Even, G. & Even, S., 1997, Algorithms and Complexity - 3rd Italian Conference, CIAC 1997, Proceedings. Bongiovanni, G., Bovet, D. P. & Di Battista, G. (eds.). Springer Verlag, p. 3-12 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1203).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Hierarchies of local-optimality characterizations in decoding Tanner codes

    Halabi, N. & Even, G., 2012, 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012. p. 2691-2695 5 p. 6284008. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Hitting sets online and vertex ranking

    Even, G. & Smorodinsky, S., 2011, Algorithms, ESA 2011 - 19th Annual European Symposium, Proceedings. p. 347-357 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6942 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Improved approximations of crossings in graph drawings

    Even, G., Guha, S. & Schieber, B., 2000, Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC 2000. p. 296-305 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Improving initialization through reversed ret iming

    Stok, L., Spillinger, I. & Even, G., 6 Mar 1995, Proceedings of the 1995 European Conference on Design and Test, EDTC 1995. Association for Computing Machinery, Inc, p. 150-154 5 p. (Proceedings of the 1995 European Conference on Design and Test, EDTC 1995).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Linear-programming decoding of Tanner codes with local-optimality certificates

    Halabi, N. & Even, G., 2012, 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012. p. 2686-2690 5 p. 6284007. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Local-optimality guarantees for optimal decoding based on paths

    Halabi, N. & Even, G., 2012, 2012 7th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2012. p. 205-209 5 p. 6325228. (International Symposium on Turbo Codes and Iterative Information Processing, ISTC).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • LP decoding of regular LDPC codes in memoryless channels

    Halabi, N. & Even, G., 2010, 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings. p. 744-748 5 p. 5513612. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Message-passing decoding beyond the girth with local-optimality guarantees

    Halabi, N. & Even, G., 2012, 2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012. 6376924. (2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Multi-hop routing and scheduling in wireless networks in the SINR model

    Even, G., Matsri, Y. & Medina, M., 2012, Algorithms for Sensor Systems - 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, ALGOSENSORS 2011, Revised Selected Papers. p. 202-214 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7111 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Observability of boolean networks is NP-hard

    Laschov, D., Margaliot, M. & Even, G., 2012, 2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012. 6377137. (2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Online generalized caching with varying weights and costs

    Even, G., Medina, M. & Rawitz, D., 11 Jul 2018, SPAA 2018 - Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, p. 205-212 8 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Online multi-commodity flow with high demands

    Even, G. & Medina, M., 2013, Approximation and Online Algorithms - 10th International Workshop, WAOA 2012, Revised Selected Papers. p. 16-29 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7846 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Online packet-routing in grids with bounded buffers

    Even, G. & Medina, M., 2011, SPAA'11 - Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures. p. 215-224 10 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • On-line path computation and function placement in SDNs

    Even, G., Medina, M. & Shamir, B. P., 2016, Stabilization, Safety, and Security of Distributed Systems - 18th International Symposium, SSS 2016, Proceedings. Petit, F. & Bonakdarpour, B. (eds.). Springer Verlag, p. 131-147 17 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10083 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • On network design problems: Fixed cost flows and the covering steiner problem

    Even, G., Kortsarz, G. & Slany, W., 2002, Algorithm Theory - SWAT 2002 - 8th Scandinavian Workshop on Algorithm Theory, Proceedings. Penttonen, M. & Schmidt, E. M. (eds.). Springer Verlag, p. 318-327 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2368).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Optimal conclusive sets for comparator networks

    Even, G., Levi, T. & Litman, A., 2007, Structural Information and Communication Complexity - 14th International Colloquium, SIROCCO 2007, Proceedings. Springer Verlag, p. 304-317 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4474 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Optimal distributed covering algorithms

    Ben-Basat, R., Even, G., Kawarabayashi, K. I. & Schwartzman, G., Oct 2019, 33rd International Symposium on Distributed Computing, DISC 2019. Suomela, J. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 5. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 146).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Parallel randomized load balancing: A lower bound for a more general model

    Even, G. & Medina, M., 2010, SOFSEM 2010: Theory and Practice of Computer Science - 36th Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. p. 358-369 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5901 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Real-time video streaming in multi-hop wireless static ad hoc networks

    Even, G., Fais, Y., Medina, M., Shahar, S. & Zadorojniy, A., 2012, Algorithms for Sensor Systems - 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, ALGOSENSORS 2011, Revised Selected Papers. p. 188-201 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7111 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Revisiting randomized parallel load balancing algorithms

    Even, G. & Medina, M., 2010, Structural Information and Communication Complexity - 16th International Colloquium, SIROCCO 2009, Revised Selected Papers. p. 209-221 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5869 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Scheduling of a smart antenna: Capacitated coloring of unit circular-arc graphs

    Even, G. & Shahar, S., 2006, Combinatorial and Algorithmic Aspects of Networking - Third Workshop, CAAN 2006, Revised Papers. p. 58-71 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4235 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Set connectivity problems in undirected graphs and the directed Steiner network problem

    Chekuri, C., Even, G., Gupta, A. & Segev, D., 2008, Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. p. 532-541 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Sign Based Derivative Filtering for Stochastic Gradient Descent

    Berestizshevsky, K. & Even, G., 2019, Artificial Neural Networks and Machine Learning – ICANN 2019: Deep Learning - 28th International Conference on Artificial Neural Networks, Proceedings. Tetko, I. V., Karpov, P., Theis, F. & Kurková, V. (eds.). Springer Verlag, p. 208-219 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11728 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Sublinear random access generators for preferential attachment graphs

    Even, G., Levi, R., Medina, M. & Rosén, A., 1 Jul 2017, 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017. Muscholl, A., Indyk, P., Kuhn, F. & Chatzigiannakis, I. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 6. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 80).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Survivable network design for group connectivity in low-treewidth graphs

    Chalermsook, P., Das, S., Even, G., Laekhanukit, B. & Vaz, D., 1 Aug 2018, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 21st International Workshop, APPROX 2018, and 22nd International Workshop, RANDOM 2018. Blais, E., Rolim, J. D. P., Steurer, D. & Jansen, K. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 8. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 116).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Three notes on distributed property testing

    Even, G., Fischer, O., Fraigniaud, P., Gonen, T., Levi, R., Medina, M., Montealegre, P., Olivetti, D., Oshman, R., Rapaport, I. & Todinca, I., 1 Oct 2017, 31st International Symposium on Distributed Computing, DISC 2017. Richa, A. W. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs; vol. 91).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Upper Tail Analysis of Bucket Sort and Random Tries

    Bercea, I. O. & Even, G., 2021, Algorithms and Complexity - 12th International Conference, CIAC 2021, Proceedings. Calamoneri, T. & Corò, F. (eds.). Springer Science and Business Media Deutschland GmbH, p. 116-129 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12701 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Editorial
  • Preface

    Even, G. & Rawitz, D., 2012, In: Lecture Notes in Computer Science. 7659 LNNS, p. iv

    Research output: Contribution to journalEditorial

  • Paper

    A parametric error analysis of Goldschmidt's division algorithm

    Even, G., Seidel, P. M. & Ferguson, W. E., 2003, p. 165-171. 7 p.

    Research output: Contribution to conferencePaperpeer-review

  • Comparison of three rounding algorithms for IEEE floating-point multiplication

    Even, G. & Seidel, P. M., 1999, p. 225-232. 8 p.

    Research output: Contribution to conferencePaperpeer-review

  • Fast approximate graph partitioning algorithms

    Even, G., Naor, J., Rao, S. & Schieber, B., 1997, p. 639-648. 10 p.

    Research output: Contribution to conferencePaperpeer-review

  • How many logic levels does floating-point addition require?

    Seidel, P. M. & Even, G., 1998, p. 142-149. 8 p.

    Research output: Contribution to conferencePaperpeer-review

  • On the design of fast IEEE floating-point adders

    Seidel, P. M. & Even, G., 2001, p. 184-194. 11 p.

    Research output: Contribution to conferencePaperpeer-review

  • On the design of IEEE compliant floating point units

    Even, G. & Paul, W., 1997, p. 54-63. 10 p.

    Research output: Contribution to conferencePaperpeer-review

  • Overcoming chip-to-chip delays and clock skews

    Even, G. & Litman, A., 1996, p. 199-208. 10 p.

    Research output: Contribution to conferencePaperpeer-review

  • Pipelined multiplicative division with IEEE rounding

    Even, G. & Seidel, P. M., 2003, p. 240-245. 6 p.

    Research output: Contribution to conferencePaperpeer-review

  • Pipelined packet-forwarding floating point: II. An adder

    Nielsen, A. M., Matula, D. W., Lyu, C. N. & Even, G., 1997, p. 148-155. 8 p.

    Research output: Contribution to conferencePaperpeer-review

  • Report

    A New Proof of The Retiming Lemma and Applications (Preliminary Version)

    Even, G., 17 Nov 1993, 20 p.

    Research output: Book/ReportReport

  • Review article

    A comparison of three rounding algorithms for IEEE floating-point multiplication

    Even, G. & Seidel, P. M., Jul 2000, In: IEEE Transactions on Computers. 49, 7, p. 638-650 13 p.

    Research output: Contribution to journalReview articlepeer-review