Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Czumaj, Artur - Department of Computer Science, University of Warwick
Testing Expansion in Bounded-Degree Graphs Artur Czumaj
Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs
Finding a maximum-weight vertex-weighted triangle is not harder than matrix multiplication
Sublinear-time algorithms Artur Czumaj
Testing Geometric Properties Artur Czumaj
Testing Euclidean Minimum Spanning Trees in the Plane Artur Czumaj
Almost Tight Bounds for Reordering Buffer Management * Anna Adamaszek
CCCG 2007, Ottawa, Ontario, August 2022, 2007 Efficient kinetic data structures for MaxCut
Tight Bounds for Worst-Case Equilibria Artur Czumaj
Communication Problems in Random Line-of-Sight Ad-hoc Radio Networks
Optimization vs. decision Some of our decision problems are \proxies"
The Knapsack Problem KNAPSACK is one of 21 problems rst proved
Decision problem: structured input; yes/no Search problem: structured input; output whose
Faster algorithms for finding lowest common ancestors in directed acyclic graphs
Polynomial-time reducibility Introduction
Computing a function Recall polynomially balanced relation: R is a
The bigger picture TIME(f(n)): problems where instances of length
Welcome to cs301 Today: general overview of topic
We have classi ed computational problems into recursive, recursively enumerable, co-recursively
Improved Algorithms for the All-pairs Lowest Common Ancestor Problem in Directed Acyclic Graphs
Boolean functions function f0; 1g n ! f0; 1g
If C is a complexity class, co-C denotes the set of all languages whose complements belong to
Small Space Representations for Metric Min-Sum k-Clustering and their Applications
An O(logk)-competitive algorithm for Generalized Caching
Planar Graphs: Random Walks and Bipartiteness Testing Artur Czumaj