|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1189 occurrences of 725 keywords
|
|
|
Results
Found 3334 publication records. Showing 3334 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
115 | Yan-Cheng Chang, Chun-Yuan Hsiao, Chi-Jen Lu |
The Impossibility of Basing One-Way Permutations on Central Cryptographic Primitives. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Cryptol. ![In: J. Cryptol. 19(1), pp. 97-114, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Private information retrieval, Cryptographic primitives, Black-box reductions, Trapdoor functions, One-way permutations |
100 | Yan-Cheng Chang, Chun-Yun Hsiao, Chi-Jen Lu |
On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIACRYPT ![In: Advances in Cryptology - ASIACRYPT 2002, 8th International Conference on the Theory and Application of Cryptology and Information Security, Queenstown, New Zealand, December 1-5, 2002, Proceedings, pp. 110-124, 2002, Springer, 3-540-00171-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
84 | Yevgeniy Dodis, Leonid Reyzin |
On the Power of Claw-Free Permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCN ![In: Security in Communication Networks, Third International Conference, SCN 2002, Amalfi, Italy, September 11-13, 2002. Revised Papers, pp. 55-73, 2002, Springer, 3-540-00420-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
79 | Jacques Patarin |
Generic Attacks on Feistel Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIACRYPT ![In: Advances in Cryptology - ASIACRYPT 2001, 7th International Conference on the Theory and Application of Cryptology and Information Security, Gold Coast, Australia, December 9-13, 2001, Proceedings, pp. 222-238, 2001, Springer, 3-540-42987-5. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Feistel permutations, generic attacks on encryption schemes, Luby-Rackoff theory, pseudo-random permutations |
76 | Gang Ren 0002, Peng Wu 0001, David A. Padua |
Optimizing data permutations for SIMD devices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the ACM SIGPLAN 2006 Conference on Programming Language Design and Implementation, Ottawa, Ontario, Canada, June 11-14, 2006, pp. 118-131, 2006, ACM, 1-59593-320-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
SIMD compilation, data permutation, optimization |
72 | Jun Tarui, Toshiya Itoh, Yoshinori Takei |
A Nearly Linear Size 4-Min-Wise Independent Permutation Family by Finite Geometries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RANDOM-APPROX ![In: Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings, pp. 396-408, 2003, Springer, 3-540-40770-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
68 | Yuanyuan Yang 0001, Jianchao Wang |
Routing Permutations on Optical Baseline Networks with Node-Disjoint Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPADS ![In: 10th International Conference on Parallel and Distributed Systems, ICPADS 2004, Newport Beach, CA, USA, July 7-9, 2004, pp. 65-72, 2004, IEEE Computer Society, 0-7695-2152-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
60 | Raphael Yuster |
Efficient algorithms on sets of permutations, dominance, and real-weighted APSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 950-957, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
60 | Peter Roelse |
The design of composite permutations with applications to DES-like S-boxes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 42(1), pp. 21-42, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
11T71, AMS Classification 94A60 |
60 | Xiaohong Jiang 0001, Hong Shen 0001, Md. Mamun-ur-Rashid Khandker, Susumu Horiguchi |
A New Scheme to Realize Crosstalk-free Permutations in Optical MINs with Vertical Stacking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: International Symposium on Parallel Architectures, Algorithms and Networks, ISPAN 2002, May 22-24, 2002, Makati City, Metro Manila, Philippines, pp. 341-, 2002, IEEE Computer Society, 0-7695-1579-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
60 | Alain P. Hiltgen |
Towards a Better Understanding of One-Wayness: Facing Linear Permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT '98, International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31 - June 4, 1998, Proceeding, pp. 319-333, 1998, Springer, 3-540-64518-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
56 | Jop F. Sibeyn, Michael Kaufmann 0001, Rajeev Raman |
Randomized Routing on Meshes with Buses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30 - October 2, 1993, Proceedings, pp. 333-344, 1993, Springer, 3-540-57273-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
algorithms, parallel computation, lower bounds, meshes, randomization, coloring, packet routing, buses |
56 | Bogdan S. Chlebus, Stefan Dobrev, Dariusz R. Kowalski, Grzegorz Malewicz, Alexander A. Shvartsman, Imrich Vrto |
Towards practical deteministic write-all algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2001, Heraklion, Crete Island, Greece, July 4-6, 2001, pp. 271-280, 2001, ACM, 1-58113-409-6. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Write-All, contention of permutations, scheduling, parallel algorithms, work |
55 | Jacques Patarin, Valérie Nachef, Côme Berbain |
Generic Attacks on Unbalanced Feistel Schemes with Contracting Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIACRYPT ![In: Advances in Cryptology - ASIACRYPT 2006, 12th International Conference on the Theory and Application of Cryptology and Information Security, Shanghai, China, December 3-7, 2006, Proceedings, pp. 396-411, 2006, Springer, 3-540-49475-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
unbalanced Feistel permutations, generic attacks, Luby-Rackoff theory, block ciphers, pseudo-random permutations |
52 | Mathilde Bouvel, Dominique Rossin, Stéphane Vialette |
Longest Common Separable Pattern Among Permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007, Proceedings, pp. 316-327, 2007, Springer, 978-3-540-73436-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
52 | Dónall A. Mac Dónaill |
Molecularly Accessible Permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECAL ![In: Advances in Artificial Life, 7th European Conference, ECAL 2003, Dortmund, Germany, September 14-17, 2003, Proceedings, pp. 41-50, 2003, Springer, 3-540-20057-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
52 | Yunhong Zhou, Subhash Suri |
Shape sensitive geometric permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA., pp. 234-243, 2001, ACM/SIAM, 0-89871-490-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
|
52 | Steffen Heber, Jens Stoye |
Finding All Common Intervals of k Permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 12th Annual Symposium, CPM 2001 Jerusalem, Israel, July 1-4, 2001 Proceedings, pp. 207-218, 2001, Springer, 3-540-42271-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
52 | Sridhar Hannenhalli, Pavel A. Pevzner |
Transforming Cabbage into Turnip: Polynomial Algorithm for Sorting Signed Permutations by Reversals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 46(1), pp. 1-27, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
computational biology, genetics |
52 | Tadao Takaoka |
An O(1) Time Algorithm for Generating Multiset Permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 10th International Symposium, ISAAC '99, Chennai, India, December 16-18, 1999, Proceedings, pp. 237-246, 1999, Springer, 3-540-66916-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
51 | Jacques Patarin |
A Proof of Security in O(2n) for the Xor of Two Random Permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICITS ![In: Information Theoretic Security, Third International Conference, ICITS 2008, Calgary, Canada, August 10-13, 2008, Proceedings, pp. 232-248, 2008, Springer, 978-3-540-85092-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
security beyond the birthday bound, Luby-Rackoff backwards, Pseudorandom functions, pseudorandom permutations |
51 | Toshiya Itoh, Yoshinori Takei, Jun Tarui |
On the sample size of k-restricted min-wise independent permutations and other k-wise distributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, pp. 710-719, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
higher incidence matrices, linear algebra methods, min-wise independent permutations, k-wise independence |
51 | Jun-Hui Yang, Zong-Duo Dai, Kencheng Zeng |
The Data Base of Selected Permutations (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIACRYPT ![In: Advances in Cryptology - ASIACRYPT '91, International Conference on the Theory and Applications of Cryptology, Fujiyoshida, Japan, November 11-14, 1991, Proceedings, pp. 73-81, 1991, Springer, 3-540-57332-1. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
Permutations, DES, S-boxes |
48 | Markus Püschel, Peter A. Milder, James C. Hoe |
Permuting streaming data using RAMs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 56(2), pp. 10:1-10:34, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
data reordering, linear bit mapping, streaming datapath, stride permutation, Permutation, switch, RAM, connection network, matrix transposition |
48 | Tzvika Hartman |
A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 14th Annual Symposium, CPM 2003, Morelia, Michocán, Mexico, June 25-27, 2003, Proceedings, pp. 156-169, 2003, Springer, 3-540-40311-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
48 | Burton S. Kaliski Jr., Ronald L. Rivest, Alan T. Sherman |
Is the Data Encryption Standard a Group? (Preliminary Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT '85, Workshop on the Theory and Application of of Cryptographic Techniques, Linz, Austria, April 1985, Proceedings, pp. 81-95, 1985, Springer, 3-540-16468-5. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
closed cipher, cycle-detection algorithm, finite permutation group, idempotent cryptosystem, pure cipher, cryptanalysis, Data Encryption Standard (DES), multiple encryption, Birthday Paradox |
48 | Yoan Diekmann, Marie-France Sagot, Eric Tannier |
Evolution under Reversals: Parsimony and Conservation of Common Intervals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE ACM Trans. Comput. Biol. Bioinform. ![In: IEEE ACM Trans. Comput. Biol. Bioinform. 4(2), pp. 301-309, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
perfect sorting, Computational biology, genome rearrangements, sorting by reversals, common intervals, signed permutations |
48 | Johannes Blömer, Volker Krummel |
Analysis of Countermeasures Against Access Driven Cache Attacks on AES. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Selected Areas in Cryptography ![In: Selected Areas in Cryptography, 14th International Workshop, SAC 2007, Ottawa, Canada, August 16-17, 2007, Revised Selected Papers, pp. 96-109, 2007, Springer, 978-3-540-77359-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
AES, countermeasures, threat model, random permutations, cache attacks |
48 | Anthony Labarre |
New Bounds and Tractable Instances for the Transposition Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE ACM Trans. Comput. Biol. Bioinform. ![In: IEEE ACM Trans. Comput. Biol. Bioinform. 3(4), pp. 380-394, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
sorting by transpositions, permutations, Genome rearrangements |
47 | Eyal Ackerman, Gill Barequet, Ron Y. Pinter |
On the number of rectangular partitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pp. 736-745, 2004, SIAM, 0-89871-558-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
Baxter permutations, Schröder numbers, guillotine partitions, quasimonotone permutations, rectangular partitions |
47 | Joe Kilian, Erez Petrank |
An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Cryptol. ![In: J. Cryptol. 11(1), pp. 1-27, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Efficient proofs, Noninteractive zero knowledge, Efficient proofs, Noninteractive zero knowledge, Zero knowledge, Zero knowledge, Key words, One-way permutations, One-way permutations, Circuit satisfiability, Circuit satisfiability |
44 | Aaron Williams |
Loopless generation of multiset permutations using a constant number of variables by prefix shifts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 987-996, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
44 | Juan M. Estévez-Tapiador, Julio César Hernández Castro, Almudena Alcaide, Arturo Ribagorda |
On the Distinguishability of Distance-Bounded Permutations in Ordered Channels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Forensics Secur. ![In: IEEE Trans. Inf. Forensics Secur. 3(2), pp. 166-172, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
44 | Xiaowen Lou, Daming Zhu |
A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 14th Annual International Conference, COCOON 2008, Dalian, China, June 27-29, 2008, Proceedings, pp. 331-341, 2008, Springer, 978-3-540-69732-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
44 | Martin Mares, Milan Straka |
Linear-Time Ranking of Permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, pp. 187-193, 2007, Springer, 978-3-540-75519-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
44 | Evelyne Contejean |
Modeling Permutations in Coqfor Coccinelle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Rewriting, Computation and Proof ![In: Rewriting, Computation and Proof, Essays Dedicated to Jean-Pierre Jouannaud on the Occasion of His 60th Birthday, pp. 259-269, 2007, Springer, 978-3-540-73146-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
44 | Yuanyuan Yang 0001, Jianchao Wang |
Routing Permutations on Baseline Networks with Node-Disjoint Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 16(8), pp. 737-746, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
semipermutation, baseline network, link-disjoint paths, crosstalk-free, Routing, interconnects, permutation, optical interconnects, multistage networks, node-disjoint paths |
44 | Boris Aronov, Shakhar Smorodinsky |
On geometric permutations induced by lines transversal through a fixed point. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 251-256, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
44 | Akinori Kawachi, Hirotada Kobayashi, Takeshi Koshiba, Raymond H. Putra |
Universal Test for Quantum One-Way Permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2004, 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings, pp. 839-850, 2004, Springer, 3-540-22823-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
44 | Bryant A. Julstrom |
Encoding Bounded-Diameter Spanning Trees with Permutations and with Random Keys. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO (1) ![In: Genetic and Evolutionary Computation - GECCO 2004, Genetic and Evolutionary Computation Conference, Seattle, WA, USA, June 26-30, 2004, Proceedings, Part I, pp. 1272-1281, 2004, Springer, 3-540-22344-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
44 | Yuanyuan Yang 0001, Jianchao Wang |
Routing Permutations with Link-Disjoint and Node-Disjoint Paths in a Class of Self-Routable Interconnects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 14(4), pp. 383-393, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
link-disjoint paths, crosstalk-free routing, Routing, interconnects, permutation, optical interconnects, multistage networks, node-disjoint paths, Latin square, all-to-all personalized exchange |
44 | Zhijie Shi, Xiao Yang 0001, Ruby B. Lee |
Arbitrary Bit Permutations in One or Two Cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASAP ![In: 14th IEEE International Conference on Application-Specific Systems, Architectures, and Processors (ASAP 2003), 24-26 June 2003, The Hague, The Netherlands, pp. 237-, 2003, IEEE Computer Society, 0-7695-1992-X. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
44 | Yuanyuan Yang 0001, Jianchao Wang |
Routing Permutations with Link-Disjoint and Node-Disjoint Paths in a Class of Self-Routable Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP ![In: 31st International Conference on Parallel Processing (ICPP 2002), 20-23 August 2002, Vancouver, BC, Canada, pp. 239-246, 2002, IEEE Computer Society, 0-7695-1677-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
link-disjoint paths, crosstalk-free routing, Routing, interconnects, permutation, optical interconnects, multistage networks, node-disjoint paths, Latin square, all-to-all personalized exchange |
44 | Thomas Beth, Cunsheng Ding |
On Almost Perfect Nonlinear Permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT '93, Workshop on the Theory and Application of of Cryptographic Techniques, Lofthus, Norway, May 23-27, 1993, Proceedings, pp. 65-76, 1993, Springer, 3-540-57600-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
44 | Luke O'Connor |
On the Distribution of Characteristics in Composite Permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO ![In: Advances in Cryptology - CRYPTO '93, 13th Annual International Cryptology Conference, Santa Barbara, California, USA, August 22-26, 1993, Proceedings, pp. 403-412, 1993, Springer, 3-540-57766-1. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
iterated mapping, product cipher, Differential cryptanalysis |
44 | Spyros S. Magliveras, Nasir D. Memon |
Random Permutations from Logarithmic Signatures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Great Lakes Computer Science Conference ![In: Computing in the 90's, The First Great Lakes Computer Science Conference, Kalamazzo, Michigan, USA, October 18-20, 1989, Proceedings, pp. 199-205, 1989, Springer, 3-540-97628-0. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
43 | James M. Calvin, Marvin K. Nakayama |
Using Permutations in Regenerative Simulations to Reduce Variance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Model. Comput. Simul. ![In: ACM Trans. Model. Comput. Simul. 8(2), pp. 153-193, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
regenerative simulation, permutations, variance reduction, efficiency improvement |
42 | Phillip J. Chase |
Algorithm 383: permutations of a set with repetitions [G6]. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Commun. ACM ![In: Commun. ACM 13(6), pp. 368-369, 1970. The full citation details ...](Pics/full.jpeg) |
1970 |
DBLP DOI BibTeX RDF |
permutations, permutations and combinations |
40 | Alexander A. Moldovyan, Nick A. Moldovyan, Peter A. Moldovyanu |
Architecture Types of the Bit Permutation Instruction for General Purpose Processors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IF&GIS ![In: Third International Workshop on Information Fusion and Geographical Information Systems - IF&GIS'07, St. Petersburg, Russia, May 27-29, 2007. Proceedings, pp. 157-159, 2007, Springer, 978-3-540-37628-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
fast software encryption, controlled bit permutation, new CPU instruction, Cryptography |
40 | Dariusz R. Kowalski, Peter M. Musial, Alexander A. Shvartsman |
Explicit Combinatorial Structures for Cooperative Distributed Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCS ![In: 25th International Conference on Distributed Computing Systems (ICDCS 2005), 6-10 June 2005, Columbus, OH, USA, pp. 49-58, 2005, IEEE Computer Society, 0-7695-2331-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
40 | Francisco Javier Ovalle-Martínez, Julio Solano-González, Ivan Stojmenovic |
A Parallel Hill Climbing Algorithm for Pushing Dependent Data in Clients-Providers-Servers Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mob. Networks Appl. ![In: Mob. Networks Appl. 9(4), pp. 257-264, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
hill climbing algorithms, data broadcasting |
40 | Francisco Javier Ovalle-Martínez, Julio Solano-González, Ivan Stojmenovic |
A parallel hill climbing algorithm for pushing dependent data in clients-providers-servers systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCC ![In: Proceedings of the Seventh IEEE Symposium on Computers and Communications (ISCC 2002), 1-4 July 2002, Taormina, Italy, pp. 611-616, 2002, IEEE Computer Society, 0-7695-1671-8. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
40 | Steffen Heber, Jens Stoye |
Algorithms for Finding Gene Clusters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WABI ![In: Algorithms in Bioinformatics, First International Workshop, WABI 2001, Aarhus, Denmark, August 28-31, 2001, Proceedings, pp. 252-263, 2001, Springer, 3-540-42516-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
40 | Eike Kiltz, Krzysztof Pietrzak |
On the Security of Padding-Based Encryption Schemes - or - Why We Cannot Prove OAEP Secure in the Standard Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT 2009, 28th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cologne, Germany, April 26-30, 2009. Proceedings, pp. 389-406, 2009, Springer, 978-3-642-01000-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Padding-based encryption, ideal trapdoor permutations, black-box, OAEP |
40 | Isaac Elias, Tzvika Hartman |
A 1.375-Approximation Algorithm for Sorting by Transpositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE ACM Trans. Comput. Biol. Bioinform. ![In: IEEE ACM Trans. Comput. Biol. Bioinform. 3(4), pp. 369-379, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
sorting permutations by transpositions, Computational biology, genome rearrangements |
40 | Zhijie Shi, Ruby B. Lee |
Bit Permutation Instructions for Accelerating Software Cryptography. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASAP ![In: 12th IEEE International Conference on Application-Specific Systems, Architectures, and Processors (ASAP 2000), 10-12 July 2000, Boston, MA, USA, pp. 138-148, 2000, IEEE Computer Society, 0-7695-0716-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
bit-level instructions, security, cryptography, permutations, processor architecture, Instruction Set Architecture |
40 | Maria Emília Telles Walter, Zanoni Dias, João Meidanis |
A New Approach for Approximating the Tranposition Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIRE ![In: Seventh International Symposium on String Processing and Information Retrieval, SPIRE 2000, A Coruña, Spain, September 27-29, 2000, pp. 199-208, 2000, IEEE Computer Society, 0-7695-0746-8. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
transposition distance approximation, genome comparison, rearrangement distance, rearrangement events, relative gene order, similar genes, linear gene orders, breakpoint diagram, approximation algorithm, data structures, permutations, DNA, C programming language, DNA molecules |
40 | Radhakrishna S. Valiveti, B. John Oommen |
Recognizing Sources of Random Strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 13(4), pp. 386-394, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
random string sources recognition, unigram-based model, U-model, S-model, pattern recognition, statistical analysis, statistics, identification, permutations, estimation theory, estimation theory, statistical pattern recognition, syntactic pattern recognition |
39 | Jacques Patarin, Valérie Nachef, Côme Berbain |
Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIACRYPT ![In: Advances in Cryptology - ASIACRYPT 2007, 13th International Conference on the Theory and Application of Cryptology and Information Security, Kuching, Malaysia, December 2-6, 2007, Proceedings, pp. 325-341, 2007, Springer, 978-3-540-76899-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Unbalanced Feistel permutations, generic attacks on encryption schemes, Block ciphers, pseudo-random permutations |
36 | Eyal Kaplan, Moni Naor, Omer Reingold |
Derandomized Constructions of k-Wise (Almost) Independent Permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 55(1), pp. 113-133, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Card shuffling, Connectivity, Block ciphers, Random walk, Pseudo-randomness |
36 | Joana Treger, Jacques Patarin |
Generic Attacks on Feistel Networks with Internal Permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AFRICACRYPT ![In: Progress in Cryptology - AFRICACRYPT 2009, Second International Conference on Cryptology in Africa, Gammarth, Tunisia, June 21-25, 2009. Proceedings, pp. 41-59, 2009, Springer, 978-3-642-02383-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
36 | Jyh-Shyan Lin, Jen-Chun Chang, Rong-Jaye Chen, Torleiv Kløve |
Distance-Preserving and Distance-Increasing Mappings From Ternary Vectors to Permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 54(3), pp. 1334-1339, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
36 | Franz Franchetti, Markus Püschel |
Generating SIMD Vectorized Permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CC ![In: Compiler Construction, 17th International Conference, CC 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29 - April 6, 2008. Proceedings, pp. 116-131, 2008, Springer, 978-3-540-78790-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
36 | Andrei Asinowski, Meir Katchalski |
Forbidden Families of Geometric Permutations in Rd. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 34(1), pp. 1-10, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
36 | László Babai, Thomas P. Hayes |
Near-independence of permutations and an almost sure polynomial bound on the diameter of the symmetric group. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 1057-1066, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
36 | Anne Bergeron, Cédric Chauve, Fabien de Montgolfier, Mathieu Raffinot |
Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings, pp. 779-790, 2005, Springer, 3-540-29118-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
36 | Eyal Kaplan, Moni Naor, Omer Reingold |
Derandomized Constructions of k-Wise (Almost) Independent Permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization and Combinatorial Optimization, Algorithms and Techniques, 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005 and 9th InternationalWorkshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings, pp. 354-365, 2005, Springer, 3-540-28239-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
36 | Patrice Ossona de Mendez, Pierre Rosenstiehl |
Transitivity And Connectivity Of Permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 24(3), pp. 487-501, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05A19, 05C30 |
36 | Iftach Haitner |
Implementing Oblivious Transfer Using Collection of Dense Trapdoor Permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TCC ![In: Theory of Cryptography, First Theory of Cryptography Conference, TCC 2004, Cambridge, MA, USA, February 19-21, 2004, Proceedings, pp. 394-409, 2004, Springer, 3-540-21000-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
36 | Shlomo Hoory, Avner Magen, Steven A. Myers, Charles Rackoff |
Simple Permutations Mix Well. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings, pp. 770-781, 2004, Springer, 3-540-22849-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
36 | Ryotaro Hayashi 0001, Tatsuaki Okamoto, Keisuke Tanaka |
An RSA Family of Trap-Door Permutations with a Common Domain and Its Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Public Key Cryptography ![In: Public Key Cryptography - PKC 2004, 7th International Workshop on Theory and Practice in Public Key Cryptography, Singapore, March 1-4, 2004, pp. 291-304, 2004, Springer, 3-540-21018-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
36 | Ivelisse M. Rubio, Carlos J. Corrada-Bravo |
Cyclic Decomposition of Permutations of Finite Fields Obtained Using Monomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Finite Fields and Applications ![In: Finite Fields and Applications, 7th International Conference, Fq7, Toulouse, France, May 5-9, 2003, Revised Papers, pp. 254-261, 2003, Springer, 3-540-21324-4. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
36 | Andrew Solomon, Paul J. Sutcliffe, Raymond Lister |
Sorting Circular Permutations by Reversal. . ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings, pp. 319-328, 2003, Springer, 3-540-40545-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
36 | Micha Sharir, Shakhar Smorodinsky |
On Neighbors in Geometric Permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2002, 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings, pp. 131-139, 2002, Springer, 3-540-43866-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
36 | Uriel Feige, Robert Krauthgamer |
Stereoscopic families of permutations, and their applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISTCS ![In: Fifth Israel Symposium on Theory of Computing and Systems, ISTCS 1997, Ramat-Gan, Israel, June 17-19, 1997, Proceedings, pp. 85-95, 1997, IEEE Computer Society, 0-8186-8037-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
36 | Gábor Hetyei |
On the cd-Variation Polynomials of André and Simsun Permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 16(3), pp. 259-275, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
36 | Kaisa Nyberg |
On the Construction of Highly Nonlinear Permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT '92, Workshop on the Theory and Application of of Cryptographic Techniques, Balatonfüred, Hungary, May 24-28, 1992, Proceedings, pp. 92-98, 1992, Springer, 3-540-56413-6. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
36 | Babak Sadeghiyan, Josef Pieprzyk |
A Construction for Super Pseudorandom Permutations from A Single Pseudorandom Function. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT '92, Workshop on the Theory and Application of of Cryptographic Techniques, Balatonfüred, Hungary, May 24-28, 1992, Proceedings, pp. 267-284, 1992, Springer, 3-540-56413-6. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
36 | Torben Hagerup |
Fast Parallel Generation of Random Permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 18th International Colloquium, ICALP91, Madrid, Spain, July 8-12, 1991, Proceedings, pp. 405-416, 1991, Springer, 3-540-54233-7. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
35 | Ueli M. Maurer, Dominik Raub |
Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIACRYPT ![In: Advances in Cryptology - ASIACRYPT 2007, 13th International Conference on the Theory and Application of Cryptology and Information Security, Kuching, Malaysia, December 2-6, 2007, Proceedings, pp. 427-443, 2007, Springer, 978-3-540-76899-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Black-box fields, computational algebra, homomorphic encryption, generic algorithms, one-way permutations |
35 | Elena Barcucci, Antonio Bernini, Luca Ferrari 0001, Maddalena Poneti |
A Distributive Lattice Structure Connecting Dyck Paths, Noncrossing Partitions and 312-avoiding Permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 22(4), pp. 311-328, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Dyck paths, noncrossing partitions, 312-avoiding permutations, Bell and Catalan numbers, strong Bruhat order, distributive lattice |
35 | Ruby B. Lee, Xiao Yang 0001, Zhijie Shi |
Single-Cycle Bit Permutations with MOMR Execution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Sci. Technol. ![In: J. Comput. Sci. Technol. 20(5), pp. 577-585, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
bit permutations, cryptographic acceleration, multi-word operation, datarich execution, MOMR, high performance secure computing, security, cryptography, permutation, processor, instruction set architecture, ISA |
35 | Thomas H. Cormen, James C. Clippinger |
Performing BMMC Permutations Efficiently on Distributed-Memory Multiprocessors with MPI. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 24(3-4), pp. 349-370, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
BMMC permutations, MPI, Affine transformations, Distributed-memory multiprocessors |
35 | Olivier Baudon, Guillaume Fertin, Ivan Havel |
Routing Permutations in the Hypercube. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 25th International Workshop, WG '99, Ascona, Switzerland, June 17-19, 1999, Proceedings, pp. 179-190, 1999, Springer, 3-540-66731-8. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
routing permutations, Szymanski's conjecture, 2-1 routing requests, Hypercubes |
32 | François-Michel De Rainville, Christian Gagné 0001, Olivier Teytaud, Denis Laurendeau |
Optimizing low-discrepancy sequences with an evolutionary algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2009, Proceedings, Montreal, Québec, Canada, July 8-12, 2009, pp. 1491-1498, 2009, ACM, 978-1-60558-325-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
orthogonal latin hypercube, quasi-random, scrambled halton, evolutionary algorithms, combinatorial optimization, discrepancy |
32 | Iftach Haitner, Jonathan J. Hoch, Gil Segev 0001 |
A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TCC ![In: Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008., pp. 445-464, 2008, Springer, 978-3-540-78523-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
32 | Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond |
Fixed-Parameter Algorithms for Kemeny Scores. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAIM ![In: Algorithmic Aspects in Information and Management, 4th International Conference, AAIM 2008, Shanghai, China, June 23-25, 2008. Proceedings, pp. 60-71, 2008, Springer, 978-3-540-68865-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
32 | Sèverine Bérard, Anne Bergeron, Cédric Chauve, Christophe Paul |
Perfect Sorting by Reversals Is Not Always Difficult. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE ACM Trans. Comput. Biol. Bioinform. ![In: IEEE ACM Trans. Comput. Biol. Bioinform. 4(1), pp. 4-16, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Evolution scenarios, reversals, common intervals |
32 | Guillaume Blin, Cédric Chauve, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette |
Comparing Genomes with Duplications: A Computational Complexity Point of View. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE ACM Trans. Comput. Biol. Bioinform. ![In: IEEE ACM Trans. Comput. Biol. Bioinform. 4(4), pp. 523-534, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
maximum adjacency disruption number, summed adjacency disruption number, computational complexity, Comparative genomics, common intervals |
32 | Simon Gog, Martin Bader |
How to Achieve an Equivalent Simple Permutation in Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RECOMB-CG ![In: Comparative Genomics, RECOMB 2007 International Workshop, RECOMB-CG 2007, San Diego, CA, USA, September 16-18, 2007, Proceedings, pp. 58-68, 2007, Springer, 978-3-540-74959-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
32 | Zaky Adam, Monique Turmel, Claude Lemieux, David Sankoff |
Common Intervals and Symmetric Difference in a Model-Free Phylogenomics, with an Application to Streptophyte Evolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comparative Genomics ![In: Comparative Genomics, RECOMB 2006 International Workshop, RCG 2006, Montreal, Canada, September 24-26, 2006, Proceedings, pp. 63-74, 2006, Springer, 3-540-44529-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
32 | Rajgopal Kannan |
The KR-Benes Network: A Control-Optimal Rearrangeable Permutation Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 54(5), pp. 534-544, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
optimal control algorithm, Benes network, rearrangeability |
32 | Muhammad Z. Ikram, Dennis R. Morgan |
Permutation inconsistency in blind speech separation: investigation and solutions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Speech Audio Process. ![In: IEEE Trans. Speech Audio Process. 13(1), pp. 1-13, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
32 | Isaac Elias, Tzvika Hartman |
A 1.375-Approximation Algorithm for Sorting by Transpositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WABI ![In: Algorithms in Bioinformatics, 5th International Workshop, WABI 2005, Mallorca, Spain, October 3-6, 2005, Proceedings, pp. 204-215, 2005, Springer, 3-540-29008-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
32 | Sèverine Bérard, Anne Bergeron, Cédric Chauve, Christophe Paul |
Perfect Sorting by Reversals Is Not Always Difficult. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WABI ![In: Algorithms in Bioinformatics, 5th International Workshop, WABI 2005, Mallorca, Spain, October 3-6, 2005, Proceedings, pp. 228-238, 2005, Springer, 3-540-29008-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
32 | Yevgeniy Dodis, Roberto Oliveira 0001, Krzysztof Pietrzak |
On the Generic Insecurity of the Full Domain Hash. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO ![In: Advances in Cryptology - CRYPTO 2005: 25th Annual International Cryptology Conference, Santa Barbara, California, USA, August 14-18, 2005, Proceedings, pp. 449-466, 2005, Springer, 3-540-28114-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
32 | Graham Cormode, S. Muthukrishnan 0001, Süleyman Cenk Sahinalp |
Permutation Editing and Matching via Embeddings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings, pp. 481-492, 2001, Springer, 3-540-42287-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
32 | Josef Pieprzyk, Xian-Mo Zhang |
Permutation Generators of Alternating Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AUSCRYPT ![In: Advances in Cryptology - AUSCRYPT '90, International Conference on Cryptology, Sydney, Australia, January 8-11, 1990, Proceedings, pp. 237-244, 1990, Springer, 3-540-53000-2. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
32 | Marília D. V. Braga, Marie-France Sagot, Céline Scornavacca, Eric Tannier |
Exploring the Solution Space of Sorting by Reversals, with Experiments and an Application to Evolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE ACM Trans. Comput. Biol. Bioinform. ![In: IEEE ACM Trans. Comput. Biol. Bioinform. 5(3), pp. 348-356, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
perfect sorting, sex chromosomes, evolution, genome rearrangements, sorting by reversals, common intervals, signed permutations |
32 | Haifeng Qian, Zhenfu Cao, Lichen Wang, Qingshui Xue |
Efficient Non-interactive Deniable Authentication Protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIT ![In: Fifth International Conference on Computer and Information Technology (CIT 2005), 21-23 September 2005, Shanghai, China, pp. 673-679, 2005, IEEE Computer Society, 0-7695-2432-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Tight security, Authentication, Digital signature, MAC, Deniablity, Impersonation attack, Trapdoor permutations |
Displaying result #1 - #100 of 3334 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|