• Source: Scopus
  • Calculated based on no. of publications stored in Pure and citations from Scopus
19972021

Research activity per year

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

Search results

  • 2016

    A Better-Than-3n Lower Bound for the Circuit Complexity of an Explicit Function

    Find, M. G., Golovnev, A., Hirsch, E. A. & Kulikov, A. S., 14 Dec 2016, Proceedings - 57th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016. Institute of Electrical and Electronics Engineers Inc., p. 89-98 10 p. 7782921. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2016-December).

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

    16 Scopus citations
  • On the limits of gate elimination

    Golovnev, A., Hirsch, E. A., Knop, A. & Kulikov, A. S., 1 Aug 2016, 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016. Muscholl, A., Faliszewski, P. & Niedermeier, R. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 46. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 58).

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

    2 Scopus citations
  • 2011

    Satisfiability certificates verifiable in subexponential time

    Dantsin, E. & Hirsch, E. A., 27 Jun 2011, Theory and Application of Satisfiability Testing - 14th International Conference, SAT 2011, Proceedings. p. 19-32 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6695 LNCS).

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

    2 Scopus citations
  • 2010

    On optimal heuristic randomized semidecision procedures, with application to proof complexity

    Hirsch, E. A. & Itsykson, D., 1 Dec 2010, STACS 2010 - 27th International Symposium on Theoretical Aspects of Computer Science. p. 453-464 12 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 5).

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

    8 Scopus citations
  • Optimal acceptors and optimal proof systems

    Hirsch, E. A., 15 Jul 2010, Theory and Applications of Models of Computation - 7th Annual Conference, TAMC 2010, Proceedings. p. 28-39 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6108 LNCS).

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

    8 Scopus citations
  • 2009

    A feebly secure trapdoor function

    Hirsch, E. A. & Nikolenko, S. I., 29 Oct 2009, Computer Science - Theory and Applications - 4th International Computer Science Symposium in Russia, CSR 2009, Proceedings. p. 129-142 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5675 LNCS).

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

    5 Scopus citations
  • 2008

    An infinitely-often one-way function based on an average-case assumption

    Hirsch, E. A. & Itsykson, D. M., 28 Jul 2008, Logic, Language, Information and Computation - 15th International Workshop, WoLLIC 2008, Proceedings. p. 208-217 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5110 LNAI).

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

  • 2006

    Clause shortening combined with pruning yields a new upper bound for deterministic SAT algorithms

    Dantsin, E., Hirsch, E. A. & Wolpert, A., 1 Jan 2006, Algorithms and Complexity - 6th Italian Conference, CIAC 2006, Proceedings. Springer Nature, p. 60-68 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3998 LNCS).

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

    11 Scopus citations
  • 2002

    Complexity of semi-algebraic proofs

    Grigoriev, D., Hirsch, E. A. & Pasechnik, D. V., 1 Jan 2002, STACS 2002 - 19th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings. Ferreira, A. & Alt, H. (eds.). Springer Nature, p. 419-430 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2285).

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

    29 Scopus citations
  • Exponential lower bound for static semi-algebraic proofs

    Grigoriev, D., Hirsch, E. A. & Pasechnik, D. V., 1 Dec 2002, Automata, Languages and Programming - 29th International Colloquium, ICALP 2002, Proceedings. p. 257-268 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2380 LNCS).

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

    11 Scopus citations
  • 2001

    Solving Boolean satisfiability using local search guided by unit clause elimination

    Hirsch, E. A. & Kojevnikov, A., 1 Jan 2001, Principles and Practice of Constraint Programming - CP 2001 - 7th International Conference, CP 2001, Proceedings. Walsh, T. (ed.). Springer Nature, p. 605-609 5 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2239).

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

    8 Scopus citations
  • 2000

    A new algorithm for MAX-2-SAT

    Hirsch, E. A., 1 Jan 2000, STACS 2000 - 17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000, Proceedings. Reichel, H. & Tison, S. (eds.). Springer Nature, p. 65-73 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1770).

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

    28 Scopus citations
  • Deterministic algorithms for k-SAT based on covering codes and local search

    Dantsin, E., Goerdt, A., Hirsch, E. A. & Schöning, U., 1 Jan 2000, Automata, Languages and Programming - 27th International Colloquium, ICALP 2000, Proceedings. Montanari, U., Welzl, E. & Rolim, J. D. P. (eds.). Springer Nature, p. 236-247 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1853).

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

    23 Scopus citations
  • 1998

    Local search algorithms for SAT: Worst-case analysis

    Hirsch, E. A., 1 Jan 1998, Algorithm Theory — SWAT 1998 - 6th Scandinavian Workshop on Algorithm Theory, Proceedings. Arnborg, S. & Ivansson, L. (eds.). Springer Nature, p. 246-254 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1432).

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

    2 Scopus citations