Hypercube message routing in the presence of faults
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Two messages are almost optimal for conveying information
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Order preserving minimal perfect hash functions and information retrieval
SIGIR '90 Proceedings of the 13th annual international ACM SIGIR conference on Research and development in information retrieval
Order-preserving minimal perfect hash functions and information retrieval
ACM Transactions on Information Systems (TOIS) - Special issue on research and development in information retrieval
Practical minimal perfect hash functions for large databases
Communications of the ACM
A reliable multicast framework for light-weight sessions and application level framing
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A reliable multicast framework for light-weight sessions and application level framing
IEEE/ACM Transactions on Networking (TON)
Frozen development in graph coloring
Theoretical Computer Science - Phase transitions in combinatorial problems
A graph theoretic approach for channel assignment in cellular networks
Wireless Networks
An algorithm using length-r paths to approximate subgraph isomorphism
Pattern Recognition Letters
MDM '01 Proceedings of the Second International Conference on Mobile Data Management
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph Crossing Minimization
Journal of Experimental Algorithmics (JEA)
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 2 - Volume 03
Replicator Equations, Maximal Cliques, and Graph Isomorphism
Neural Computation
Defect-tolerant Logic with Nanoscale Crossbar Circuits
Journal of Electronic Testing: Theory and Applications
Demand-scalable geographic multicasting in wireless sensor networks
Computer Communications
On the futility of blind search: An algorithmic view of “no free lunch”
Evolutionary Computation
Fractionally total colouring Gn,p
Discrete Applied Mathematics
Distance graphs: from random geometric graphs to Bernoulli graphs and between
Proceedings of the fifth international workshop on Foundations of mobile computing
Solving DisCSPs with penalty driven search
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
The Gn,mphase transition is not hard for the Hamiltonian cycle problem
Journal of Artificial Intelligence Research
Solving highly constrained search problems with quantum computers
Journal of Artificial Intelligence Research
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
Augmented order preserving minimal perfect hash functions for very large digital libraries
CIT'11 Proceedings of the 5th WSEAS international conference on Communications and information technology
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Quantitative analysis of multi-hop wireless networks using a novel paradigm
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
| Hi-index | 0.02 |