vigna.di.unimi.it
Sebastiano Vigna/Software
http://vigna.di.unimi.it/software.php
PRNG shootout ➔. DSI utilities ➔. Programming in Java™. Extends the Java Collections Framework by providing type-specific maps, sets, lists and priority queues with a small memory footprint and fast access and insertion; it also includes a fast I/O API for binary and text files. For Java) is a free full-text search engine for large document collections written in Java. Is a framework to study the web graph. It provides simple ways to manage very large graphs. I wrote a simple script. That acts as a.
vigna.di.unimi.it
Sebastiano Vigna/Publications
http://vigna.di.unimi.it/papers.php
PRNG shootout ➔. DSI utilities ➔. Paolo Boldi and Sebastiano Vigna. On the lattice of antichains of finite intervals. Abs/1510.03675, 2016. Motivated by applications to information retrieval, we study the lattice of antichains of finite intervals of a locally finite, totally ordered set. Intervals are ordered by reverse inclusion; the order between antichains is induced by the lower set they generate. We discuss in general properties of such. Abs/1404.3327, 2014. Step-asynchronous successive overrelaxati...
vigna.di.unimi.it
Sebastiano Vigna's Music Page
http://vigna.di.unimi.it/music.php
PRNG shootout ➔. DSI utilities ➔. Lilypond Snippet Repository ♪♫. Piano and guitar music. Don't expect too much content on this page, at least for a while. Simply said, I got tired of…. Rediscovering each time from scratch, again and again, the same tablatures or piano parts I like to play;. Finding imprecise, badly written (ASCII! Tablatures on the net;. Explaining for the billionth time a nice tablature without proper instruments (i.e., a score sheet or music engraving software). BTW, terrific software!
sux4j.di.unimi.it
A fast selection algorithm
http://sux4j.di.unimi.it/select.php
A fast selection algorithm. PRNG shootout ➔. DSI utilities ➔. Given a machine word, we are interested in locating the. Th bit set to one, starting from the least significant bit. This problem is important as it leads to excellent practical implementation of selection data structures. On bit arrays of any size. One of the results of the research around the Sux project is the design of a very fast algorithm to perform selection in a word. The algorithm uses. Or in this book. EASY LEQ STEP 8 MSBS. Rdquo; (b...
vigna.di.unimi.it
Jal: A partial Java™ STL port
http://vigna.di.unimi.it/jal
Jal: A partial Java™ STL port. PRNG shootout ➔. DSI utilities ➔. Jal is a partial port of the STL by the C Standard Template Library authors (Matthew Austern and Alexander Stepanov). It contains several useful algorithms that cannot be found elsewhere (e.g., linear-time. And sorting arrays using arbitrary predicates. It is distributed under the following X11-like license:. This version of Jal has been generated using the following package names:. And so on. Other distributions of Jal used.
