Lookup tables, recurrences and complexity
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
On finding the closest bitwise matches in a fixed set
ACM Transactions on Mathematical Software (TOMS)
Lively linear Lisp: “look ma, no garbage!”
ACM SIGPLAN Notices
Fast Multiple-Precision Evaluation of Elementary Functions
Journal of the ACM (JACM)
A fast string searching algorithm
Communications of the ACM
ACM SIGARCH Computer Architecture News
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Information Processing Letters
Fast algorithms for polynomial solutions of linear differential equations
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Modelling and solving English Peg Solitaire
Computers and Operations Research
Asynchronous chess competition
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Size matters: lessons from a broken binary search
Journal of Computing Sciences in Colleges
Energy efficient network design tool for green IP/Ethernet networks
ONDM'10 Proceedings of the 14th conference on Optical network design and modeling
NumGfun: a package for numerical and analytic computation with D-finite functions
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Research paper: The saga of minimum spanning trees
Computer Science Review
Hardware index to set partition converter
ARC'13 Proceedings of the 9th international conference on Reconfigurable Computing: architectures, tools, and applications
A synthetic operational account of call-by-need evaluation
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
| Hi-index | 0.02 |
Here is some little known data which may be of interest to computer hackers. The items and examples are so sketchy that to decipher them may require more sincerity and curiosity than a non-hacker can muster. Doubtless, little of this is new, but nowadays it''s hard to tell. So we must be content to give you an insight, or save you some cycles, and to welcome further contributions of items, new or used.