ACM SIGACT News
Matching nuts and bolts in O(n log n) time
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Design and analysis of algorithms reconsidered
Proceedings of the thirty-first SIGCSE technical symposium on Computer science education
Using puzzles in teaching algorithms
SIGCSE '02 Proceedings of the 33rd SIGCSE technical symposium on Computer science education
Parallel Real-Time Numerical Computation: Beyond Speedup III
ITCC '00 Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00)
Navigation piles with applications to sorting, priority queues, and priority deques
Nordic Journal of Computing
Analyze that: puzzles and analysis of algorithms
Proceedings of the 36th SIGCSE technical symposium on Computer science education
Finding large 3-free sets I: The small n case
Journal of Computer and System Sciences
Fast intersection algorithms for sorted sequences
Algorithms and Applications
Experimental analysis of a fast intersection algorithm for sorted sequences
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
| Hi-index | 0.00 |