|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 20 occurrences of 19 keywords
|
|
|
Results
Found 59 publication records. Showing 59 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
113 | Joan Feigenbaum, Lance Fortnow, Sophie Laplante, Ashish V. Naik |
On Coherence, Random-self-reducibility, and Self-correction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996, pp. 59-67, 1996, IEEE Computer Society, 0-8186-7386-9. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
self-correctability, random-self-reducibility, polynomial advice, adaptive versus nonadaptive oracle machines, Computational complexity, coherence, Kolmogorov complexity |
76 | Eric Allender, Michal Koucký 0001 |
Amplifying Lower Bounds by Means of Self-Reducibility. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, 23-26 June 2008, College Park, Maryland, USA, pp. 31-40, 2008, IEEE Computer Society, 978-0-7695-3169-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
self-reducibility, lower bounds, circuit complexity |
74 | Joan Feigenbaum, Martin Strauss 0001 |
An Information-Theoretic Treatment of Random-Self-Reducibility (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27 - March 1, 1997, Proceedings, pp. 523-534, 1997, Springer, 3-540-62616-6. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
57 | André Große, Jörg Rothe, Gerd Wechsung |
Relating Partial and Complete Solutions and the Complexity of Computing Smallest Solutions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTCS ![In: Theoretical Computer Science, 7th Italian Conference, ICTCS 2001, Torino, Italy, October 4-6, 2001, Proceedings, pp. 339-356, 2001, Springer, 3-540-42672-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
complexity of smallest solutions, self-reducibility, graph colorability, Hamiltonian cycles, graph isomorphisms, partial solutions |
43 | László Babai, Sophie Laplante |
Stronger Separations for Random-Self-Reducibility, Rounds, and Advice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 14th Annual IEEE Conference on Computational Complexity, Atlanta, Georgia, USA, May 4-6, 1999, pp. 98-104, 1999, IEEE Computer Society, 0-7695-0075-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
40 | Helena Handschuh, Yiannis Tsiounis, Moti Yung |
Decision Oracles are Equivalent to Matching Oracles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Public Key Cryptography ![In: Public Key Cryptography, Second International Workshop on Practice and Theory in Public Key Cryptography, PKC '99, Kamakura, Japan, March 1-3, 1999, Proceedings, pp. 276-289, 1999, Springer, 3-540-65644-8. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Diffie-Hellman variants, randomized reductions, uniform reductions, homomorphic encryption functions (ElGamal, Goldwasser-Micali, Okamoto-Uchiyama, Naccache-Stern), random self-reducibility, universal malleability, public-key encryption, decision problems, matching problems |
36 | Martin Mundhenk |
On Self-Reducible Sets of Low Information Content. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, Second Italian Conference, CIAC '94, Rome, Italy, February 23-25, 1994, Proceedings, pp. 203-212, 1994, Springer, 3-540-57811-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
26 | Bruce M. Kapron, Lior Malka, Srinivasan Venkatesh 0001 |
A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings, pp. 328-339, 2007, Springer, 978-3-540-73419-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
random self-reducibility, zero-knowledge, commitment-schemes |
26 | Pekka Orponen, Ker-I Ko, Uwe Schöning, Osamu Watanabe 0001 |
Instance Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 41(1), pp. 96-121, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
nonuniform complexity, paddability, self-reducibility, completeness, Kolmogorov complexity |
25 | Joan Feigenbaum, Lance Fortnow, Sophie Laplante, Ashish V. Naik |
On Coherence, Random-Self-Reducibility, and Self-Correction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 7(2), pp. 174-191, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
21 | Prahladh Harsha, Daniel Mitropolsky, Alon Rosen |
Downward Self-Reducibility in TFNP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 14th Innovations in Theoretical Computer Science Conference, ITCS 2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, USA., pp. 67:1-67:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-263-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Prahladh Harsha, Daniel Mitropolsky, Alon Rosen |
Downward Self-Reducibility in TFNP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR22, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
21 | Prahladh Harsha, Daniel Mitropolsky, Alon Rosen |
Downward Self-Reducibility in TFNP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2209.10509, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Massimo Equi, Veli Mäkinen, Alexandru I. Tomescu |
Conditional Indexing Lower Bounds Through Self-Reducibility. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2002.00629, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
21 | Tomoki Kawashima, Katsuyuki Takashima, Yusuke Aikawa, Tsuyoshi Takagi |
An Efficient Authenticated Key Exchange from Random Self-Reducibility on CSIDH. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2020, pp. 1178, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
21 | Koen de Boer, Léo Ducas, Alice Pellet-Mary, Benjamin Wesolowski |
Random Self-reducibility of Ideal-SVP via Arakelov Random Walks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2020, pp. 297, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
21 | Lane A. Hemaspaandra |
The Power of Self-Reducibility: Selectivity, Information, and Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Complexity and Approximation ![In: Complexity and Approximation - In Memory of Ker-I Ko, pp. 19-47, 2020, Springer, 978-3-030-41671-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
21 | Tomoki Kawashima, Katsuyuki Takashima, Yusuke Aikawa, Tsuyoshi Takagi |
An Efficient Authenticated Key Exchange from Random Self-reducibility on CSIDH. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICISC ![In: Information Security and Cryptology - ICISC 2020 - 23rd International Conference, Seoul, South Korea, December 2-4, 2020, Proceedings, pp. 58-84, 2020, Springer, 978-3-030-68889-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
21 | Koen de Boer, Léo Ducas, Alice Pellet-Mary, Benjamin Wesolowski |
Random Self-reducibility of Ideal-SVP via Arakelov Random Walks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO (2) ![In: Advances in Cryptology - CRYPTO 2020 - 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17-21, 2020, Proceedings, Part II, pp. 243-273, 2020, Springer, 978-3-030-56879-5. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
21 | Lane A. Hemaspaandra |
The Power of Self-Reducibility: Selectivity, Information, and Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1902.08299, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
21 | Mark Braverman, Ankit Garg, Denis Pankratov, Omri Weinstein |
Information Lower Bounds via Self-Reducibility. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 59(2), pp. 377-396, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
21 | Jeffrey Aborot, Henry N. Adorna, Jhoirene B. Clemente |
On Self-Reducibility and Reoptimization of Closest Substring Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1603.02457, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
21 | Ji-Won Huh, Shuji Isobe, Eisuke Koizumi, Hiroki Shizuya |
On the Length-Decreasing Self-Reducibility and the Many-One-Like Reducibilities for Partial Multivalued Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Trans. Inf. Syst. ![In: IEICE Trans. Inf. Syst. 96-D(3), pp. 465-471, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
21 | Mark Braverman, Ankit Garg, Denis Pankratov, Omri Weinstein |
Information Lower Bounds via Self-reducibility. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications - 8th International Computer Science Symposium in Russia, CSR 2013, Ekaterinburg, Russia, June 25-29, 2013. Proceedings, pp. 183-194, 2013, Springer, 978-3-642-38535-3. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
21 | Mark Braverman, Ankit Garg, Denis Pankratov, Omri Weinstein |
Information lower bounds via self-reducibility. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR12, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
21 | Nelly Fazio, Kevin Iga, Antonio Nicolosi, Ludovic Perret, William E. Skeith III |
Random Self-Reducibility Properties of Learning Problems over Burnside Groups of Exponent 3. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2011, pp. 398, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
21 | Eric Allender, Michal Koucký 0001 |
Amplifying lower bounds by means of self-reducibility. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 57(3), pp. 14:1-14:36, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
21 | Eric Allender, Michal Koucký 0001 |
Amplifying Lower Bounds by Means of Self-Reducibility. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR08, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
21 | André Hernich, Arfst Nickelsen |
Combining Self-reducibility and Partial Information Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2005, 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29 - September 2, 2005, Proceedings, pp. 483-494, 2005, Springer, 3-540-28702-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Aduri Pavan, N. V. Vinodchandran |
Polylogarithmic Round Arthur-Merlin Games and Random-Self-Reducibility ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR04, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
21 | Lane A. Hemaspaandra, Harald Hempel |
P-immune sets with holes lack self-reducibility properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 302(1-3), pp. 457-466, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
21 | Lane A. Hemaspaandra, Harald Hempel |
P-Immune Sets with Holes Lack Self-Reducibility Properties ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR cs.CC/0102024, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
|
21 | Lane A. Hemaspaandra, Harald Hempel |
P-Immune Sets with Holes Lack Self-Reducibility Properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DMTCS ![In: Combinatorics, Computability and Logic, Proceedings of the Third International Conference on Combinatorics, Computability and Logic, DMTCS 20Ol, Constanta, Romania., pp. 115-124, 2001, Springer, 978-1-85233-526-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
21 | Edith Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman |
P-Selektive Sets and Reducing Search to Decision vs Self-Reducibility. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 53(2), pp. 194-209, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
21 | Lane A. Hemaspaandra, Marius Zimand |
Strong Self-Reducibility Precludes Strong Immunity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Syst. Theory ![In: Math. Syst. Theory 29(5), pp. 535-548, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
21 | Jie Wang 0002 |
Some Results on Selectivity and Self-Reducibility. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 55(2), pp. 81-87, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
21 | Lane A. Hemaspaandra, Riccardo Silvestri |
Easily Checked Generalized Self-Reducibility. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 24(4), pp. 840-858, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
21 | Joan Feigenbaum, Lance Fortnow |
Random-Self-Reducibility of Complete Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 22(5), pp. 994-1005, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
21 | Lane A. Hemachandra, Riccardo Silvestri |
Easity Checked Self-Reducibility (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 9th International Symposium, FCT '93, Szeged, Hungary, August 23-27, 1993, Proceedings, pp. 289-298, 1993, Springer, 3-540-57163-9. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
21 | Karl R. Abrahamson, Michael R. Fellows, Christopher B. Wilson |
Parallel Self-Reducibility. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCI ![In: Computing and Information - ICCI'92, Fourth International Conference on Computing and Information, Toronto, Ontario, Canada, May 28-30, 1992, Proceedings, pp. 67-70, 1992, IEEE Computer Society, 0-8186-2812-X. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP BibTeX RDF |
|
21 | Sanjeev N. Khadilkar, Somenath Biswas |
Padding, Commitment and Self-Reducibility. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 81(2), pp. 189-199, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
21 | Joan Feigenbaum, Lance Fortnow |
On the Random-Self-Reducibility of Complete Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991, pp. 124-132, 1991, IEEE Computer Society, 0-8186-2255-5. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
21 | Jürgen Kämper |
A Result Relating Disjunctive Self-Reducibility to P-Immunity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 33(5), pp. 239-242, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
21 | José L. Balcázar |
Self-Reducibility. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 41(3), pp. 367-388, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
21 | Joan Feigenbaum, Sampath Kannan, Noam Nisan |
Lower Bounds on Random-Self-Reducibility. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings: Fifth Annual Structure in Complexity Theory Conference, Universitat Politècnica de Catalunya, Barcelona, Spain, July 8-11, 1990, pp. 100-109, 1990, IEEE Computer Society, 0-8186-2072-2. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
21 | Tatsuaki Okamoto, Kazuo Ohta |
Divertible Zero Knowledge Interactive Proofs and Commutative Random Self-Reducibility. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT '89, Workshop on the Theory and Application of of Cryptographic Techniques, Houthalen, Belgium, April 10-13, 1989, Proceedings, pp. 134-148, 1989, Springer, 3-540-53433-4. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
21 | Klaus Ambos-Spies, Jürgen Kämper |
On Disjunctive Self-Reducibility. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: CSL '88, 2nd Workshop on Computer Science Logic, Duisburg, Germany, October 3-7, 1988, Proceedings, pp. 1-13, 1988, Springer, 3-540-51659-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
21 | José L. Balcázar |
Logspace self-reducibility. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings: Third Annual Structure in Complexity Theory Conference, Georgetown University, Washington, D. C., USA, June 14-17, 1988, pp. 40-46, 1988, IEEE Computer Society, 0-8186-0794-7. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
21 | Martin Tompa, Heather Woll |
Random Self-Reducibility and Zero Knowledge Interactive Proofs of Possession of Information ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 28th Annual Symposium on Foundations of Computer Science, Los Angeles, California, USA, 27-29 October 1987, pp. 472-482, 1987, IEEE Computer Society, 0-8186-0807-2. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
21 | José L. Balcázar |
Self-Reducibility. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 87, 4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, Germany, February 19-21, 1987, Proceedings, pp. 136-147, 1987, Springer, 3-540-17219-X. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
21 | Ker-I Ko |
On Self-Reducibility and Weak P-Selectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 26(2), pp. 209-221, 1983. The full citation details ...](Pics/full.jpeg) |
1983 |
DBLP DOI BibTeX RDF |
|
14 | Aggelos Kiayias, Moti Yung |
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 54(6), pp. 2752-2769, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
14 | Dimitar Jetchev, Ramarathnam Venkatesan |
Bits Security of the Elliptic Curve Diffie-Hellman Secret Keys. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO ![In: Advances in Cryptology - CRYPTO 2008, 28th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2008. Proceedings, pp. 75-92, 2008, Springer, 978-3-540-85173-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
14 | Harold N. Gabow |
Finding paths and cycles of superpolylogarithmic length. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004, pp. 407-416, 2004, ACM, 1-58113-852-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
approximation algorithms, graph algorithms, cycle, path |
14 | Katalin Friedl, Gábor Ivanyos, Frédéric Magniez, Miklos Santha, Pranab Sen |
Hidden translation and orbit coset in quantum computing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, pp. 1-9, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
14 | Leslie Ann Goldberg, Steven Kelk, Mike Paterson |
The complexity of choosing an H-colouring (nearly) uniformly at random. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada, pp. 53-62, 2002, ACM, 1-58113-495-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
14 | Liming Cai, David W. Juedes, Iyad A. Kanj |
The Inapproximability of Non NP-hard Optimization Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 9th International Symposium, ISAAC '98, Taejon, Korea, December 14-16, 1998, Proceedings, pp. 437-446, 1998, Springer, 3-540-65385-6. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
14 | Rainer Schuler, Tomoyuki Yamakami |
Structural Average Case Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, 12th Conference, New Delhi, India, December 18-20, 1992, Proceedings, pp. 128-139, 1992, Springer, 3-540-56287-7. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
14 | Uwe Schöning |
Robust Orale Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1988, MFCS'88, Carlsbad, Czechoslovakia, August 29 - September 2, 1988, Proceedings, pp. 93-106, 1988, Springer, 3-540-50110-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #59 of 59 (100 per page; Change: )
|
|