SIGMETRICS '89 Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
IEEE Transactions on Parallel and Distributed Systems
Which search problems are random?
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Factorization in Z[x]: the searching phase
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Abstractions of Random Finite-State Machines
Formal Methods in System Design
Génération de Chemins de Dyck à pics croissants
Discrete Mathematics
Random Sampling from Boltzmann Principles
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
In Search of a Phase Transition in the AC-Matching Problem
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Newman polynomials with prescribed vanishing and integer sets with distinct subset sums
Mathematics of Computation
Improved instruction formation in the exhaustive local microcode compaction algorithm
MICRO 17 Proceedings of the 17th annual workshop on Microprogramming
Phorma: perfectly hashable order restricted multidimensional arrays
Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
Utilization of GIS and graph theory for determination of optimal mailing route
Journal of Computing Sciences in Colleges
Application of synchronous dynamic encryption system in mobile wireless domains
Proceedings of the 1st ACM international workshop on Quality of service & security in wireless and mobile networks
On the Automatic Modularization of Software Systems Using the Bunch Tool
IEEE Transactions on Software Engineering
Minimal change list for Lucas strings and some graph theoretic consequences
Theoretical Computer Science - In memoriam: Alberto Del Lungo (1965-2003)
Best Odds for Finding a Perfect Matching in a Bipartite Graph
Combinatorics, Probability and Computing
On the (n,t)-antipodal Gray codes
Theoretical Computer Science
Enumeration and random generation of accessible automata
Theoretical Computer Science
On the lexicographical generation of compressed codes
Information Processing Letters
Automatic Generation of Symbolic Reliability Functions for Processor-Memory-Switch Structures
IEEE Transactions on Computers - Lecture notes in computer science Vol. 174
Mixed-Radix Gray Codes in Lee Metric
IEEE Transactions on Computers
Compact visualisation of video summaries
EURASIP Journal on Advances in Signal Processing
From moments of sum to moments of product
Journal of Multivariate Analysis
Theoretical Computer Science
Fast analysis of scalable video for adaptive browsing interfaces
Computer Vision and Image Understanding
Efficient enumeration of words in regular languages
Theoretical Computer Science
Solving highly constrained search problems with quantum computers
Journal of Artificial Intelligence Research
The relevant prefixes of coloured Motzkin walks: An average case analysis
Theoretical Computer Science
Statistical eigenmode transmission over jointly correlated MIMO channels
IEEE Transactions on Information Theory
Generating random binary trees - A survey
Information Sciences: an International Journal
Families of prudent self-avoiding walks
Journal of Combinatorial Theory Series A
Exact solution of two classes of prudent polygons
European Journal of Combinatorics
Random sampling of plane partitions
Combinatorics, Probability and Computing
Efficient enumeration of regular languages
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Combinatorial algorithms for listing paths in minimal change order
CAAN'07 Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking
Generating gray codes in o(1) worst-case time per word
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Optimal waveband switching in optical ring networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Toward boosting distributed association rule mining by data de-clustering
Information Sciences: an International Journal
HELIOS: a high energy-efficiency locally-scheduled input-queued optical switch
Proceedings of the 6th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
Evaluating adversarial partitions
ESORICS'10 Proceedings of the 15th European conference on Research in computer security
Index to constant weight codeword converter
ARC'11 Proceedings of the 7th international conference on Reconfigurable computing: architectures, tools and applications
Common substrings in random strings
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Topological map induction using neighbourhood information of places
Autonomous Robots
Simulating Size-constrained Galton-Watson Trees
SIAM Journal on Computing
The number of DFAs for a given spanning tree
The Journal of Supercomputing
ISNN'13 Proceedings of the 10th international conference on Advances in Neural Networks - Volume Part I
The construction of optimal designs for dose-escalation studies
Statistics and Computing
Time-efficient estimation of conditional mutual information for variable selection in classification
Computational Statistics & Data Analysis
Optimal Wavebanding in WDM Ring Networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.07 |