On the public citation graph

Ligra: A Lightweight Graph Processing Framework for Shared Memory

0 signed · 463 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/(sici)1097-024x(199911)29:13<1149::aid-spe274>3.0.co;2-oopenalex-snapshot

Reducing the space requirement of suffix trees

inferredcites →https://doi.org/10.1002/rsa.3240010104openalex-snapshot

Probabilistic analysis of a parallel algorithm for finding maximal independent sets

inferredcites →https://doi.org/10.1002/spe.2198openalex-snapshot

Optimized succinct data structures for massive data

inferredcites →https://doi.org/10.1002/spe.535openalex-snapshot

Efficient implementation of lazy suffix trees

inferredcites →https://doi.org/10.1006/jagm.1993.1018openalex-snapshot

Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values

inferredcites →https://doi.org/10.1006/jagm.1994.1009openalex-snapshot

A Simpler Parallel Algorithm for Graph Connectivity

inferredcites →https://doi.org/10.1006/jagm.1995.1016openalex-snapshot

Finding Connected Components in O(log n log log n) Time on the EREW PRAM

inferredcites →https://doi.org/10.1006/jagm.2000.1146openalex-snapshot

Optimal Randomized EREW PRAM Algorithms for Finding Spanning Forests

inferredcites →https://doi.org/10.1006/jcss.1996.0074openalex-snapshot

List Ranking and List Scan on the CRAYC90

inferredcites →https://doi.org/10.1006/jcss.1996.0078openalex-snapshot

An Optimal Randomised Logarithmic Time Connectivity Algorithm for the EREW PRAM

inferredcites →https://doi.org/10.1006/jcss.1996.0079openalex-snapshot

Efficient Low-Contention Parallel Algorithms

inferredcites →https://doi.org/10.1006/jcss.1997.1291openalex-snapshot

Connected Components inO(log3/2n) Parallel Time for the CREW PRAM

inferredcites →https://doi.org/10.1006/jcss.1997.1534openalex-snapshot

Size-Estimation Framework with Applications to Transitive Closure and Reachability

inferredcites →https://doi.org/10.1006/jpdc.1996.0079openalex-snapshot

Parallel Algorithms for Image Histogramming and Connected Components with an Experimental Study

inferredcites →https://doi.org/10.1006/jpdc.1996.0107openalex-snapshot

Cilk: An Efficient Multithreaded Runtime System

inferredcites →https://doi.org/10.1006/jpdc.2000.1621openalex-snapshot

Combining Funnels: A Dynamic Approach to Software Combining

inferredcites →https://doi.org/10.1006/jpdc.2000.1630openalex-snapshot

Reactive Diffracting Trees

inferredcites →https://doi.org/10.1006/jpdc.2000.1678openalex-snapshot

Prefix Computations on Symmetric Multiprocessors

inferredcites →https://doi.org/10.1007/11427186_54openalex-snapshot

Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study

inferredcites →https://doi.org/10.1007/11561927_10openalex-snapshot

Non-blocking Hashtables with Open Addressing

inferredcites →https://doi.org/10.1007/11602569_48openalex-snapshot

Design and Implementation of the HPCS Graph Analysis Benchmark on Symmetric Multiprocessors

inferredcites →https://doi.org/10.1007/11780441_5openalex-snapshot

Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE

inferredcites →https://doi.org/10.1007/3-540-36265-7_7openalex-snapshot

Evaluating Arithmetic Expressions Using Tree Contraction: A Fast and Scalable Parallel Implementation for Symmetric Multiprocessors (SMPs)

inferredcites →https://doi.org/10.1007/3-540-44888-8_14openalex-snapshot

Linear-Time Construction of Suffix Arrays

inferredcites →https://doi.org/10.1007/3-540-45061-0_73openalex-snapshot

Simple Linear Work Suffix Array Construction

inferredcites →https://doi.org/10.1007/3-540-45417-9_39openalex-snapshot

A Parallel Algorithm for Connected Components on Distributed Memory Machines

inferredcites →https://doi.org/10.1007/3-540-48194-x_17openalex-snapshot

Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications

inferredcites →https://doi.org/10.1007/3-540-48518-x_3openalex-snapshot

Designing Practical Efficient Algorithms for Symmetric Multiprocessors

inferredcites →https://doi.org/10.1007/3-540-53487-3_42openalex-snapshot

The power of collision: Randomized parallel algorithms for chaining and integer sorting

inferredcites →https://doi.org/10.1007/3-540-54233-7_151openalex-snapshot

Fast parallel generation of random permutations

inferredcites →https://doi.org/10.1007/3-540-54233-7_179openalex-snapshot

String matching with preprocessing of text and pattern

inferredcites →https://doi.org/10.1007/3-540-61142-8_588openalex-snapshot

Scotch: A software package for static mapping by dual recursive bipartitioning of process and architecture graphs

inferredcites →https://doi.org/10.1007/3-540-61440-0_158openalex-snapshot

Optimal logarithmic time randomized suffix tree construction

inferredcites →https://doi.org/10.1007/3-540-63890-3_24openalex-snapshot

A randomized linear work EREW PRAM algorithm to find a minimum spanning forest

inferredcites →https://doi.org/10.1007/978-1-4615-5611-4_28openalex-snapshot

Parallel Computation of the Diameter of a Graph

inferredcites →https://doi.org/10.1007/978-1-4757-3472-0_2openalex-snapshot

Cooperating Sequential Processes

inferredcites →https://doi.org/10.1007/978-3-319-07959-2_11openalex-snapshot

Beyond Synchronous: New Techniques for External-Memory Graph Connectivity and Minimum Spanning Forest

inferredcites →https://doi.org/10.1007/978-3-319-07959-2_13openalex-snapshot

Efficient Wavelet Tree Construction and Querying for Multicore Architectures

inferredcites →https://doi.org/10.1007/978-3-319-07959-2_28openalex-snapshot

From Theory to Practice: Plug and Play with Succinct Data Structures

inferredcites →https://doi.org/10.1007/978-3-319-07959-2_35openalex-snapshot

LCP Array Construction in External Memory

inferredcites →https://doi.org/10.1007/978-3-319-08404-6_27openalex-snapshot

Triangle Counting in Dynamic Graph Streams

inferredcites →https://doi.org/10.1007/978-3-319-11918-2_10openalex-snapshot

Fast Construction of Wavelet Trees

inferredcites →https://doi.org/10.1007/978-3-540-27810-8_32openalex-snapshot

Two Space Saving Tricks for Linear Time LCP Array Computation

inferredcites →https://doi.org/10.1007/978-3-540-30140-0_10openalex-snapshot

Graph Decomposition Lemmas and Their Role in Metric Embedding Methods

inferredcites →https://doi.org/10.1007/978-3-540-68552-4_10openalex-snapshot

Engineering Parallel In-Place Random Generation of Integer Permutations

inferredcites →https://doi.org/10.1007/978-3-540-74466-5_72openalex-snapshot

MCSTL: The Multi-core Standard Template Library

inferredcites →https://doi.org/10.1007/978-3-540-77004-6_10openalex-snapshot

Approximating Betweenness Centrality

inferredcites →https://doi.org/10.1007/978-3-540-77974-2openalex-snapshot

Computational Geometry

inferredcites →https://doi.org/10.1007/978-3-540-78646-7_62openalex-snapshot

Analysis of Link Graph Compression Techniques

inferredcites →https://doi.org/10.1007/978-3-540-87779-0_24openalex-snapshot

Hopscotch Hashing

inferredcites →https://doi.org/10.1007/978-3-540-89097-3_18openalex-snapshot

Practical Rank/Select Queries over Arbitrary Sequences

inferredcites →https://doi.org/10.1007/978-3-540-92182-0_14openalex-snapshot

Space-Time Tradeoffs for Longest-Common-Prefix Array Computation

inferredcites →https://doi.org/10.1007/978-3-642-02441-2_17openalex-snapshot

Permuted Longest-Common-Prefix Array

inferredcites →https://doi.org/10.1007/978-3-642-10217-2_18openalex-snapshot

LPF Computation Revisited

inferredcites →https://doi.org/10.1007/978-3-642-13193-6_9openalex-snapshot

Practical Compressed Suffix Trees

inferredcites →https://doi.org/10.1007/978-3-642-13509-5_21openalex-snapshot

Sampled Longest Common Prefix Array

inferredcites →https://doi.org/10.1007/978-3-642-21458-5_19openalex-snapshot

On Wavelet Tree Construction

inferredcites →https://doi.org/10.1007/978-3-642-21458-5_4openalex-snapshot

Lempel-Ziv Factorization Revisited

inferredcites →https://doi.org/10.1007/978-3-642-22300-6_32openalex-snapshot

Inducing the LCP-Array

inferredcites →https://doi.org/10.1007/978-3-642-24100-0_43openalex-snapshot

Toward a Formal Semantic Framework for Deterministic Parallel Programming

inferredcites →https://doi.org/10.1007/978-3-642-24583-1_19openalex-snapshot

Space Efficient Wavelet Tree Construction

inferredcites →https://doi.org/10.1007/978-3-642-25929-6_18openalex-snapshot

A Parallel Compact Hash Table

inferredcites →https://doi.org/10.1007/978-3-642-31265-6_2openalex-snapshot

Wavelet Trees for All

inferredcites →https://doi.org/10.1007/978-3-642-33122-0_26openalex-snapshot

Lightweight LCP Construction for Next-Generation Sequencing Datasets

inferredcites →https://doi.org/10.1007/978-3-642-34109-0_18openalex-snapshot

The Wavelet Matrix

inferredcites →https://doi.org/10.1007/978-3-642-37450-0_23openalex-snapshot

Parallel Triangle Counting over Large Graphs

inferredcites →https://doi.org/10.1007/978-3-642-38233-8_28openalex-snapshot

A Faster CREW PRAM Algorithm for Computing Cartesian Trees

inferredcites →https://doi.org/10.1007/978-3-642-38527-8_15openalex-snapshot

Space-Efficient, High-Performance Rank and Select Structures on Uncompressed Bit Sequences

inferredcites →https://doi.org/10.1007/978-3-642-38905-4_19openalex-snapshot

Linear Time Lempel-Ziv Factorization: Simple, Fast, Small

inferredcites →https://doi.org/10.1007/978-3-642-38905-4_20openalex-snapshot

External Memory Generalized Suffix and LCP Arrays Construction

inferredcites →https://doi.org/10.1007/978-3-642-40047-6_66openalex-snapshot

Efficient Parallel and External Matching

inferredcites →https://doi.org/10.1007/978-3-662-43948-7_19openalex-snapshot

Listing Triangles

inferredcites →https://doi.org/10.1007/bf01206331openalex-snapshot

On-line construction of suffix trees

inferredcites →https://doi.org/10.1007/bf01303516openalex-snapshot

Low diameter graph decompositions

inferredcites →https://doi.org/10.1007/bf01305237openalex-snapshot

Pseudorandom generators for space-bounded computation

inferredcites →https://doi.org/10.1007/bf01762122openalex-snapshot

Parallel construction of a suffix tree with applications

inferredcites →https://doi.org/10.1007/bf01840376openalex-snapshot

Efficient parallel algorithms for graph problems

inferredcites →https://doi.org/10.1007/bf01911006openalex-snapshot

Heuristics for ray tracing using space subdivision

inferredcites →https://doi.org/10.1007/bf02523189openalex-snapshot

Finding and counting given length cycles

inferredcites →https://doi.org/10.1007/bf02700044openalex-snapshot

Randomized parallel list ranking for distributed memory multiprocessors

inferredcites →https://doi.org/10.1007/bfb0028804openalex-snapshot

Parallel algorithms for connected components in a graph

inferredcites →https://doi.org/10.1007/pl00009206openalex-snapshot

Fast Generation of Random Permutations Via Networks Simulation

inferredcites →https://doi.org/10.1007/s00224-002-1057-3openalex-snapshot

The Data Locality of Work Stealing

inferredcites →https://doi.org/10.1007/s00224-003-1081-yopenalex-snapshot

Scalable Room Synchronizations

inferredcites →https://doi.org/10.1007/s00224-006-1198-xopenalex-snapshot

Compressed Suffix Trees with Full Functionality

inferredcites →https://doi.org/10.1007/s00446-004-0115-2openalex-snapshot

Lock-free dynamic hash tables with open addressing

inferredcites →https://doi.org/10.1007/s00453-004-1140-zopenalex-snapshot

Characterizing History Independent Data Structures

inferredcites →https://doi.org/10.1007/s00778-012-0283-9openalex-snapshot

gbase: an efficient analysis platform for large graphs

inferredcites →https://doi.org/10.1007/s10115-010-0291-2openalex-snapshot

Counting triangles in real-world networks using projections

inferredcites →https://doi.org/10.1007/s10115-010-0305-0openalex-snapshot

PEGASUS: mining peta-scale graphs

inferredcites →https://doi.org/10.1007/s11227-010-0405-3openalex-snapshot

The Cilk++ concurrency platform

inferredcites →https://doi.org/10.1007/s11390-015-1503-8openalex-snapshot

An Efficient and Flexible Deterministic Framework for Multithreaded Programs

inferredcites →https://doi.org/10.1007/s11786-007-0024-4openalex-snapshot

Lempel–Ziv Factorization Using Less Time & Space

inferredcites →https://doi.org/10.1007/s13278-010-0001-9openalex-snapshot

Spectral counting of triangles via element-wise sparsification and triangle-based link recommendation

inferredcites →https://doi.org/10.1016/0020-0190(82)90131-4openalex-snapshot

Parallel algorithms for the connected components and minimal spanning tree problems

inferredcites →https://doi.org/10.1016/0020-0190(86)90141-9openalex-snapshot

An improved parallel algorithm for maximal matching

inferredcites →https://doi.org/10.1016/0020-0190(86)90144-4openalex-snapshot

A fast and simple randomized parallel algorithm for maximal matching

inferredcites →https://doi.org/10.1016/0020-0190(89)90138-5openalex-snapshot

Optimal merging and sorting on the EREW PRAM

inferredcites →https://doi.org/10.1016/0020-0190(91)90223-5openalex-snapshot

Efficient parallel algorithms to test square-freeness and factorize strings

inferredcites →https://doi.org/10.1016/0021-9991(87)90140-9openalex-snapshot

A fast algorithm for particle simulations

inferredcites →https://doi.org/10.1016/0166-218x(84)90019-2openalex-snapshot

An optimal parallel connectivity algorithm

inferredcites →https://doi.org/10.1016/0196-6774(82)90008-6openalex-snapshot

An O(logn) parallel connectivity algorithm

inferredcites →https://doi.org/10.1016/0196-6774(86)90019-2openalex-snapshot

A fast and simple randomized parallel algorithm for the maximal independent set problem

inferredcites →https://doi.org/10.1016/0196-6774(91)90034-vopenalex-snapshot

On parallel hashing and integer sorting

inferredcites →https://doi.org/10.1016/0304-3975(94)90106-6openalex-snapshot

P-complete problems in data compression

inferredcites →https://doi.org/10.1016/0304-3975(95)00198-0openalex-snapshot

A parallel algorithm for the generation of a permutation and applications

inferredcites →https://doi.org/10.1016/0890-5401(89)90035-7openalex-snapshot

Parallei graph algorithms that are efficient on average

inferredcites →https://doi.org/10.1016/0890-5401(91)90019-xopenalex-snapshot

Approximate parallel scheduling. II. Applications to logarithmic-time optimal parallel graph algorithms

inferredcites →https://doi.org/10.1016/0890-5401(91)90031-vopenalex-snapshot

Improved deterministic parallel integer sorting

inferredcites →https://doi.org/10.1016/b978-0-444-88071-0.50022-9openalex-snapshot

Parallel Algorithms for Shared-Memory Machines

inferredcites →https://doi.org/10.1016/b978-012722442-8/50085-9openalex-snapshot

OASIS

inferredcites →https://doi.org/10.1016/j.dam.2004.04.013openalex-snapshot

Parallel Lempel Ziv coding

inferredcites →https://doi.org/10.1016/j.ipl.2007.10.006openalex-snapshot

Computing Longest Previous Factor in linear time and applications

inferredcites →https://doi.org/10.1016/j.ipl.2011.12.007openalex-snapshot

Colorful triangle counting and a MapReduce implementation

inferredcites →https://doi.org/10.1016/j.ipm.2011.01.008openalex-snapshot

Distributed search based on self-indexed compressed text

inferredcites →https://doi.org/10.1016/j.jalgor.2003.12.002openalex-snapshot

Cuckoo hashing

inferredcites →https://doi.org/10.1016/j.jcss.2004.03.004openalex-snapshot

Linear time algorithms for finding and representing all the tandem repeats in a string

inferredcites →https://doi.org/10.1016/j.jda.2004.08.002openalex-snapshot

Space efficient linear time construction of suffix arrays

inferredcites →https://doi.org/10.1016/j.jda.2010.09.007openalex-snapshot

Multiscale approach for the network compression-friendly ordering

inferredcites →https://doi.org/10.1016/j.jda.2012.07.007openalex-snapshot

Computing the longest common prefix array based on the Burrows–Wheeler transform

inferredcites →https://doi.org/10.1016/j.parco.2007.06.004openalex-snapshot

Scalable parallel suffix array construction

inferredcites →https://doi.org/10.1016/j.parco.2010.07.002openalex-snapshot

Parallel graph component labelling with GPUs and CUDA

inferredcites →https://doi.org/10.1016/j.tcs.2007.07.013openalex-snapshot

Rank and select revisited and extended

inferredcites →https://doi.org/10.1016/j.tcs.2008.07.017openalex-snapshot

Main-memory triangle computations for very large (sparse (power-law)) graphs

inferredcites →https://doi.org/10.1016/j.tcs.2013.10.009openalex-snapshot

Parallel algorithms for Burrows–Wheeler compression and decompression

inferredcites →https://doi.org/10.1016/s0019-9958(85)80041-3openalex-snapshot

A taxonomy of problems with fast parallel algorithms

inferredcites →https://doi.org/10.1016/s0020-0190(98)00127-6openalex-snapshot

Random permutations on distributed, external and hierarchical memory

inferredcites →https://doi.org/10.1016/s0166-218x(00)00281-xopenalex-snapshot

Diameter determination on restricted graph families

inferredcites →https://doi.org/10.1016/s0169-7552(98)00110-xopenalex-snapshot

The anatomy of a large-scale hypertextual Web search engine

inferredcites →https://doi.org/10.1016/s0196-6774(03)00076-2openalex-snapshot

Δ-stepping: a parallelizable shortest path algorithm

inferredcites →https://doi.org/10.1016/s0304-3975(97)00193-xopenalex-snapshot

The queue-read queue-write asynchronous PRAM model

inferredcites →https://doi.org/10.1016/s1570-8667(03)00065-0openalex-snapshot

Replacing suffix trees with enhanced suffix arrays

inferredcites →https://doi.org/10.1017/cbo9780511574931openalex-snapshot

Algorithms on Strings, Trees and Sequences

inferredcites →https://doi.org/10.1017/cbo9780511804090openalex-snapshot

Computational Complexity

inferredcites →https://doi.org/10.1017/cbo9780511814075openalex-snapshot

Randomized Algorithms

inferredcites →https://doi.org/10.1038/30835openalex-snapshot

It's a small world

inferredcites →https://doi.org/10.1073/pnas.032093399openalex-snapshot

Curvature of co-links uncovers hidden thematic layers in the World Wide Web

inferredcites →https://doi.org/10.1080/0022250x.2001.9990249openalex-snapshot

A faster algorithm for betweenness centrality*

inferredcites →https://doi.org/10.1080/15427951.2009.10390641openalex-snapshot

Permuting Web and Social Graphs

inferredcites →https://doi.org/10.1080/15427951.2012.625260openalex-snapshot

Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning

inferredcites →https://doi.org/10.1090/dimacs/030/01openalex-snapshot

Connected components on distributed memory machines

inferredcites →https://doi.org/10.1090/dimacs/030/02openalex-snapshot

Parallel implementation of algorithms for finding connected components in graphs

inferredcites →https://doi.org/10.1090/dimacs/030/03openalex-snapshot

Connected components algorithms for mesh-connected parallel computers

inferredcites →https://doi.org/10.1093/bioinformatics/15.5.426openalex-snapshot

REPuter: fast computation of maximal repeats in complete genomes.

inferredcites →https://doi.org/10.1093/nar/30.11.2478openalex-snapshot

Fast algorithms for large-scale genome alignment and comparison

inferredcites →https://doi.org/10.1093/oso/9780195085914.001.0001openalex-snapshot

Limits to Parallel Computation

inferredcites →https://doi.org/10.1109/12.42122openalex-snapshot

Scans as primitive parallel operations

inferredcites →https://doi.org/10.1109/12.9728openalex-snapshot

Commutativity-based concurrency control for abstract data types

inferredcites →https://doi.org/10.1109/71.629484openalex-snapshot

Scalable parallel implementations of list ranking on fine-grained machines

inferredcites →https://doi.org/10.1109/bigdata.2013.6691600openalex-snapshot

NUMA-optimized parallel breadth-first search on multicore single-node system

inferredcites →https://doi.org/10.1109/bigdata.2013.6691744openalex-snapshot

Approximate triangle counting algorithms on multi-cores

inferredcites →https://doi.org/10.1109/ccp.2011.16openalex-snapshot

Wavelet Trees: From Theory to Practice

inferredcites →https://doi.org/10.1109/cluster.2011.52openalex-snapshot

CULZSS: LZSS Lossless Data Compression on CUDA

inferredcites →https://doi.org/10.1109/dcc.2001.917151openalex-snapshot

Towards compressing Web graphs

inferredcites →https://doi.org/10.1109/dcc.2008.36openalex-snapshot

A Simple Algorithm for Computing the Lempel Ziv Factorization

inferredcites →https://doi.org/10.1109/dcc.2009.42openalex-snapshot

Linear Suffix Array Construction by Almost Pure Induced-Sorting

inferredcites →https://doi.org/10.1109/dcc.2013.20openalex-snapshot

Practical Parallel Lempel-Ziv Factorization

inferredcites →https://doi.org/10.1109/dcc.2013.21openalex-snapshot

Simpler and Faster Lempel Ziv Factorization

inferredcites →https://doi.org/10.1109/dcc.2013.60openalex-snapshot

Algorithms for Compressed Inputs

inferredcites →https://doi.org/10.1109/dcc.2015.7openalex-snapshot

Parallel Wavelet Tree Construction

inferredcites →https://doi.org/10.1109/dcc.2015.8openalex-snapshot

Smaller and Faster: Parallel Processing of Compressed Graphs with Ligra+

inferredcites →https://doi.org/10.1109/dcc.2016.117openalex-snapshot

Parallel Lightweight Wavelet Tree, Suffix Array and FM-Index Construction

inferredcites →https://doi.org/10.1109/focs.2007.36openalex-snapshot

Strongly History-Independent Hashing with Applications

inferredcites →https://doi.org/10.1109/hipc.2011.6152655openalex-snapshot

Hybrid algorithms for list ranking and graph connected components

inferredcites →https://doi.org/10.1109/hpca.2011.5749741openalex-snapshot

Calvin: Deterministic or not? Free will to choose

inferredcites →https://doi.org/10.1109/hpcs.2010.5547062openalex-snapshot

Experimental results of a coarse-grained parallel algorithm for spanning tree and connected components

inferredcites →https://doi.org/10.1109/ia335182.2014.10612668openalex-snapshot

Fast Triangle Counting on the GPU

inferredcites →https://doi.org/10.1109/icdcs.2014.70openalex-snapshot

Lock-Free Cuckoo Hashing

inferredcites →https://doi.org/10.1109/icde.2015.7113280openalex-snapshot

Multicore triangle computations without tuning

inferredcites →https://doi.org/10.1109/icde.2015.7113298openalex-snapshot

LLAMA: Efficient graph analytics using Large Multiversioned Arrays

inferredcites →https://doi.org/10.1109/icde.2015.7113362openalex-snapshot

VENUS: Vertex-centric streamlined graph computation on a single PC

inferredcites →https://doi.org/10.1109/icdm.2008.72openalex-snapshot

Fast Counting of Triangles in Large Real Networks without Counting: Algorithms and Laws

inferredcites →https://doi.org/10.1109/icpp.2005.55openalex-snapshot

On the Architectural Requirements for Efficient Execution of Graph Algorithms

inferredcites →https://doi.org/10.1109/icpp.2014.16openalex-snapshot

Designing a Heuristic Cross-Architecture Combination for Breadth-First Search

inferredcites →https://doi.org/10.1109/ipdps.2007.370681openalex-snapshot

SWARM: A Parallel Programming Framework for Multicore Processors

inferredcites →https://doi.org/10.1109/ipdps.2007.370685openalex-snapshot

Software and Algorithms for Graph Queries on Multithreaded Architectures

inferredcites →https://doi.org/10.1109/ipdps.2011.73openalex-snapshot

Reduced-Bandwidth Multithreaded Algorithms for Sparse Matrix-Vector Multiplication

inferredcites →https://doi.org/10.1109/ipdps.2012.79openalex-snapshot

Multi-core Spanning Forest Algorithms using the Disjoint-set Data Structure

inferredcites →https://doi.org/10.1109/ipdps.2014.64openalex-snapshot

BFS and Coloring-Based Parallel Algorithms for Strongly Connected Components and Related Problems

inferredcites →https://doi.org/10.1109/ipdpsw.2010.5470687openalex-snapshot

Massive streaming data analytics: A case study with clustering coefficients

inferredcites →https://doi.org/10.1109/ipdpsw.2010.5470817openalex-snapshot

A fast GPU algorithm for graph connectivity

inferredcites →https://doi.org/10.1109/jproc.1998.658762openalex-snapshot

Cramming More Components Onto Integrated Circuits

inferredcites →https://doi.org/10.1109/jrproc.1952.273898openalex-snapshot

A Method for the Construction of Minimum-Redundancy Codes

inferredcites →https://doi.org/10.1109/jssc.1974.1050511openalex-snapshot

Design of ion-implanted MOSFET's with very small physical dimensions

inferredcites →https://doi.org/10.1109/mc.1984.1659158openalex-snapshot

A Technique for High-Performance Data Compression

inferredcites →https://doi.org/10.1109/mcse.2008.45openalex-snapshot

A Unified Framework for Numerical and Combinatorial Computing

inferredcites →https://doi.org/10.1109/mcse.2009.120openalex-snapshot

Graph Twiddling in a MapReduce World

inferredcites →https://doi.org/10.1109/sc.2010.29openalex-snapshot

Hierarchical Diagonal Blocking and Precision Reduction Applied to Combinatorial Multigrid

inferredcites →https://doi.org/10.1109/sc.2010.46openalex-snapshot

Scalable Graph Exploration on Multicore Processors

inferredcites →https://doi.org/10.1109/sc.2012.50openalex-snapshot

Direction-optimizing Breadth-First Search

inferredcites →https://doi.org/10.1109/sc.2014.37openalex-snapshot

Fast Parallel Computation of Longest Common Prefixes

inferredcites →https://doi.org/10.1109/sc.2014.38openalex-snapshot

Fast Iterative Graph Computation: A Path Centric Approach

inferredcites →https://doi.org/10.1109/sfcs.1985.43openalex-snapshot

Parallel tree contraction and its application

inferredcites →https://doi.org/10.1109/sfcs.1985.9openalex-snapshot

An optimal parallel algorithm for integer sorting

inferredcites →https://doi.org/10.1109/sfcs.1991.185438openalex-snapshot

Towards a theory of nearly constant time parallel algorithms

inferredcites →https://doi.org/10.1109/sfcs.1992.267788openalex-snapshot

Waste makes haste: tight bounds for loose parallel sorting

inferredcites →https://doi.org/10.1109/sfcs.1992.267822openalex-snapshot

Undirected connectivity in O(log/sup 1.5/n) space

inferredcites →https://doi.org/10.1109/sffcs.1999.814600openalex-snapshot

Cache-oblivious algorithms

inferredcites →https://doi.org/10.1109/sffcs.1999.814634openalex-snapshot

Finding maximal repetitions in a word in linear time

inferredcites →https://doi.org/10.1109/socialcom.2013.51openalex-snapshot

Faster Clustering Coefficient Using Vertex Covers

showing the first 200 of 417 · page through all 417

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4869677openalex-extracted

Efficient Gpu Implementation of Static and Incrementally Expanding Df-P Pagerank for Dynamic Graphs

inferred← citeshttps://doi.org/10.1002/cpe.7419openalex-snapshot

Improving the efficiency of graph algorithm executions on high‐performance computing

inferred← citeshttps://doi.org/10.1007/978-3-030-22475-2_3openalex-snapshot

Distributed Single-Source Shortest Path Algorithms with Two-Dimensional Graph Layout

inferred← citeshttps://doi.org/10.1007/s13222-017-0255-8openalex-snapshot

Big Graph Data Analytics on Single Machines – An Overview

inferred← citeshttps://doi.org/10.1016/b978-0-12-820758-1.00002-9openalex-snapshot

The evolving role of storage-class memory in servers and large systems

inferred← citeshttps://doi.org/10.1016/bs.adcom.2021.10.003openalex-snapshot

Fast exact triangle counting in large graphs using SIMD acceleration

inferred← citeshttps://doi.org/10.1016/j.trc.2018.12.014openalex-snapshot

Connected Population Synthesis for Transportation Simulation

inferred← citeshttps://doi.org/10.1109/bigdata.congress.2014.106openalex-snapshot

LightGraph: Lighten Communication in Distributed Graph-Parallel Processing

inferred← citeshttps://doi.org/10.1109/bigdata47090.2019.9006429openalex-snapshot

Streaming Temporal Graphs: Subgraph Matching

inferred← citeshttps://doi.org/10.1109/micro56248.2022.00015openalex-snapshot

Hermes: Accelerating Long-Latency Load Requests via Perceptron-Based Off-Chip Load Prediction

inferred← citeshttps://doi.org/10.1109/micro56248.2022.00092openalex-snapshot

ReGraph: Scaling Graph Processing on HBM-enabled FPGAs with Heterogeneous Pipelines

inferred← citeshttps://doi.org/10.1109/tkde.2023.3243169openalex-snapshot

Towards Lightweight and Automated Representation Learning System for Networks

inferred← citeshttps://doi.org/10.1109/tvcg.2021.3074584openalex-snapshot

Asynchronous and Load-Balanced Union-Find for Distributed and Parallel Scientific Data Visualization and Analysis

inferred← citeshttps://doi.org/10.1145/2486159.2486180openalex-snapshot

Parallel graph decompositions using random shifts

inferred← citeshttps://doi.org/10.1145/2851141.2851145openalex-snapshot

Gunrock

inferred← citeshttps://doi.org/10.1145/3012405openalex-snapshot

inferred← citeshttps://doi.org/10.1145/3210377.3210414openalex-snapshot

Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable

inferred← citeshttps://doi.org/10.1145/3318464.3380590openalex-snapshot

Pensieve: Skewness-Aware Version Switching for Efficient Graph Processing

inferred← citeshttps://doi.org/10.1145/3352460.3358286openalex-snapshot

SMASH

inferred← citeshttps://doi.org/10.1145/3466752.3480114openalex-snapshot

Pythia: A Customizable Hardware Prefetching Framework Using Online Reinforcement Learning

inferred← citeshttps://doi.org/10.1145/3489517.3530524openalex-snapshot

Alleviating datapath conflicts and design centralization in graph analytics acceleration

inferred← citeshttps://doi.org/10.1145/3490148.3538574openalex-snapshot

Many Sequential Iterative Algorithms Can Be Parallel and (Nearly) Work-efficient

inferred← citeshttps://doi.org/10.1145/3591195.3595268openalex-snapshot

OMRGx: Programmable and Transparent Out-of-Core Graph Partitioning and Processing

inferred← citeshttps://doi.org/10.1145/3604437.3604442openalex-snapshot

Sortledton: a Universal Graph Data Structure

inferred← citeshttps://doi.org/10.1145/3808313openalex-snapshot

SparseZETA: Intelligent Auto-tuner for Designing High-Performance SpMV Programs

inferred← citeshttps://doi.org/10.1186/s40537-021-00443-9openalex-snapshot

An analysis of the graph processing landscape

inferred← citeshttps://doi.org/10.12681/eadd/52494openalex-snapshot

Accelerating irregular applications via efficient synchronization and data access techniques

inferred← citeshttps://doi.org/10.1360/n112017-00302openalex-snapshot

Design and implementation of large-scale network propagation simulation method inspired by Pregel mechanism

inferred← citeshttps://doi.org/10.1360/ssi-2023-0387openalex-snapshot

一种冗余感知的高能效图计算加速器

inferred← citeshttps://doi.org/10.1371/journal.pone.0229936openalex-snapshot

PACC: Large scale connected component computation on Hadoop and Spark

inferred← citeshttps://doi.org/10.14778/3384345.3384351openalex-snapshot

LiveGraph

inferred← citeshttps://doi.org/10.21203/rs.3.rs-3853411/v1openalex-snapshot

DMDP: A Dynamic Multi-Delta Prefetcher with Customizable Runtime Quality-Aware Feedback

inferred← citeshttps://doi.org/10.21236/ada603410openalex-snapshot

Large-scale Graph Computation on Just a PC

inferred← citeshttps://doi.org/10.26089/nummet.v21r325openalex-snapshot

Developing a prototype of high-performance graph-processing framework for NEC SX–Aurora TSUBASA vector architecture

inferred← citeshttps://doi.org/10.26089/nummet.v24r433openalex-snapshot

Performance study of the architecture-independent VGL framework for efficient implementation of graph algorithms

inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.5104openalex-snapshot

Shortest Path Calculation Using Contraction Hierarchy Graph Algorithms on Nvidia GPUs

inferred← citeshttps://doi.org/10.32657/10356/152573openalex-snapshot

Efficient temporal graph processing : shortest paths, closeness centralities and S-cliques

inferred← citeshttps://doi.org/10.32657/10356/59975openalex-snapshot

Parallel graph processing on graphics processing units

inferred← citeshttps://doi.org/10.32657/10356/73229openalex-snapshot

Performance optimization for distributed machine learning and graph processing at scale over virtualized infrastructure

inferred← citeshttps://doi.org/10.32985/ijeces.16.1.3openalex-snapshot

High-Performance Graph Storage and Mutation for Graph Processing and Streaming

inferred← citeshttps://doi.org/10.4108/eai.17-12-2015.150810openalex-snapshot

An Analytical Study of Computation and Communication Tradeoffs in Distributed Graph

inferred← citeshttps://doi.org/10.46299/isg.p.2023.1.25openalex-snapshot

THEORETICAL FOUNDATIONS OF SCIENTISTS AND MODERN OPINIONS REGARDING THE IMPLEMENTATION OF MODERN TRENDS

inferred← citeshttps://doi.org/10.48550/arxiv.2305.05055openalex-snapshot

CPMA: An Efficient Batch-Parallel Compressed Set Without Pointers

inferred← citeshttps://doi.org/10.4995/thesis/10251/195840openalex-snapshot

Interference Analysis and Resource Management in Server Processors: from HPC to Cloud Computing

inferred← citeshttps://doi.org/10.5821/dissertation-2117-114440openalex-snapshot

Performance characterization and optimization of in-memory data analytics on a scale-up server

inferred← citeshttps://doi.org/10.7551/mitpress/11451.001.0001openalex-snapshot

High-Performance Big Data Computing

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.