A Technique for Constructing Symmetric Designs
Designs, Codes and Cryptography
Some New Results on Key Distribution Patterns and BroadcastEncryption
Designs, Codes and Cryptography
A Gracefully Degradable Declustered RAID Architecture
Cluster Computing
Adaptive Versus Nonadaptive Attribute-Efficient Learning
Machine Learning
Discrete Mathematics
Overlarge sets of 2-(11, 5, 2) designs and related configurations
Discrete Mathematics
Modified group divisible designs with block size 5 and λ = 1
Discrete Mathematics
Covering Arrays of Strength Three
Designs, Codes and Cryptography
Designs in Product Association Schemes
Designs, Codes and Cryptography
Combinatorial Bounds on Authentication Codes with Arbitration
Designs, Codes and Cryptography
The Existence of Four HMOLS with Equal Sized Holes
Designs, Codes and Cryptography
Combinatorial design of multi-ring networks with combined routing and flow control
Computer Networks: The International Journal of Computer and Telecommunications Networking
The existence of three idempotent IMOLS
Discrete Mathematics
Multiple access communications using combinatorial designs
Theoretical aspects of computer science
Key Preassigned Traceability Schemes for Broadcast Encryption
SAC '98 Proceedings of the Selected Areas in Cryptography
A Combinatorial Approach to Asymmetric Traitor Tracing
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Groups and Constraints: Symmetry Breaking during Search
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Designs, Intersecting Families, and Weight of Boolean Functions
Proceedings of the 7th IMA International Conference on Cryptography and Coding
Authenticating Multicast Streams in Lossy Channels Using Threshold Techniques
ICN '01 Proceedings of the First International Conference on Networking-Part 2
The anti-Oberwolfach solution: pancyclic 2-factorizations of complete graphs
Theoretical Computer Science - Latin American theoretical informatics
A New Class of Designs Which Protect against Quantum Jumps
Designs, Codes and Cryptography
Some New Maximal Sets of Mutually Orthogonal Latin Squares
Designs, Codes and Cryptography
Uniquely 3-colourable Steiner triple systems
Journal of Combinatorial Theory Series A
Efficient software testing protocols
CASCON '98 Proceedings of the 1998 conference of the Centre for Advanced Studies on Collaborative research
The Non-Existence of Maximal Sets of Four Mutually Orthogonal Latin Squares of Order 8
Designs, Codes and Cryptography
Edge coloring complete uniform hypergraphs with many components
Journal of Combinatorial Theory Series B
Families of Trees Decompose the Random Graph in an Arbitrary Way
Combinatorics, Probability and Computing
A systematic approach to some block design constructions
Journal of Combinatorial Theory Series A
Classification of Steiner quadruple systems of order 16 and rank at most 131
Problems of Information Transmission
Propagation algorithms for lexicographic ordering constraints
Artificial Intelligence
Existence of resolvable optimal strong partially balanced designs
Discrete Applied Mathematics
Latin squares with bounded size of row prefix intersections
Discrete Applied Mathematics
Constructing t-designs from t-wise balanced designs
European Journal of Combinatorics
Maximum transversal in partial Latin squares and rainbow matchings
Discrete Applied Mathematics
General frame constructions for Z-cyclic triplewhist tournaments
Journal of Combinatorial Theory Series A
The effects of synchronization on topology-transparent scheduling
Wireless Networks
A computation of some multiply homogeneous superschemes from transitive permutation groups
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
What is a design? How should we classify them?
Designs, Codes and Cryptography
Kirkman frames having hole type hum1 for small h
Designs, Codes and Cryptography
Triplewhist tournaments with the three person property
Journal of Combinatorial Theory Series A
ACM Communications in Computer Algebra
Explicit constructions for perfect hash families
Designs, Codes and Cryptography
Designs from subcode supports of linear codes
Designs, Codes and Cryptography
Generalized balanced tournament designs and related codes
Designs, Codes and Cryptography
Journal of Algebraic Combinatorics: An International Journal
Scheduling social tournaments locally
AI Communications - Constraint Programming for Planning and Scheduling
Rateless forward error correction for topology-transparent scheduling
IEEE/ACM Transactions on Networking (TON)
Some existence and construction results of polygonal designs
European Journal of Combinatorics
Bundles, presemifields and nonlinear functions
Designs, Codes and Cryptography
Constructions of optimal GDRP(n,λ;v)'s of type λ1µm-1
Discrete Applied Mathematics
Computer Search for Large Sets of Idempotent Quasigroups
Computer Mathematics
Covering Arrays Avoiding Forbidden Edges
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Vertex-transitive self-complementary uniform hypergraphs
European Journal of Combinatorics
Note: Linear spaces with small generated subspaces
Journal of Combinatorial Theory Series A
A constraint on the biembedding of Latin squares
European Journal of Combinatorics
Collision-Resilient Symbol Based Extension of Query Tree Protocol for Fast RFID Tag Identification
Information Networking. Towards Ubiquitous Networking and Services
The existence of generalized mix functions
Designs, Codes and Cryptography
Finding Orthogonal Arrays Using Satisfiability Checkers and Symmetry Breaking Constraints
PRICAI '08 Proceedings of the 10th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
Mathematical Methods in Computer Science
Polarities, quasi-symmetric designs, and Hamada's conjecture
Designs, Codes and Cryptography
On orthogonal generalized equitable rectangles
Designs, Codes and Cryptography
Optimal grid holey packings with block size 3 and 4
Designs, Codes and Cryptography
Linear hash families and forbidden configurations
Designs, Codes and Cryptography
Pure partial planes of order 6 with 25 lines
Designs, Codes and Cryptography
Optical grooming with grooming ratio eight
Discrete Applied Mathematics
Note: A construction of mutually disjoint Steiner systems from isomorphic Golay codes
Journal of Combinatorial Theory Series A
What Next for ASP? (A Not-Entirely-Well-Informed Opinion)
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
In-Memory Checkpointing for MPI Programs by XOR-Based Double-Erasure Codes
Proceedings of the 16th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
A quorum-based framework for establishing control channels in dynamic spectrum access networks
Proceedings of the 15th annual international conference on Mobile computing and networking
Solving strategies for highly symmetric CSPs
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Note: On the Cameron--Praeger conjecture
Journal of Combinatorial Theory Series A
The rules of constraint modelling
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Propagation algorithms for lexicographic ordering constraints
Artificial Intelligence
Optical CDMA coding scheme with a large size of code space
IEEE Communications Letters
Sets of frequency hopping sequences: bounds and optimal constructions
IEEE Transactions on Information Theory
Cocyclic jacket matrix with public key security protocol for wireless rural network
ICUFN'09 Proceedings of the first international conference on Ubiquitous and future networks
Authentication and secrecy codes for equiprobable source probability distributions
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Constructions of families with unequal auto and cross-correlation constraints
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Orthogonal double covers of Kn,n by small graphs
Discrete Applied Mathematics
Existence of resolvable optimal strong partially balanced designs
Discrete Applied Mathematics
Note: Latin squares with bounded size of row prefix intersections
Discrete Applied Mathematics
Optimization, block designs and No Free Lunch theorems
Information Processing Letters
On constructions for optimal two-dimensional optical orthogonal codes
Designs, Codes and Cryptography
Equidistant frequency permutation arrays and related constant composition codes
Designs, Codes and Cryptography
A new Yang number and consequences
Designs, Codes and Cryptography
A graph theoretic approach for optimizing key pre-distribution in wireless sensor networks
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Constructions of new orthogonal arrays and covering arrays of strength three
Journal of Combinatorial Theory Series A
A lattice-based systematic recursive construction of quasi-cyclic LDPC codes
IEEE Transactions on Communications
Multiple access algorithms without feedback using combinatorial designs
IEEE Transactions on Communications
Existence of resolvable H-designs with group sizes 2, 3, 4 and 6
Designs, Codes and Cryptography
T-code: 3-erasure longest lowest-density MDS codes
IEEE Journal on Selected Areas in Communications
Optimal configurations for peer-to-peer user-private information retrieval
Computers & Mathematics with Applications
Combinatorial constructions for optimal two-dimensional optical orthogonal codes
IEEE Transactions on Information Theory
Double periodic arrays with optimal correlation for applications in watermarking
SSC'07 Proceedings of the 2007 international conference on Sequences, subsequences, and consequences
Constructions of a class of partition difference family
IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application
Rapid sequence homology assessment by subsampling the genome space using difference sets
IEEE Transactions on Information Theory - Special issue on information theory in molecular biology and neuroscience
Optimal ternary constant-weight codes of weight four and distance six
IEEE Transactions on Information Theory
An enumeration of equilateral triangle dissections
Discrete Applied Mathematics
On uniformly resolvable designs with block sizes 3 and 4
Designs, Codes and Cryptography
Combinatorial Designs for Authentication and Secrecy Codes
Foundations and Trends in Communications and Information Theory
Ballot permutations in prêt à voter
EVT/WOTE'09 Proceedings of the 2009 conference on Electronic voting technology/workshop on trustworthy elections
Journal of Combinatorial Theory Series B
Implementing logical connectives in constraint programming
Artificial Intelligence
Combinatorial bounds and characterizations of splitting authentication codes
Cryptography and Communications
Mutually orthogonal Latin squares and mutually unbiased bases in dimensions of odd prime power
Cryptography and Communications
Exotic complex Hadamard matrices and their equivalence
Cryptography and Communications
Affine geometry designs, polarities, and Hamada's conjecture
Journal of Combinatorial Theory Series A
Exact cover via satisfiability: an empirical study
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Exponential propagation for set variables
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Computational complexity of reconstruction and isomorphism testing for designs and line graphs
Journal of Combinatorial Theory Series A
Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4
SIAM Journal on Discrete Mathematics
Completely reducible super-simple designs with block size four and related super-simple packings
Designs, Codes and Cryptography
Designs having the parameters of projective and affine spaces
Designs, Codes and Cryptography
Strongly regular graphs constructed from p-ary bent functions
Journal of Algebraic Combinatorics: An International Journal
Hamilton cycles in restricted block-intersection graphs
Designs, Codes and Cryptography
Hardness results for covering arrays avoiding forbidden edges and error-locating arrays
Theoretical Computer Science
Sets of orthogonal hypercubes of class r
Journal of Combinatorial Theory Series A
EUC'06 Proceedings of the 2006 international conference on Embedded and Ubiquitous Computing
Turyn type Williamson matrices up to order 99
Designs, Codes and Cryptography
Optimal constant weight covering codes and nonuniform group divisible 3-designs with block size four
Designs, Codes and Cryptography
Finding the best CAFE is NP-hard
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Ambiguity and deficiency in costas arrays and APN permutations
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
A construction for modified generalized Hadamard matrices using QGH matrices
Designs, Codes and Cryptography
On the number of designs with affine parameters
Designs, Codes and Cryptography
Probabilistic existence of rigid combinatorial structures
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
On triple systems and strongly regular graphs
Journal of Combinatorial Theory Series A
Some 20-regular CDP(5,1;20u) and their applications
Finite Fields and Their Applications
Word-Oriented transformation shift registers and their linear complexity
SETA'12 Proceedings of the 7th international conference on Sequences and Their Applications
On difference matrices of coset type
Journal of Combinatorial Theory Series A
Designs, Codes and Cryptography
Ant-based approaches for solving autocorrelation problems
ANTS'12 Proceedings of the 8th international conference on Swarm Intelligence
Perfect difference sets for neighbor discovery: energy efficient and fair
Proceedings of the 3rd Extreme Conference on Communication: The Amazon Expedition
Resolving sets for Johnson and Kneser graphs
European Journal of Combinatorics
Some approaches for solving the general (t,k)-design existence problem and other related problems
Discrete Applied Mathematics
Patterns and pathways of packing circles into a square
International Journal of Computer Applications in Technology
Almost Hadamard matrices: The case of arbitrary exponents
Discrete Applied Mathematics
Nested block designs: Flexible and efficient schedule-based asynchronous duty cycling
Computer Networks: The International Journal of Computer and Telecommunications Networking
Improved bounds for separating hash families
Designs, Codes and Cryptography
| Hi-index | 0.18 |