Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Fürer, Martin - Department of Computer Science and Engineering, Pennsylvania State University
Parallel Edge Coloring Approximation Martin Furer \Lambda Balaji Raghavachari y
Improved Hardness Results for Approximating the Chromatic Number
Approximating the MinimumDegree Steiner Tree to within One of Optimal
Approximating Maximum Independent Set in Bounded Degree Graphs
An Optimal Lower Bound on the Number of Variables for Graph
Graph Isomorphism Testing without Numerics for Graphs of Bounded Eigenvalue Multiplicity
Randomized Splay Trees \Lambda Martin Furer y
Approximation of kSet Cover by SemiLocal Optimization Rongchii Duh, Martin Furer \Lambda
Randomized Splay Trees Martin Furer \Lambda
Weisfeiler-Lehman Refinement Requires at Least a Linear Number of Iterations
Randomized Splay Trees Martin F"urer*
Randomized Splay Trees* Martin F"urery
