|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 9 occurrences of 9 keywords
|
|
|
Results
Found 6 publication records. Showing 6 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
160 | Liam Keliher |
Refined Analysis of Bounds Related to Linear and Differential Cryptanalysis for the AES. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AES Conference ![In: Advanced Encryption Standard - AES, 4th International Conference, AES 2004, Bonn, Germany, May 10-12, 2004, Revised Selected and Invited Papers, pp. 42-57, 2004, Springer, 3-540-26557-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
SPN, MELP, MEDP, KMT2, KMT2-DC, AES, provable security, differential cryptanalysis, Rijndael, linear cryptanalysis |
99 | Paz Carmi, Thomas Erlebach, Yoshio Okamoto |
Greedy Edge-Disjoint Paths in Complete Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers, pp. 143-155, 2003, Springer, 3-540-20452-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Shortening lemma, Approximation algorithm, Greedy algorithm |
74 | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
Edge-Disjoint Paths in Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 45th Symposium on Foundations of Computer Science (FOCS 2004), 17-19 October 2004, Rome, Italy, Proceedings, pp. 71-80, 2004, IEEE Computer Society, 0-7695-2228-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
49 | Mingji Xia |
Maximum Edge-Disjoint Paths Problem in Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings, pp. 566-572, 2007, Springer, 978-3-540-72503-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
maximum edge-disjoint paths, #P-hard, determinant |
49 | Peter Vrancx, Ann Nowé |
Using Pheromone Repulsion to Find Disjoint Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ANTS Workshop ![In: Ant Colony Optimization and Swarm Intelligence, 5th International Workshop, ANTS 2006, Brussels, Belgium, September 4-7, 2006, Proceedings, pp. 522-523, 2006, Springer, 3-540-38482-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Joan Daemen, Mario Lamberger, Norbert Pramstaller, Vincent Rijmen, Frederik Vercauteren |
Computational aspects of the expected differential probability of 4-round AES and AES-like ciphers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 85(1-2), pp. 85-104, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 94A60, 11T71 |
Displaying result #1 - #6 of 6 (100 per page; Change: )
|
|