Risultati di ricerca
1 mag 2024 · Robert Endre Tarjan is a computer scientist and co-winner of the 1986 A.M. Turing Award, the highest honour in computer science, for “fundamental achievements in the design and analysis of algorithms and data structures.”. Tarjan invented or co-invented some of the most efficient known algorithms.
- William L. Hosch
26 apr 2024 · Speedup on #processors for strongly connected component (SCC) algorithms over Tarjan’s algorithm (Tarjan, 1972) (sequential, always 1). The tested algorithms include PASGAL (this paper), GBBS (Dhulipala et al., 2021), and Multistep (Slota et al., 2014). We present four graphs of different types.
29 apr 2024 · Context-free language reachability (CFL-reachability) is a fundamental framework for implementing various static analyses. CFL-reachability utilizes context-free grammar (CFG) to extend the expressiveness of ordinary graph reachability from an unlabeled ...
29 apr 2024 · Due to their quantitative nature, probabilistic programs pose non-trivial challenges for designing compositional and efficient program analyses. Many analyses for probabilistic programs rely on iterative approximation. This article presents an ...
5 giorni fa · Robert Tarjan: Stanford University, Cornell University, University of California, Berkeley, Princeton University: 1987 John Cocke — "For significant contributions in the design and theory of compilers, the architecture of large systems and the development of reduced instruction set computers (RISC)" IBM: 1988 Ivan Sutherland
1 giorno fa · 136 Irving Street Cambridge, MA 02138. 617-576-5000. VEHICLE ENTRANCE. 200 Beacon Street Somerville, MA 02143
6 giorni fa · Erdős in 1992. Paul Erdős (1913–1996) was a Hungarian mathematician. He considered mathematics to be a social activity and often collaborated on his papers, having 511 joint authors, many of whom also have their own collaborators.
