𝔖 Bobbio Scriptorium

✦ LIBER ✦

[IEEE 23rd Annual Symposium on Foundations of Computer Science - Chicago, IL, USA (1982.11.3-1982.11.5)] 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) - Probabilistic analysis of some bin-packing problems

✍ Scribed by Karmarkar, Narendra; Karmarkar, Narendra; Karmarkar, Narendra; Karmarkar, Narendra

Book ID: 127378815
Publisher: IEEE
Year: 1982
Weight: 494 KB
Category: Article
DOI: 10.1109/sfcs.1982.37

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[IEEE 23rd Annual Symposium on Foundatio

[IEEE 23rd Annual Symposium on Foundations of Computer Science - Chicago, IL, USA (1982.11.3-1982.11.5)] 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) - Three applications of Kolmogorov-complexity

✍ Reisch, Stefan; Reisch, Stefan; Reisch, Stefan; Reisch, Stefan; Schnitger, Georg 📂 Article 📅 1982 🏛 IEEE ⚖ 577 KB

[IEEE 23rd Annual Symposium on Foundatio

[IEEE 23rd Annual Symposium on Foundations of Computer Science - Chicago, IL, USA (1982.11.3-1982.11.5)] 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) - Inferring a sequence generated by a linear congruence

✍ Plumstead, Joan B.; Plumstead, Joan B.; Plumstead, Joan B.; Plumstead, Joan B. 📂 Article 📅 1982 🏛 IEEE ⚖ 795 KB

[IEEE 23rd Annual Symposium on Foundatio

[IEEE 23rd Annual Symposium on Foundations of Computer Science - Chicago, IL, USA (1982.11.3-1982.11.5)] 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) - On the program size of perfect and universal hash functions

✍ Mehlhorn, Kurt; Mehlhorn, Kurt; Mehlhorn, Kurt; Mehlhorn, Kurt 📂 Article 📅 1982 🏛 IEEE ⚖ 543 KB

[IEEE 23rd Annual Symposium on Foundatio

[IEEE 23rd Annual Symposium on Foundations of Computer Science - Chicago, IL, USA (1982.11.3-1982.11.5)] 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) - A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem

✍ Shamir, Adi; Shamir, Adi; Shamir, Adi; Shamir, Adi 📂 Article 📅 1982 🏛 IEEE ⚖ 805 KB

[IEEE 23rd Annual Symposium on Foundatio

[IEEE 23rd Annual Symposium on Foundations of Computer Science - Chicago, IL, USA (1982.11.3-1982.11.5)] 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) - A polynomial-time reduction from bivariate to univariate integral polynomial factorization

✍ Kaltofen, Erich; Kaltofen, Erich; Kaltofen, Erich; Kaltofen, Erich 📂 Article 📅 1982 🏛 IEEE ⚖ 743 KB

[IEEE 17th Annual Symposium on Foundatio

[IEEE 17th Annual Symposium on Foundations of Computer Science (sfcs 1976) - Houston, TX, USA (1976.10.25-1976.10.27)] 17th Annual Symposium on Foundations of Computer Science (sfcs 1976) - Geometric intersection problems

✍ Shamos, Michael Ian; Hoey, Dan 📂 Article 📅 1976 🏛 IEEE ⚖ 1011 KB