|
|
|
|
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.  |
AES Conference  |
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. |
WG |
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. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 49 | Mingji Xia |
Maximum Edge-Disjoint Paths Problem in Planar Graphs. |
TAMC |
2007 |
DBLP DOI BibTeX RDF |
maximum edge-disjoint paths, #P-hard, determinant |
| 49 | Peter Vrancx, Ann Nowé |
Using Pheromone Repulsion to Find Disjoint Paths. |
ANTS Workshop |
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. |
Computing |
2009 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 94A60, 11T71 |
Displaying result #1 - #6 of 6 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license