|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1128 occurrences of 717 keywords
|
|
|
Results
Found 2982 publication records. Showing 2982 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
109 | Bogdan S. Chlebus, Leszek Gasieniec, Andrzej Lingas, Aris Pagourtzis |
Oblivious gossiping in ad-hoc radio networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DIAL-M ![In: Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2001), Rome, Italy, July 21, 2001, pp. 44-51, 2001, ACM. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
98 | Moni Naor, Benny Pinkas |
Computationally Secure Oblivious Transfer. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Cryptol. ![In: J. Cryptol. 18(1), pp. 1-35, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Privacy preserving computation, Cryptography, Oblivious transfer, Secure function evaluation |
84 | Mohammad Taghi Hajiaghayi, Robert Kleinberg, Tom Leighton |
Semi-oblivious routing: lower bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, pp. 929-938, 2007, SIAM, 978-0-898716-24-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
84 | Anupam Gupta 0001, Mohammad Taghi Hajiaghayi, Harald Räcke |
Oblivious network design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 970-979, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
84 | Juraj Hromkovic, Martin Sauerhoff |
The Power of Nondeterminism and Randomness for Oblivious Branching Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 36(2), pp. 159-182, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
82 | Miklós Ajtai |
Oblivious RAMs without cryptogrpahic assumptions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pp. 181-190, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
RAM, oblivious |
82 | Mohammad Taghi Hajiaghayi, Jeong Han Kim, Tom Leighton, Harald Räcke |
Oblivious routing in directed graphs with random demands. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pp. 193-201, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
demand distributions, directed graphs, oblivious routing |
76 | Iftach Haitner |
Semi-honest to Malicious Oblivious Transfer - The Black-Box Way. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TCC ![In: Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008., pp. 412-426, 2008, Springer, 978-3-540-78523-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
76 | Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Frank Thomson Leighton, Harald Räcke |
New lower bounds for oblivious routing in undirected graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 918-927, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
76 | Jürg Wullschleger |
Oblivious-Transfer Amplification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT 2007, 26th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Barcelona, Spain, May 20-24, 2007, Proceedings, pp. 555-572, 2007, Springer, 978-3-540-72539-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
oblivious-transfer amplification, universal oblivious transfer, weak oblivious transfer, computational weak oblivious transfer, distributed leftover hash lemma, hard-core lemma |
74 | Constantinos Daskalakis, Christos H. Papadimitriou |
On oblivious PTAS's for nash equilibrium. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 75-84, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
anonymous games, oblivious algorithms, PTAS, bimatrix games |
74 | Huafei Zhu |
Fully-Simulatable Oblivious Set Transfer. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACISP ![In: Information Security and Privacy, 13th Australasian Conference, ACISP 2008, Wollongong, Australia, July 7-9, 2008, Proceedings, pp. 141-154, 2008, Springer, 978-3-540-69971-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Oblivious set transfer, perfectly hiding commitment, perfectly binding commitment, real/ideal world simulation paradigm |
74 | Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Harald Räcke, Tom Leighton |
Oblivious routing on node-capacitated and directed graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 3(4), pp. 51, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
node-capacitated graphs, directed graphs, communication networks, Oblivious routing |
74 | Xin Yuan 0001, Wickus Nienaber, Zhenhai Duan, Rami G. Melhem |
Oblivious routing for fat-tree based system area networks with uncertain traffic demands. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMETRICS ![In: Proceedings of the 2007 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS 2007, San Diego, California, USA, June 12-16, 2007, pp. 337-348, 2007, ACM, 978-1-59593-639-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
oblivious routing, system area networks, fat-tree |
68 | Michael Langberg |
Oblivious Communication Channels and Their Capacity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 54(1), pp. 424-429, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
68 | Gang Yao, Dengguo Feng |
Proxy Oblivious Transfer Protocol. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ARES ![In: Proceedings of the The First International Conference on Availability, Reliability and Security, ARES 2006, The International Dependability Conference - Bridging Theory and Practice, April 20-22 2006, Vienna University of Technology, Austria, pp. 190-197, 2006, IEEE Computer Society, 0-7695-2567-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
66 | Kai-Yuen Cheong, Takeshi Koshiba |
Reducing Complexity Assumptions for Oblivious Transfer. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWSEC ![In: Advances in Information and Computer Security, 4th International Workshop on Security, IWSEC 2009, Toyama, Japan, October 28-30, 2009, Proceedings, pp. 110-124, 2009, Springer, 978-3-642-04845-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
trapdoor one-way functions, oblivious transfer |
66 | Bingsheng He, Qiong Luo 0001 |
Cache-oblivious databases: Limitations and opportunities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Database Syst. ![In: ACM Trans. Database Syst. 33(2), pp. 8:1-8:42, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
cache-conscious, chip multiprocessors, data caches, simultaneous multithreading, Cache-oblivious |
66 | Huafei Zhu |
Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CANS ![In: Cryptology and Network Security, 7th International Conference, CANS 2008, Hong-Kong, China, December 2-4, 2008. Proceedings, pp. 214-225, 2008, Springer, 978-3-540-89640-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Black-box constructions, defensible adversary, malicious adversary, oblivious transfer protocols |
66 | Bingsheng He, Qiong Luo 0001 |
Cache-oblivious nested-loop joins. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIKM ![In: Proceedings of the 2006 ACM CIKM International Conference on Information and Knowledge Management, Arlington, Virginia, USA, November 6-11, 2006, pp. 718-727, 2006, ACM, 1-59593-433-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
nested-loop join, recursive clustering, buffering, cache-oblivious, recursive partitioning |
66 | Hyun Sook Rhee, Jin Wook Byun, Dong Hoon Lee 0001, Jongin Lim 0001 |
Oblivious Conjunctive Keyword Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WISA ![In: Information Security Applications, 6th International Workshop, WISA 2005, Jeju Island, Korea, August 22-24, 2005, Revised Selected Papers, pp. 318-327, 2005, Springer, 3-540-31012-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Privacy, Anonymity, Storage system, Oblivious Transfer, Conjunctive Keyword Search |
66 | Rezaul Alam Chowdhury, Vijaya Ramachandran |
Cache-oblivious shortest paths in graphs using buffer heap. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, June 27-30, 2004, Barcelona, Spain, pp. 245-254, 2004, ACM, 1-58113-840-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
buffer heap, cache-aware model, cache-oblivious model, decrease-key, tournament tree, shortest paths, priority queue |
64 | Cheng-Kang Chu, Wen-Guey Tzeng |
Conditional Oblivious Cast. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Public Key Cryptography ![In: Public Key Cryptography - PKC 2006, 9th International Conference on Theory and Practice of Public-Key Cryptography, New York, NY, USA, April 24-26, 2006, Proceedings, pp. 443-457, 2006, Springer, 3-540-33851-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
oblivious cast, conditional oblivious transfer, secure computation |
64 | Kazuo Iwama, Yasuo Okabe, Toshiro Takase |
Separating Oblivious and Non-oblivious BPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 7th Annual International Conference, COCOON 2001, Guilin, China, August 20-23, 2001, Proceedings, pp. 28-38, 2001, Springer, 3-540-42494-6. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
62 | Lars Arge, Michael A. Bender, Erik D. Demaine, Charles E. Leiserson, Kurt Mehlhorn |
04301 Abstracts Collection - Cache-Oblivious and Cache-Aware Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cache-Oblivious and Cache-Aware Algorithms ![In: Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004, 2004, IBFI, Schloss Dagstuhl, Germany. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
60 | Raylin Tso, Takeshi Okamoto, Eiji Okamoto |
1-out-of-. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPEC ![In: Information Security Practice and Experience, 4th International Conference, ISPEC 2008, Sydney, Australia, April 21-23, 2008, Proceedings, pp. 45-55, 2008, Springer, 978-3-540-79103-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
1-out-of-n signature, oblivious signature, Schnorr signature, oblivious transfer |
60 | Oded Goldreich 0001, Dana Ron |
On proximity oblivious testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 141-150, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
graph propeties, property testing |
60 | Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton, Harald Räcke |
Oblivious routing on node-capacitated and directed graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 782-790, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
60 | Yuval Ishai, Joe Kilian, Kobbi Nissim, Erez Petrank |
Extending Oblivious Transfers Efficiently. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO ![In: Advances in Cryptology - CRYPTO 2003, 23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 2003, Proceedings, pp. 145-161, 2003, Springer, 3-540-40674-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
60 | Gerth Stølting Brodal, Rolf Fagerberg |
Funnel Heap - A Cache Oblivious Priority Queue. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings, pp. 219-228, 2002, Springer, 3-540-00142-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
60 | Ventzislav Nikov, Svetla Nikova, Bart Preneel, Joos Vandewalle |
On Unconditionally Secure Distributed Oblivious Transfer. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INDOCRYPT ![In: Progress in Cryptology - INDOCRYPT 2002, Third International Conference on Cryptology in India, Hyderabad, India, December 16-18, 2002, pp. 395-408, 2002, Springer, 3-540-00263-4. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
60 | Oded Goldreich 0001, Rafail Ostrovsky |
Software Protection and Simulation on Oblivious RAMs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 43(3), pp. 431-473, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
simulation of random access machines, software protection, pseudorandom functions |
58 | Kai-Yuen Cheong, Takeshi Koshiba, Shohei Nishiyama |
Strengthening the Security of Distributed Oblivious Transfer. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACISP ![In: Information Security and Privacy, 14th Australasian Conference, ACISP 2009, Brisbane, Australia, July 1-3, 2009, Proceedings, pp. 377-388, 2009, Springer, 978-3-642-02619-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
oblivious transfer, information theoretic security, secret sharing scheme |
58 | Kamen Yotov, Thomas Roeder, Keshav Pingali, John A. Gunnels, Fred G. Gustavson |
An experimental comparison of cache-oblivious and cache-conscious programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007, pp. 93-104, 2007, ACM, 978-1-59593-667-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
cache-conscious algorithms, memory hierarchy, memory bandwidth, memory latency, numerical software, cache-oblivious algorithms |
58 | Ventzislav Nikov, Svetla Nikova, Bart Preneel |
A Weakness in Some Oblivious Transfer and Zero-Knowledge Protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIACRYPT ![In: Advances in Cryptology - ASIACRYPT 2006, 12th International Conference on the Theory and Application of Cryptology and Information Security, Shanghai, China, December 3-7, 2006, Proceedings, pp. 348-363, 2006, Springer, 3-540-49475-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Homomorphic Semantically Secure Cryptosystems, Paillier’s Public-Key Cryptosystem, Non-Interactive Zero-Knowledge Arguments, Oblivious Transfer |
58 | Nikhil Bansal 0001, Avrim Blum, Shuchi Chawla 0001, Adam Meyerson |
Online oblivious routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, June 7-9, 2003, San Diego, California, USA (part of FCRC 2003), pp. 44-49, 2003, ACM, 1-58113-661-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
networks, online algorithms, competitive analysis, congestion, gradient descent, oblivious routing |
58 | Jonathan P. Lang, Vishal Sharma, Emmanouel A. Varvarigos |
An analysis of oblivious and adaptive routing in optical networks with wavelength translation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 9(4), pp. 503-517, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
multi-fiber networks, wavelength translation, performance analysis, hypercube, Adaptive routing, wavelength division multiplexing, torus, oblivious routing, all-optical networks |
58 | Francesc Sebé, Josep Domingo-Ferrer |
Oblivious Image Watermarking Robust against Scaling and Geometric Distortions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISC ![In: Information Security, 4th International Conference, ISC 2001, Malaga, Spain, October 1-3, 2001, Proceedings, pp. 420-432, 2001, Springer, 3-540-42662-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Oblivious watermarking, Multimedia copyright protection |
58 | Christian Cachin |
On the Foundations of Oblivious Transfer. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT '98, International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31 - June 4, 1998, Proceeding, pp. 361-374, 1998, Springer, 3-540-64518-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Rényi Entropy, Statistical Security, Cryptographic Protocols, Oblivious Transfer, Multiparty Computation, Shannon Entropy |
56 | Avinash V. Varadarajan, Ramarathnam Venkatesan, C. Pandu Rangan |
Data structures for limited oblivious execution of programs while preserving locality of reference. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Digital Rights Management Workshop ![In: Proceedings of the Seventh ACM Workshop on Digital Rights Management, Alexandria, VA, USA, October 29, 2007, pp. 63-69, 2007, ACM, 978-1-59593-884-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
oblivious data structures, oblivious execution, secure data structures, DRM, software protection, secure hardware |
56 | Wen-Guey Tzeng |
Efficient 1-Out-of-n Oblivious Transfer Schemes with Universally Usable Parameters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 53(2), pp. 232-240, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
distributed oblivious transfer, Oblivious transfer, private information retrieval |
56 | Yan-Cheng Chang, Chi-Jen Lu |
Oblivious Polynomial Evaluation and Oblivious Neural Learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIACRYPT ![In: Advances in Cryptology - ASIACRYPT 2001, 7th International Conference on the Theory and Application of Cryptology and Information Security, Gold Coast, Australia, December 9-13, 2001, Proceedings, pp. 369-384, 2001, Springer, 3-540-42987-5. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
52 | Lasse Kliemann, Anand Srivastav |
Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SEA ![In: Experimental Algorithms, 8th International Symposium, SEA 2009, Dortmund, Germany, June 4-6, 2009. Proceedings, pp. 185-196, 2009, Springer, 978-3-642-02010-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
hypergraph matching, approximation algorithms, greedy algorithms, hybrid algorithms, NP-hard problems, randomized rounding |
52 | Andrew Y. Lindell |
Efficient Fully-Simulatable Oblivious Transfer. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CT-RSA ![In: Topics in Cryptology - CT-RSA 2008, The Cryptographers' Track at the RSA Conference 2008, San Francisco, CA, USA, April 8-11, 2008. Proceedings, pp. 52-70, 2008, Springer, 978-3-540-79262-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
52 | Jae-Won Cho, Rémy Prost, Ho-Youl Jung |
An Oblivious Watermarking for 3-D Polygonal Meshes Using Distribution of Vertex Norms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Signal Process. ![In: IEEE Trans. Signal Process. 55(1), pp. 142-155, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
52 | Hui-Feng Huang, Chin-Chen Chang 0001 |
A New Design for Efficient t-out-n Oblivious Transfer Scheme. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AINA ![In: 19th International Conference on Advanced Information Networking and Applications (AINA 2005), 28-30 March 2005, Taipei, Taiwan, pp. 499-502, 2005, IEEE Computer Society, 0-7695-2249-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
52 | Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, Alejandro López-Ortiz |
The Cost of Cache-Oblivious Searching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 44th Symposium on Foundations of Computer Science (FOCS 2003), 11-14 October 2003, Cambridge, MA, USA, Proceedings, pp. 271-282, 2003, IEEE Computer Society, 0-7695-2040-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
52 | Marcin Bienkowski, Miroslaw Korzeniowski, Harald Räcke |
A practical algorithm for constructing oblivious routing schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, June 7-9, 2003, San Diego, California, USA (part of FCRC 2003), pp. 24-33, 2003, ACM, 1-58113-661-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
50 | Lars Arge, Michael A. Bender, Erik D. Demaine, Charles E. Leiserson, Kurt Mehlhorn (eds.) |
Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004 ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cache-Oblivious and Cache-Aware Algorithms ![IBFI, Schloss Dagstuhl, Germany The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
50 | Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi 0001 |
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cache-Oblivious and Cache-Aware Algorithms ![In: Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004, 2004, IBFI, Schloss Dagstuhl, Germany. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
50 | Joachim Gudmundsson, Jan Vahrenhold |
A Simple Algorithm for I/O-efficiently Pruning Dense Spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cache-Oblivious and Cache-Aware Algorithms ![In: Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004, 2004, IBFI, Schloss Dagstuhl, Germany. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
50 | Rasmus Pagh, Zhewei Wei, Ke Yi 0001, Qin Zhang 0001 |
Cache-oblivious hashing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2010, June 6-11, 2010, Indianapolis, Indiana, USA, pp. 297-304, 2010, ACM, 978-1-4503-0033-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
hashing, cache-oblivious algorithms |
50 | Alexander Heinecke, Carsten Trinitis, Josef Weidendorfer |
Porting existing cache-oblivious linear algebra HPC modules to larrabee architecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Conf. Computing Frontiers ![In: Proceedings of the 7th Conference on Computing Frontiers, 2010, Bertinoro, Italy, May 17-19, 2010, pp. 91-92, 2010, ACM, 978-1-4503-0044-5. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
accelerator space-filling curve, openmp, matrix multiplication, cache-oblivious, lu decomposition, manycore |
50 | Matteo Frigo, Volker Strumpen |
The Cache Complexity of Multithreaded Cache Oblivious Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 45(2), pp. 203-233, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Multithreading, Cache oblivious algorithms, Stencil computations |
50 | Helger Lipmaa |
New Communication-Efficient Oblivious Transfer Protocols Based on Pairings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISC ![In: Information Security, 11th International Conference, ISC 2008, Taipei, Taiwan, September 15-18, 2008. Proceedings, pp. 441-454, 2008, Springer, 978-3-540-85884-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Computationally-private information retrieval, conditional disclosure of secrets, oblivious transfer, homomorphic encryption |
50 | Guangming Tan, Shengzhong Feng, Ninghui Sun |
Cache oblivious algorithms for nonserial polyadic programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 39(2), pp. 227-249, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Nonserial polyadic, Dynamic programming, Data dependencies, Cache oblivious, Algorithmic transformation |
50 | Gerth Stølting Brodal, Rolf Fagerberg, Kristoffer Vinther |
Engineering a cache-oblivious sorting algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 12, pp. 2.2:1-2.2:23, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
funnelsort, quicksort, Cache-oblivious algorithms |
50 | Ran Gal, Ariel Shamir, Daniel Cohen-Or |
Pose-Oblivious Shape Signature. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Vis. Comput. Graph. ![In: IEEE Trans. Vis. Comput. Graph. 13(2), pp. 261-271, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Shape-signature, pose-oblivious, shape-matching |
50 | Rezaul Alam Chowdhury, Vijaya Ramachandran |
The cache-oblivious gaussian elimination paradigm: theoretical framework, parallelization and experimental evaluation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007, pp. 71-80, 2007, ACM, 978-1-59593-667-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
matrix multiplication, tiling, Gaussian elimination, cache-oblivious algorithm, all-pairs shortest path |
50 | Huafei Zhu, Feng Bao 0001 |
Oblivious Scalar-Product Protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACISP ![In: Information Security and Privacy, 11th Australasian Conference, ACISP 2006, Melbourne, Australia, July 3-5, 2006, Proceedings, pp. 313-323, 2006, Springer, 3-540-35458-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Oblivious scalar-product protocol, homomorphic commitment scheme, homomorphic public key encryption |
50 | Claude Crépeau, George Savvides |
Optimal Reductions Between Oblivious Transfers Using Interactive Hashing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28 - June 1, 2006, Proceedings, pp. 201-221, 2006, Springer, 3-540-34546-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
interactive hashing, oblivious transfer, privacy amplification |
50 | Michael J. Freedman, Yuval Ishai, Benny Pinkas, Omer Reingold |
Keyword Search and Oblivious Pseudorandom Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TCC ![In: Theory of Cryptography, Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, February 10-12, 2005, Proceedings, pp. 303-324, 2005, Springer, 3-540-24573-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Secure keyword search, oblivious pseudorandom functions, secure two-party protocols, private information retrieval, privacy-preserving protocols |
50 | Huafei Zhu, Feng Bao 0001 |
Augmented Oblivious Polynomial Evaluation Protocol and Its Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESORICS ![In: Computer Security - ESORICS 2005, 10th European Symposium on Research in Computer Security, Milan, Italy, September 12-14, 2005, Proceedings, pp. 222-230, 2005, Springer, 3-540-28963-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Augmented oblivious polynomial evaluation, homomorphic commitment scheme, homomorphic public key encryption |
50 | Costas Busch, Malik Magdon-Ismail, Jing Xi |
Oblivious routing on geometric networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, July 18-20, 2005, Las Vegas, Nevada, USA, pp. 316-324, 2005, ACM, 1-58113-986-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
disc graphs, congestion, oblivious routing, stretch, geometric networks |
50 | Helger Lipmaa |
Verifiable Homomorphic Oblivious Transfer and Private Equality Test. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIACRYPT ![In: Advances in Cryptology - ASIACRYPT 2003, 9th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, November 30 - December 4, 2003, Proceedings, pp. 416-433, 2003, Springer, 3-540-20592-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
cryptographic auctions, verifiable oblivious transfer, verifiable private equality test, homomorphic encryption |
50 | Loren Schwiebert |
Deadlock-Free Oblivious Wormhole Routing with Cyclic Dependencies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 50(9), pp. 865-876, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
channel dependency graph, unreachable configuration, Wormhole routing, oblivious routing, deadlock freedom |
50 | Gilles Brassard, Claude Crépeau |
Oblivious Transfers and Privacy Amplification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT '97, International Conference on the Theory and Application of Cryptographic Techniques, Konstanz, Germany, May 11-15, 1997, Proceeding, pp. 334-347, 1997, Springer, 3-540-62975-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Reduction Between Protocols, Oblivious Transfer, Information-Theoretic Security, Privacy Amplification |
48 | Sandeep Prakash, Sourav S. Bhowmick, Sanjay Madria |
Efficient Recursive XML Query Processing in Relational Database Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ER ![In: Conceptual Modeling - ER 2004, 23rd International Conference on Conceptual Modeling, Shanghai, China, November 2004, Proceedings, pp. 493-510, 2004, Springer, 3-540-23723-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
48 | Remo Meier, Bartosz Przydatek, Jürg Wullschleger |
Robuster Combiners for Oblivious Transfer. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TCC ![In: Theory of Cryptography, 4th Theory of Cryptography Conference, TCC 2007, Amsterdam, The Netherlands, February 21-24, 2007, Proceedings, pp. 404-418, 2007, Springer, 3-540-70935-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
robust combiners, weak oblivious transfer, oblivious transfer |
48 | Gilles Brassard, Claude Crépeau, Stefan Wolf 0001 |
Oblivious Transfers and Privacy Amplification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Cryptol. ![In: J. Cryptol. 16(4), pp. 219-237, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Universal oblivious transfer, Reduction among information-theoretic primitives, Oblivious transfer, Information-theoretic security, Privacy amplification |
46 | Michele Flammini, Luca Moscardelli, Alfredo Navarra, Stéphane Pérennes |
Asymptotically Optimal Solutions for Small World Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 42(4), pp. 632-650, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Oblivious diameter, Social networks, Small world graph |
46 | Gerth Stølting Brodal, Rolf Fagerberg |
On the limits of cache-obliviousness. ![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. 307-315, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Cache-oblivious model, tall cache assumption, lower bound, sorting, permuting |
44 | Amos Israeli, Evangelos Kranakis, Danny Krizanc, Nicola Santoro |
Time-Message Trade-Offs for the Weak Unison Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, Second Italian Conference, CIAC '94, Rome, Italy, February 23-25, 1994, Proceedings, pp. 167-178, 1994, Springer, 3-540-57811-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
Chordalrings, t-step protocol, Non-oblivious, Time-message complexity, Unbalanced, Unison, Wakeup protocol, Weak unison, Balanced, Anonymous network, Oblivious |
44 | Shantanu Das 0001, Paola Flocchini, Nicola Santoro, Masafumi Yamashita |
On the computational power of oblivious robots: forming a series of geometric patterns. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010, pp. 267-276, 2010, ACM, 978-1-60558-888-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
distributed coordination |
44 | Yehuda Lindell, Hila Zarosim |
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TCC ![In: Theory of Cryptography, 6th Theory of Cryptography Conference, TCC 2009, San Francisco, CA, USA, March 15-17, 2009. Proceedings, pp. 183-201, 2009, Springer, 978-3-642-00456-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
44 | Peyman Afshani, Chris H. Hamilton, Norbert Zeh |
A general approach for cache-oblivious range reporting and approximate range counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009, pp. 287-295, 2009, ACM, 978-1-60558-501-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
data structures, memory hierarchies, range searching, cache-obliviousness |
44 | Carlo Blundo, Paolo D'Arco, Alfredo De Santis, Douglas R. Stinson |
On Unconditionally Secure Distributed Oblivious Transfer. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Cryptol. ![In: J. Cryptol. 20(3), pp. 323-373, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
44 | Geeta Chaudhry, Thomas H. Cormen |
Slabpose Columnsort: A New Oblivious Algorithm for Out-of-Core Sorting on Distributed-Memory Clusters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 45(3), pp. 483-508, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
44 | Jiangtao Li 0001, Ninghui Li |
OACerts: Oblivious Attribute Certificates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Dependable Secur. Comput. ![In: IEEE Trans. Dependable Secur. Comput. 3(4), pp. 340-352, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
privacy, access controls, Security and privacy protection, cryptographic controls |
44 | John A. Gunnels, Fred G. Gustavson, Keshav Pingali, Kamen Yotov |
Is Cache-Oblivious DGEMM Viable? ![Search on Bibsonomy](Pics/bibsonomy.png) |
PARA ![In: Applied Parallel Computing. State of the Art in Scientific Computing, 8th International Workshop, PARA 2006, Umeå, Sweden, June 18-21, 2006, Revised Selected Papers, pp. 919-928, 2006, Springer, 978-3-540-75754-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
44 | Jiangtao Li 0001, Ninghui Li |
OACerts: Oblivious Attribute Certificates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACNS ![In: Applied Cryptography and Network Security, Third International Conference, ACNS 2005, New York, NY, USA, June 7-10, 2005, Proceedings, pp. 301-317, 2005, 3-540-26223-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
44 | Lubica Staneková, Martin Stanek |
Fast Contract Signing with Batch Oblivious Transfer. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Communications and Multimedia Security ![In: Communications and Multimedia Security, 9th IFIP TC-6 TC-11 International Conference, CMS 2005, Salzburg, Austria, September 19-21, 2005, Proceedings, pp. 1-10, 2005, Springer, 3-540-28791-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
44 | Cheng-Kang Chu, Wen-Guey Tzeng |
Efficient k-Out-of-n Oblivious Transfer Schemes with Adaptive and Non-adaptive Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Public Key Cryptography ![In: Public Key Cryptography - PKC 2005, 8th International Workshop on Theory and Practice in Public Key Cryptography, Les Diablerets, Switzerland, January 23-26, 2005, Proceedings, pp. 172-183, 2005, Springer, 3-540-24454-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
44 | Gianni Franceschini |
Proximity Mergesort: optimal in-place sorting in the cache-oblivious model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pp. 291-299, 2004, SIAM, 0-89871-558-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
44 | Charles E. Leiserson |
Cache-Oblivious Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, 5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings, pp. 5, 2003, Springer, 3-540-40176-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
44 | Michael A. Bender, Ziyang Duan, John Iacono, Jing Wu |
A locality-preserving cache-oblivious dynamic dictionary. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA., pp. 29-38, 2002, ACM/SIAM, 0-89871-513-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
44 | Carlo Blundo, Paolo D'Arco, Alfredo De Santis, Douglas R. Stinson |
New Results on Unconditionally Secure Distributed Oblivious Transfer. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Selected Areas in Cryptography ![In: Selected Areas in Cryptography, 9th Annual International Workshop, SAC 2002, St. John's, Newfoundland, Canada, August 15-16, 2002. Revised Papers, pp. 291-309, 2002, Springer, 3-540-00622-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
44 | Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro |
Cache-oblivious priority queue and graph algorithm applications. ![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. 268-276, 2002, ACM, 1-58113-495-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
44 | Guillermo De Ita, David Eduardo Pinto, M. Nuño |
Heuristics for Improving the Non-oblivious Local Search for MaxSAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IBERAMIA ![In: Progress in Artificial Intelligence - IBERAMIA 98, 6th Ibero-American Conference on AI, Lisbon, Portugal, October 5-9, 1998, Proceedings., pp. 219-229, 1998, Springer, 3-540-64992-1. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
44 | Yonatan Aumann, Michael A. Bender |
Efficient Asynchronous Consensus with the Value-Oblivious Adversary Scheduler. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 23rd International Colloquium, ICALP96, Paderborn, Germany, 8-12 July 1996, Proceedings, pp. 622-633, 1996, Springer, 3-540-61440-0. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
44 | Claude Crépeau, Jeroen van de Graaf, Alain Tapp |
Committed Oblivious Transfer and Private Multi-Party Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO ![In: Advances in Cryptology - CRYPTO '95, 15th Annual International Cryptology Conference, Santa Barbara, California, USA, August 27-31, 1995, Proceedings, pp. 110-123, 1995, Springer, 3-540-60221-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
44 | Claude Crépeau |
Equivalence Between Two Flavours of Oblivious Transfers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO ![In: Advances in Cryptology - CRYPTO '87, A Conference on the Theory and Applications of Cryptographic Techniques, Santa Barbara, California, USA, August 16-20, 1987, Proceedings, pp. 350-354, 1987, Springer, 3-540-18796-0. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
42 | Guy E. Blelloch, Phillip B. Gibbons, Harsha Vardhan Simhadri |
Low depth cache-oblivious algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, Thira, Santorini, Greece, June 13-15, 2010, pp. 189-199, 2010, ACM, 978-1-4503-0079-7. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
sparse-matrix vector multiply, schedulers, parallel algorithms, multiprocessors, sorting, graph algorithms, cache-oblivious algorithms |
42 | Lars Arge, Mark de Berg, Herman J. Haverkort |
Cache-Oblivious R-Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 53(1), pp. 50-68, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Cache-oblivious data structures, R-trees, Geometric data structures, I/O-efficiency |
42 | Huafei Zhu, Feng Bao 0001 |
Non-committing Encryptions Based on Oblivious Naor-Pinkas Cryptosystems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INDOCRYPT ![In: Progress in Cryptology - INDOCRYPT 2009, 10th International Conference on Cryptology in India, New Delhi, India, December 13-16, 2009. Proceedings, pp. 418-429, 2009, Springer, 978-3-642-10627-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
non-committing encryption, oblivious Naor-Pinkas cryptosystem, Naor-Pinkas randomizer, adaptive security |
42 | Gérald Gavin, Marine Minier |
Oblivious Multi-variate Polynomial Evaluation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INDOCRYPT ![In: Progress in Cryptology - INDOCRYPT 2009, 10th International Conference on Cryptology in India, New Delhi, India, December 13-16, 2009. Proceedings, pp. 430-442, 2009, Springer, 978-3-642-10627-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Homomorphic encryption schemes, Oblivious Polynomial Evaluation (OPE), semantic security |
42 | Huafei Zhu, Feng Bao 0001 |
Constructing Universally Composable Oblivious Transfers from Double Trap-Door Encryptions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AFRICACRYPT ![In: Progress in Cryptology - AFRICACRYPT 2009, Second International Conference on Cryptology in Africa, Gammarth, Tunisia, June 21-25, 2009. Proceedings, pp. 323-333, 2009, Springer, 978-3-642-02383-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
simulator, Oblivious transfer, universally composable |
42 | Guy E. Blelloch, Phillip B. Gibbons, Harsha Vardhan Simhadri |
Brief announcement: low depth cache-oblivious sorting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009, pp. 121-123, 2009, ACM, 978-1-60558-606-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
schedulers, parallel algorithms, multiprocessors, sorting, merging, cache-oblivious algorithms |
42 | Yuichi Asahiro, Satoshi Fujita, Ichiro Suzuki, Masafumi Yamashita |
A Self-stabilizing Marching Algorithm for a Group of Oblivious Robots. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OPODIS ![In: Principles of Distributed Systems, 12th International Conference, OPODIS 2008, Luxor, Egypt, December 15-18, 2008. Proceedings, pp. 125-144, 2008, Springer, 978-3-540-92220-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
marching, oblivious algorithm, flocking, self-stabilizing algorithm, motion coordination |
42 | Huafei Zhu |
Round Optimal Universally Composable Oblivious Transfer Protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ProvSec ![In: Provable Security, Second International Conference, ProvSec 2008, Shanghai, China, October 30 - November 1, 2008. Proceedings, pp. 328-334, 2008, Springer, 978-3-540-88732-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Double trap-door cryptosystems, simulator, oblivious transfer, universally composable |
Displaying result #1 - #100 of 2982 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|