The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for knapsacks with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1978-1990 (18) 1991-2002 (16) 2003-2006 (16) 2007-2010 (18) 2011-2013 (17) 2014-2018 (19) 2019-2022 (28) 2023-2024 (12)
Publication types (Num. hits)
article(71) inproceedings(71) phdthesis(2)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 43 occurrences of 30 keywords

Results
Found 144 publication records. Showing 144 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
95Phong Q. Nguyen, Jacques Stern Adapting Density Attacks to Low-Weight Knapsacks. Search on Bibsonomy ASIACRYPT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Lattices, Knapsack, Public-Key Cryptanalysis, Subset Sum
95F. Jorissen, Joos Vandewalle, René Govaerts Extension of Brickell's Algorithm for Breaking High Density Knapsacks. Search on Bibsonomy EUROCRYPT The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
59Quentin Louveaux, Robert Weismantel Polyhedral properties for the intersection of two knapsacks. Search on Bibsonomy Math. Program. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
59Bo Qin, Qianhong Wu, Willy Susilo, Yi Mu 0001, Yumin Wang Zero-Knowledge Proof of Generalized Compact Knapsacks (or A Novel Identification/Signature Scheme). Search on Bibsonomy ATC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
55Zhenbo Wang, Wenxun Xing A successive approximation algorithm for the multiple knapsack problem. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Approximation algorithm, Worst-case analysis, Multiple knapsack problem
55Tugba Saraç, Aydin Sipahioglu A Genetic Algorithm for the Quadratic Multiple Knapsack Problem. Search on Bibsonomy BVAI The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Quadratic Multiple Knapsack Problem, Genetic Algorithm, Combinatorial Optimization
55Amanda Hiley, Bryant A. Julstrom The quadratic multiple knapsack problem and three heuristic approaches to it. Search on Bibsonomy GECCO The full citation details ... 2006 DBLP  DOI  BibTeX  RDF quadratic multiple knapsack problem, genetic algorithm, knapsack problems, greedy heuristic, hill-climber
45Xiaocheng Li, Chunlin Sun, Yinyu Ye 0001 The Symmetry between Arms and Knapsacks: A Primal-Dual Approach for Bandits with Knapsacks. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
45Xiaocheng Li, Chunlin Sun, Yinyu Ye 0001 The Symmetry between Arms and Knapsacks: A Primal-Dual Approach for Bandits with Knapsacks. Search on Bibsonomy ICML The full citation details ... 2021 DBLP  BibTeX  RDF
41Daniele Micciancio Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions. Search on Bibsonomy Comput. Complex. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF 11H06, Subject classification. 68Q17, 94B15
41Yeow Meng Chee, Antoine Joux, Jacques Stern The Cryptanalysis of a New Public-Key Cryptosystem Based on Modular Knapsacks. Search on Bibsonomy CRYPTO The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
41Valtteri Niemi A New Trapdoor in Knapsacks. Search on Bibsonomy EUROCRYPT The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
41Ernest F. Brickell Breaking Iterated Knapsacks. Search on Bibsonomy CRYPTO The full citation details ... 1984 DBLP  DOI  BibTeX  RDF
36Urszula Boryczka Ants and Multiple Knapsack Problem. Search on Bibsonomy CISIM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF combinatorial optimization, ant colony optimization, multiple knapsack problem
36Aameek Singh, Madhukar R. Korupolu, Bhuvan Bamba Integrated resource allocation in heterogeneous SAN data centers. Search on Bibsonomy PODC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF SAN resource management, integrated allocation
36Alper Atamtürk Cover and Pack Inequalities for (Mixed) Integer Programming. Search on Bibsonomy Ann. Oper. Res. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF knapsack polyhedra, superadditive functions, integer programming, lifting
36Ravindra K. Ahuja, Claudio Barbieri da Cunha Very Large-Scale Neighborhood Search for the K-Constraint Multiple Knapsack Problem. Search on Bibsonomy J. Heuristics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF neighborhood search algorithms, heuristics, knapsack problem
36John M. Wilson 0001 An Algorithm for the Generalized Assignment Problem with Special Ordered Sets. Search on Bibsonomy J. Heuristics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF generalized assignment, special ordered sets, heuristics, assignment
36Hadas Shachnai, Tami Tamir Approximation Schemes for Generalized 2-Dimensional Vector Packing with Application to Data Placement. Search on Bibsonomy RANDOM-APPROX The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
36Jacques Patarin How to Find and Avoid Collisions for the Knapsack Hash Function. Search on Bibsonomy EUROCRYPT The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
33Jon Lee 0001, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko Non-monotone submodular maximization under matroid and knapsack constraints. Search on Bibsonomy STOC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF approximation algorithms, matroids, knapsacks, submodular functions
33Mhand Hifi, Hedi M'Halla, Slim Sadfi Sensitivity of the Optimum to Perturbations of the Profit or Weight of an Item in the Binary Knapsack Problem. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF optimality, combinatorial optimization, sensitivity analysis, knapsacks
22Simona Mancini, Carlo Meloni, Michele Ciavotta A decomposition approach for multidimensional knapsacks with family-split penalties. Search on Bibsonomy Int. Trans. Oper. Res. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
22Giannis Fikioris, Éva Tardos Approximately Stationary Bandits with Knapsacks. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
22Wanteng Ma, Dong Xia, Jiashuo Jiang High-dimensional Linear Bandits with Knapsacks. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
22Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Federico Fusco Bandits with Replenishable Knapsacks: the Best of both Worlds. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
22Evgenii Chzhen, Christophe Giraud 0002, Zhen Li, Gilles Stoltz Small Total-Cost Constraints in Contextual Bandits with Knapsacks, with Application to Fairness. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
22Yichuan Deng 0002, Michalis Mamakos, Zhao Song 0002 Clustered Linear Contextual Bandits with Knapsacks. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
22Evgenii Chzhen, Christophe Giraud 0002, Zhen Li, Gilles Stoltz Small Total-Cost Constraints in Contextual Bandits with Knapsacks, with Application to Fairness. Search on Bibsonomy NeurIPS The full citation details ... 2023 DBLP  BibTeX  RDF
22Giannis Fikioris, Éva Tardos Approximately Stationary Bandits with Knapsacks. Search on Bibsonomy COLT The full citation details ... 2023 DBLP  BibTeX  RDF
22Daniel E. Macedo, Marcus M. Bezerra, Danilo F. S. Santos, Angelo Perkusich Orchestrating Fog Computing Resources Based on the Multi-dimensional Multiple Knapsacks Problem. Search on Bibsonomy AINA (2) The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
22Lixing Lyu, Wang Chi Cheung Bandits with Knapsacks: Advice on Time-Varying Demands. Search on Bibsonomy ICML The full citation details ... 2023 DBLP  BibTeX  RDF
22Shaoang Li, Lan Zhang 0002, Yingqi Yu, Xiangyang Li 0001 Optimal Arms Identification with Knapsacks. Search on Bibsonomy ICML The full citation details ... 2023 DBLP  BibTeX  RDF
22Yuxuan Han, Jialin Zeng, Yang Wang, Yang Xiang, Jiheng Zhang Optimal Contextual Bandits with Knapsacks under Realizability via Regression Oracles. Search on Bibsonomy AISTATS The full citation details ... 2023 DBLP  BibTeX  RDF
22Nicole Immorlica, Karthik Abinav Sankararaman, Robert E. Schapire, Aleksandrs Slivkins Adversarial Bandits with Knapsacks. Search on Bibsonomy J. ACM The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
22Zhen Li, Gilles Stoltz Contextual Bandits with Knapsacks for a Conversion Model. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
22Raunak Kumar, Robert Kleinberg Non-monotonic Resource Utilization in the Bandits with Knapsacks Problem. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
22Shang Liu, Jiashuo Jiang, Xiaocheng Li Non-stationary Bandits with Knapsacks. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
22Yuxuan Han, Jialin Zeng, Yang Wang 0020, Yang Xiang, Jiheng Zhang Optimal Contextual Bandits with Knapsacks under Realizibility via Regression Oracles. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
22Rui Ai 0002, Zhaohua Chen 0001, Xiaotie Deng, Yuqi Pan, Chang Wang 0004, Mingwei Yang 0002 On the Re-Solving Heuristic for (Binary) Contextual Bandits with Knapsacks. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
22Matteo Castiglioni, Andrea Celli, Christian Kroer Online Learning with Knapsacks: the Best of Both Worlds. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  BibTeX  RDF
22Aleksandrs Slivkins, Dylan J. Foster Efficient Contextual Bandits with Knapsacks via Regression. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
22Joo Woo, Kwangsu Lee, Jong Hwan Park GCKSign: Simple and Efficient Signatures from Generalized Compact Knapsacks. Search on Bibsonomy IACR Cryptol. ePrint Arch. The full citation details ... 2022 DBLP  BibTeX  RDF
22Hangfan Li, Xiaoxiong Zhong, Yun Ji, Xinghan Wang, Sheng Zhang Batch based Multi-Arm Bandits with Knapsacks for Tasks Allocation in MEC. Search on Bibsonomy ICCC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
22Zhen Li, Gilles Stoltz Contextual Bandits with Knapsacks for a Conversion Model. Search on Bibsonomy NeurIPS The full citation details ... 2022 DBLP  BibTeX  RDF
22Shang Liu, Jiashuo Jiang, Xiaocheng Li Non-stationary Bandits with Knapsacks. Search on Bibsonomy NeurIPS The full citation details ... 2022 DBLP  BibTeX  RDF
22Qingsong Liu, Weihang Xu, Siwei Wang 0002, Zhixuan Fang Combinatorial Bandits with Linear Constraints: Beyond Knapsacks and Fairness. Search on Bibsonomy NeurIPS The full citation details ... 2022 DBLP  BibTeX  RDF
22Raunak Kumar, Robert Kleinberg Non-monotonic Resource Utilization in the Bandits with Knapsacks Problem. Search on Bibsonomy NeurIPS The full citation details ... 2022 DBLP  BibTeX  RDF
22Vidyashankar Sivakumar, Shiliang Zuo, Arindam Banerjee 0001 Smoothed Adversarial Linear Contextual Bandits with Knapsacks. Search on Bibsonomy ICML The full citation details ... 2022 DBLP  BibTeX  RDF
22Matteo Castiglioni, Andrea Celli, Christian Kroer Online Learning with Knapsacks: the Best of Both Worlds. Search on Bibsonomy ICML The full citation details ... 2022 DBLP  BibTeX  RDF
22Abdellah Aznag, Vineet Goyal, Noémie Périvier MNL-Bandit with Knapsacks. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
22Abdellah Aznag, Vineet Goyal, Noémie Périvier MNL-Bandit with Knapsacks. Search on Bibsonomy EC The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
22Karthik Abinav Sankararaman, Aleksandrs Slivkins Bandits with Knapsacks beyond the Worst Case. Search on Bibsonomy NeurIPS The full citation details ... 2021 DBLP  BibTeX  RDF
22Wenbo Ren, Jia Liu 0002, Ness B. Shroff On Logarithmic Regret for Bandits with Knapsacks. Search on Bibsonomy CISS The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
22Karthik Abinav Sankararaman, Aleksandrs Slivkins Advances in Bandits with Knapsacks. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
22Thomas Kesselheim, Sahil Singla 0001 Online Learning with Vector Costs and Bandits with Knapsacks. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
22Vanja Doskoc, Tobias Friedrich 0001, Andreas Göbel 0001, Aneta Neumann, Frank Neumann 0001, Francesco Quinzan Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings. Search on Bibsonomy ECAI The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
22Thomas Kesselheim, Sahil Singla 0001 Online Learning with Vector Costs and Bandits with Knapsacks. Search on Bibsonomy COLT The full citation details ... 2020 DBLP  BibTeX  RDF
22Vanja Doskoc, Tobias Friedrich 0001, Andreas Göbel 0001, Frank Neumann 0001, Aneta Neumann, Francesco Quinzan Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
22Nicole Immorlica, Karthik Abinav Sankararaman, Robert E. Schapire, Aleksandrs Slivkins Adversarial Bandits with Knapsacks. Search on Bibsonomy FOCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
22Yuan Ping, Baocang Wang, Shengli Tian, Yuehua Yang, Genyuan Du Deterministic lattice reduction on knapsacks with collision-free properties. Search on Bibsonomy IET Inf. Secur. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
22Lin Chen 0009, Guochuan Zhang Packing Groups of Items into Multiple Knapsacks. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
22Theo Karaboghossian, Michele Zito 0001 Easy knapsacks and the complexity of energy allocation problems in the smart grid. Search on Bibsonomy Optim. Lett. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
22Ashwinkumar Badanidiyuru, Robert Kleinberg, Aleksandrs Slivkins Bandits with Knapsacks. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
22Nicole Immorlica, Karthik Abinav Sankararaman, Robert E. Schapire, Aleksandrs Slivkins Adversarial Bandits with Knapsacks. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
22Hau Chan, Long Tran-Thanh, Bryan Wilder, Eric Rice, Phebe Vayanos, Milind Tambe Utilizing Housing Resources for Homeless Youth Through the Lens of Multiple Multi-Dimensional Knapsacks. Search on Bibsonomy AIES The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
22Karthik Abinav Sankararaman, Aleksandrs Slivkins Combinatorial Semi-Bandits with Knapsacks. Search on Bibsonomy AISTATS The full citation details ... 2018 DBLP  BibTeX  RDF
22Karthik Abinav Sankararaman, Aleksandrs Slivkins Semi-Bandits with Knapsacks. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
22Akshay Gupte Convex hulls of superincreasing knapsacks and lexicographic orderings. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
22Lin Chen 0009, Guochuan Zhang Packing Groups of Items into Multiple Knapsacks. Search on Bibsonomy STACS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
22Shipra Agrawal 0001, Nikhil R. Devanur Linear Contextual Bandits with Knapsacks. Search on Bibsonomy NIPS The full citation details ... 2016 DBLP  BibTeX  RDF
22Shipra Agrawal 0001, Nikhil R. Devanur, Lihong Li 0001 An efficient algorithm for contextual bandits with knapsacks, and an extension to concave objectives. Search on Bibsonomy COLT The full citation details ... 2016 DBLP  BibTeX  RDF
22Arthur Flajolet, Patrick Jaillet Low regret bounds for Bandits with Knapsacks. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
22Qinglong Wang, Xiangmo Zhao 随机背包公钥密码的分析与改进 (Analysis and Improvement of Public Key Cryptosystem Using Random Knapsacks). Search on Bibsonomy 计算机科学 The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
22Avinash Bhardwaj Binary Conic Quadratic Knapsacks. Search on Bibsonomy 2015   RDF
22Shipra Agrawal 0001, Nikhil R. Devanur Bandits with concave rewards and convex knapsacks. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
22Haitao Yu 0006, Fuji Ren Search Result Diversification via Filling Up Multiple Knapsacks. Search on Bibsonomy CIKM The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
22Shipra Agrawal 0001, Nikhil R. Devanur Bandits with concave rewards and convex knapsacks. Search on Bibsonomy EC The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
22Yao-Zhang Huang, Ching-Tsung Hsueh, Yi-Ju Chiang, Yen-Chieh Ouyang A New Cryptosystem Based on Three Knapsacks with Plaintext Encoding. Search on Bibsonomy ICS The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
22Ashwinkumar Badanidiyuru, Robert Kleinberg, Aleksandrs Slivkins Bandits with Knapsacks Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
22Ashwinkumar Badanidiyuru, Robert Kleinberg, Aleksandrs Slivkins Bandits with Knapsacks. Search on Bibsonomy FOCS The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
22Tong Li, Shenghui Su Analysis of Success Rate of Attacking Knapsacks from JUNA Cryptosystem by LLL Lattice Basis Reduction. Search on Bibsonomy CIS The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
22Itai Dinur, Orr Dunkelman, Nathan Keller, Adi Shamir Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems. Search on Bibsonomy IACR Cryptol. ePrint Arch. The full citation details ... 2012 DBLP  BibTeX  RDF
22Iskander Aliev, Martin Henk LLL-reduction for integer knapsacks. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
22Valeriy O. Osipyan Building of alphabetic data protection cryptosystems on the base of equal power knapsacks with Diophantine problems. Search on Bibsonomy SIN The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
22Yuji Nagashima, Noboru Kunihiro Faster Algorithm for Solving Hard Knapsacks for Moderate Message Length. Search on Bibsonomy ACISP The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
22Orr Dunkelman From Multiple Encryption to Knapsacks - Efficient Dissection of Composite Problems. Search on Bibsonomy INDOCRYPT The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
22Itai Dinur, Orr Dunkelman, Nathan Keller, Adi Shamir Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems. Search on Bibsonomy CRYPTO The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
22Christina Büsing, Arie M. C. A. Koster, Manuel Kutschka Recoverable robust knapsacks: the discrete scenario case. Search on Bibsonomy Optim. Lett. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
22Anupam Gupta 0001, Ravishankar Krishnaswamy, Marco Molinaro 0001, R. Ravi 0001 Approximation Algorithms for Correlated Knapsacks and Non-Martingale Bandits Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
22Anja Becker 0001, Jean-Sébastien Coron, Antoine Joux Improved Generic Algorithms for Hard Knapsacks. Search on Bibsonomy IACR Cryptol. ePrint Arch. The full citation details ... 2011 DBLP  BibTeX  RDF
22Daniele Micciancio, Petros Mol Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions. Search on Bibsonomy IACR Cryptol. ePrint Arch. The full citation details ... 2011 DBLP  BibTeX  RDF
22Anupam Gupta 0001, Ravishankar Krishnaswamy, Marco Molinaro 0001, R. Ravi 0001 Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits. Search on Bibsonomy FOCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
22Anja Becker 0001, Jean-Sébastien Coron, Antoine Joux Improved Generic Algorithms for Hard Knapsacks. Search on Bibsonomy EUROCRYPT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
22Christina Büsing, Arie M. C. A. Koster, Manuel Kutschka Recoverable Robust Knapsacks: Γ-Scenarios. Search on Bibsonomy INOC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
22Daniele Micciancio, Petros Mol Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions. Search on Bibsonomy CRYPTO The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
22Iskander Aliev, Martin Henk Feasibility of Integer Knapsacks. Search on Bibsonomy SIAM J. Optim. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
22Yingdong Lu, Mark S. Squillante On approximations for multiple multidimensional stochastic knapsacks. Search on Bibsonomy SIGMETRICS Perform. Evaluation Rev. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
22Nick Howgrave-Graham, Antoine Joux New generic algorithms for hard knapsacks. Search on Bibsonomy IACR Cryptol. ePrint Arch. The full citation details ... 2010 DBLP  BibTeX  RDF
22Nick Howgrave-Graham, Antoine Joux New Generic Algorithms for Hard Knapsacks. Search on Bibsonomy EUROCRYPT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 144 (100 per page; Change: )
Pages: [1][2][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license