Search results for "permutations"

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.	J. Cryptol.	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.	ASIACRYPT	2002	DBLP DOI BibTeX RDF
84	Yevgeniy Dodis, Leonid Reyzin	On the Power of Claw-Free Permutations.	SCN	2002	DBLP DOI BibTeX RDF
79	Jacques Patarin	Generic Attacks on Feistel Schemes.	ASIACRYPT	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.	PLDI	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.	RANDOM-APPROX	2003	DBLP DOI BibTeX RDF
68	Yuanyuan Yang 0001, Jianchao Wang	Routing Permutations on Optical Baseline Networks with Node-Disjoint Paths.	ICPADS	2004	DBLP DOI BibTeX RDF
60	Raphael Yuster	Efficient algorithms on sets of permutations, dominance, and real-weighted APSP.	SODA	2009	DBLP DOI BibTeX RDF
60	Peter Roelse	The design of composite permutations with applications to DES-like S-boxes.	Des. Codes Cryptogr.	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.	ISPAN	2002	DBLP DOI BibTeX RDF
60	Alain P. Hiltgen	Towards a Better Understanding of One-Wayness: Facing Linear Permutations.	EUROCRYPT	1998	DBLP DOI BibTeX RDF
56	Jop F. Sibeyn, Michael Kaufmann 0001, Rajeev Raman	Randomized Routing on Meshes with Buses.	ESA	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.	SPAA	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.	ASIACRYPT	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.	CPM	2007	DBLP DOI BibTeX RDF
52	Dónall A. Mac Dónaill	Molecularly Accessible Permutations.	ECAL	2003	DBLP DOI BibTeX RDF
52	Yunhong Zhou, Subhash Suri	Shape sensitive geometric permutations.	SODA	2001	DBLP BibTeX RDF
52	Steffen Heber, Jens Stoye	Finding All Common Intervals of k Permutations.	CPM	2001	DBLP DOI BibTeX RDF
52	Sridhar Hannenhalli, Pavel A. Pevzner	Transforming Cabbage into Turnip: Polynomial Algorithm for Sorting Signed Permutations by Reversals.	J. ACM	1999	DBLP DOI BibTeX RDF	computational biology, genetics
52	Tadao Takaoka	An O(1) Time Algorithm for Generating Multiset Permutations.	ISAAC	1999	DBLP DOI BibTeX RDF
51	Jacques Patarin	A Proof of Security in O(2n) for the Xor of Two Random Permutations.	ICITS	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.	STOC	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).	ASIACRYPT	1991	DBLP DOI BibTeX RDF	Permutations, DES, S-boxes
48	Markus Püschel, Peter A. Milder, James C. Hoe	Permuting streaming data using RAMs.	J. ACM	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.	CPM	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).	EUROCRYPT	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.	IEEE ACM Trans. Comput. Biol. Bioinform.	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.	Selected Areas in Cryptography	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.	IEEE ACM Trans. Comput. Biol. Bioinform.	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.	SODA	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.	J. Cryptol.	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.	SODA	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.	IEEE Trans. Inf. Forensics Secur.	2008	DBLP DOI BibTeX RDF
44	Xiaowen Lou, Daming Zhu	A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations.	COCOON	2008	DBLP DOI BibTeX RDF
44	Martin Mares, Milan Straka	Linear-Time Ranking of Permutations.	ESA	2007	DBLP DOI BibTeX RDF
44	Evelyne Contejean	Modeling Permutations in Coqfor Coccinelle.	Rewriting, Computation and Proof	2007	DBLP DOI BibTeX RDF
44	Yuanyuan Yang 0001, Jianchao Wang	Routing Permutations on Baseline Networks with Node-Disjoint Paths.	IEEE Trans. Parallel Distributed Syst.	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.	SODA	2005	DBLP BibTeX RDF
44	Akinori Kawachi, Hirotada Kobayashi, Takeshi Koshiba, Raymond H. Putra	Universal Test for Quantum One-Way Permutations.	MFCS	2004	DBLP DOI BibTeX RDF
44	Bryant A. Julstrom	Encoding Bounded-Diameter Spanning Trees with Permutations and with Random Keys.	GECCO (1)	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.	IEEE Trans. Parallel Distributed Syst.	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.	ASAP	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.	ICPP	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.	EUROCRYPT	1993	DBLP DOI BibTeX RDF
44	Luke O'Connor	On the Distribution of Characteristics in Composite Permutations.	CRYPTO	1993	DBLP DOI BibTeX RDF	iterated mapping, product cipher, Differential cryptanalysis
44	Spyros S. Magliveras, Nasir D. Memon	Random Permutations from Logarithmic Signatures.	Great Lakes Computer Science Conference	1989	DBLP DOI BibTeX RDF
43	James M. Calvin, Marvin K. Nakayama	Using Permutations in Regenerative Simulations to Reduce Variance.	ACM Trans. Model. Comput. Simul.	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].	Commun. ACM	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.	IF&GIS	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.	ICDCS	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.	Mob. Networks Appl.	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.	ISCC	2002	DBLP DOI BibTeX RDF
40	Steffen Heber, Jens Stoye	Algorithms for Finding Gene Clusters.	WABI	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.	EUROCRYPT	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.	IEEE ACM Trans. Comput. Biol. Bioinform.	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.	ASAP	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.	SPIRE	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.	IEEE Trans. Pattern Anal. Mach. Intell.	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.	ASIACRYPT	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.	Algorithmica	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.	AFRICACRYPT	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.	IEEE Trans. Inf. Theory	2008	DBLP DOI BibTeX RDF
36	Franz Franchetti, Markus Püschel	Generating SIMD Vectorized Permutations.	CC	2008	DBLP DOI BibTeX RDF
36	Andrei Asinowski, Meir Katchalski	Forbidden Families of Geometric Permutations in Rd.	Discret. Comput. Geom.	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.	SODA	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.	ESA	2005	DBLP DOI BibTeX RDF
36	Eyal Kaplan, Moni Naor, Omer Reingold	Derandomized Constructions of k-Wise (Almost) Independent Permutations.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
36	Patrice Ossona de Mendez, Pierre Rosenstiehl	Transitivity And Connectivity Of Permutations.	Comb.	2004	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05A19, 05C30
36	Iftach Haitner	Implementing Oblivious Transfer Using Collection of Dense Trapdoor Permutations.	TCC	2004	DBLP DOI BibTeX RDF
36	Shlomo Hoory, Avner Magen, Steven A. Myers, Charles Rackoff	Simple Permutations Mix Well.	ICALP	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.	Public Key Cryptography	2004	DBLP DOI BibTeX RDF
36	Ivelisse M. Rubio, Carlos J. Corrada-Bravo	Cyclic Decomposition of Permutations of Finite Fields Obtained Using Monomials.	International Conference on Finite Fields and Applications	2003	DBLP DOI BibTeX RDF
36	Andrew Solomon, Paul J. Sutcliffe, Raymond Lister	Sorting Circular Permutations by Reversal. .	WADS	2003	DBLP DOI BibTeX RDF
36	Micha Sharir, Shakhar Smorodinsky	On Neighbors in Geometric Permutations.	SWAT	2002	DBLP DOI BibTeX RDF
36	Uriel Feige, Robert Krauthgamer	Stereoscopic families of permutations, and their applications.	ISTCS	1997	DBLP DOI BibTeX RDF
36	Gábor Hetyei	On the cd-Variation Polynomials of André and Simsun Permutations.	Discret. Comput. Geom.	1996	DBLP DOI BibTeX RDF
36	Kaisa Nyberg	On the Construction of Highly Nonlinear Permutations.	EUROCRYPT	1992	DBLP DOI BibTeX RDF
36	Babak Sadeghiyan, Josef Pieprzyk	A Construction for Super Pseudorandom Permutations from A Single Pseudorandom Function.	EUROCRYPT	1992	DBLP DOI BibTeX RDF
36	Torben Hagerup	Fast Parallel Generation of Random Permutations.	ICALP	1991	DBLP DOI BibTeX RDF
35	Ueli M. Maurer, Dominik Raub	Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations.	ASIACRYPT	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.	Order	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.	J. Comput. Sci. Technol.	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.	Algorithmica	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.	WG	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.	GECCO	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.	TCC	2008	DBLP DOI BibTeX RDF
32	Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond	Fixed-Parameter Algorithms for Kemeny Scores.	AAIM	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.	IEEE ACM Trans. Comput. Biol. Bioinform.	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.	IEEE ACM Trans. Comput. Biol. Bioinform.	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.	RECOMB-CG	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.	Comparative Genomics	2006	DBLP DOI BibTeX RDF
32	Rajgopal Kannan	The KR-Benes Network: A Control-Optimal Rearrangeable Permutation Network.	IEEE Trans. Computers	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.	IEEE Trans. Speech Audio Process.	2005	DBLP DOI BibTeX RDF
32	Isaac Elias, Tzvika Hartman	A 1.375-Approximation Algorithm for Sorting by Transpositions.	WABI	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.	WABI	2005	DBLP DOI BibTeX RDF
32	Yevgeniy Dodis, Roberto Oliveira 0001, Krzysztof Pietrzak	On the Generic Insecurity of the Full Domain Hash.	CRYPTO	2005	DBLP DOI BibTeX RDF
32	Graham Cormode, S. Muthukrishnan 0001, Süleyman Cenk Sahinalp	Permutation Editing and Matching via Embeddings.	ICALP	2001	DBLP DOI BibTeX RDF
32	Josef Pieprzyk, Xian-Mo Zhang	Permutation Generators of Alternating Groups.	AUSCRYPT	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.	IEEE ACM Trans. Comput. Biol. Bioinform.	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.	CIT	2005	DBLP DOI BibTeX RDF	Tight security, Authentication, Digital signature, MAC, Deniablity, Impersonation attack, Trapdoor permutations