Skip to Main Content Area
CPS-VO
Contact Support
Browse
Calendar
Announcements
Repositories
Groups
Search
Search for Content
Search for a Group
Search for People
Search for a Project
Tagcloud
› Go to login screen
Not a member?
Click here to register!
Forgot username or password?
Cyber-Physical Systems Virtual Organization
Read-only archive of site from September 29, 2023.
CPS-VO
nearly-linear time algorithm
biblio
Graph Sketching against Adaptive Adversaries Applied to the Minimum Degree Algorithm
Submitted by grigby1 on Mon, 01/21/2019 - 11:38am
pubcrawl
matrix elimination orderings
Metrics
minimum degree algorithm
minimum fill degree
nearly-linear time algorithm
oblivious adversary model
polylogarithmic time
provable approximation
Human behavior
query processing
randomised algorithms
randomized data structure
Resiliency
Scalability
sketching data structure
Sparse matrices
combinatorial scientific computing
adaptive adversarial model
adaptive adversaries applied
Adversary Models
approximate fill degrees
approximate greedy minimum degree orderings
Approximation algorithms
approximation theory
combinatorial mathematics
Adaptation models
computational complexity
computer science
Data models
data structures
graph sketching
graph theory
Heuristic algorithms
