✦ LIBER ✦

[Lecture Notes in Computer Science] Computing and Combinatorics Volume 7936 || Time/Memory/Data Tradeoffs for Variants of the RSA Problem

✍ Scribed by Du, Ding-Zhu; Zhang, Guochuan

Book ID: 120527331
Publisher: Springer Berlin Heidelberg
Year: 2013
Tongue: English
Weight: 233 KB
Edition: 2
Category: Article
ISBN: 3642387683
DOI: 10.1007/978-3-642-38768-5_57

No coin nor oath required. For personal study only.

✦ Synopsis

This book constitutes the refereed proceedings of the 19th International Conference on Computing and Combinatorics, COCOON 2013, held in Hangzhou, China, in June 2013. The 56 revised full papers presented were carefully reviewed and selected from 120 submissions. There was a co-organized workshop on discrete algorithms of which 8 short papers were accepted and a workshop on computational social networks where 12 papers out of 25 submissions were accepted.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Comp

[Lecture Notes in Computer Science] Computing and Combinatorics Volume 6842 || Task Ordering and Memory Management Problem for Degree of Parallelism Estimation

✍ Fu, Bin; Du, Ding-Zhu 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 284 KB

This book constitutes the refereed proceedings of the 17th Annual International Conference on Computing and Combinatorics, held in Dallas, TX, USA, in August 2011. The 54 revised full papers presented were carefully reviewed and selected from 136 submissions. Topics covered are algorithms and data s

[Lecture Notes in Computer Science] Adva

[Lecture Notes in Computer Science] Advances in Cryptology — ASIACRYPT 2000 Volume 1976 || Cryptanalytic Time/Memory/Data Tradeoffs for Stream Ciphers

✍ Okamoto, Tatsuaki 📂 Article 📅 2000 🏛 Springer Berlin Heidelberg ⚖ 177 KB

[Lecture Notes in Computer Science] Comp

[Lecture Notes in Computer Science] Computing and Combinatorics Volume 6842 || Computing the Girth of a Planar Graph in Linear Time

✍ Fu, Bin; Du, Ding-Zhu 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 246 KB

[Lecture Notes in Computer Science] Comp

[Lecture Notes in Computer Science] Computing and Combinatorics Volume 3595 || A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem

✍ Wang, Lusheng 📂 Article 📅 2005 🏛 Springer Berlin Heidelberg ⚖ 226 KB

[Lecture Notes in Computer Science] Math

[Lecture Notes in Computer Science] Mathematical Foundations of Computer Science 2007 Volume 4708 || A Linear Time Algorithm for the k Maximal Sums Problem

✍ Kučera, Luděk; Kučera, Antonín 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 536 KB

This book constitutes the refereed proceedings of the 32nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2007, held in Ceský Krumlov, Czech Republic, August 2007. The 61 revised full papers presented together with the full papers or abstracts of five invited talks add

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Data Structures Volume 955 || Improved length bounds for the shortest superstring problem

✍ Akl, Selim G.; Dehne, Frank; Sack, Jörg-Rüdiger; Santoro, Nicola 📂 Article 📅 1995 🏛 Springer Berlin Heidelberg ⚖ 740 KB