On syntactic versus computational views of approximability

Veröffentlicht 1995

Effect of reinforcement and fiber-matrix interface on dynamic fracture of fiber reinforced composite materials

von Khanna, Sanjeev Kumar
Veröffentlicht 1992

New Trade-Offs for Fully Dynamic Matching via Hierarchical EDCS

von Behnezhad, Soheil
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (2022 : Online) ACM-SIAM Symposium on Discrete Algorithms (SODA22) ; Volume 5 of 5 (2022)

A Faster Combinatorial Algorithm for Maximum Bipartite Matching

von Chuzhoy, Julia
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (35. : 2024 : Alexandria, Va.) 2024 ACM-SIAM Symposium on Discrete Algorithms (SODA 2024) ; Volume 3 of 7 (2024)

Nash dynamics in congestion games with similar resources

von Bhalgat, Anand
Veröffentlicht in Internet and network economics (2009)

Hardness of Approximation for Orienteering with Multiple Time Windows

von Garg, Naveen
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (32. : 2021 : Online) Thirty-second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021) ; Volume 4 of 4 (2021)

On diameter verification and boolean matrix multiplication

von Basch, Julien
Veröffentlicht 1995

Complexity classifications of Boolean constraint satisfaction problems

von Creignou, Nadia
Veröffentlicht 2001

Complexity classifications of Boolean constraint satisfaction problems

von Creignou, Nadia
Veröffentlicht 2001

Query Complexity of the Metric Steiner Tree Problem

von Chen, Yu
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (34. : 2023 : Florenz; Online) Thirty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023) ; Volume 7 of 7 (2023)

Mechanics of materials : a modern integration of mechanics and materials in structural design

von Jenkins, C. H.
Veröffentlicht 2005

Complexity classifications of Boolean constraint satisfaction problems

von Creignou, Nadia
Veröffentlicht 2001

Approximation algorithms for the largest common subtree problem

von Khanna, Sanjeev
Veröffentlicht 1995

A complete classification of the approximability of maximization problems derived from boolean constraint satisfaction

von Khanna, Sanjeev
Veröffentlicht 1997

Approximate optimization of convex functions with outlier noise

von De, Anindya
Veröffentlicht in NeurIPS (35. : 2021 : Online) 35th Conference on Neural Information Processing Systems (NeurIPS 2021) ; Volume 10 of 36 (2022)

Sublinear Algorithms for Hierarchical Clustering

von Agarwal, Arpit
Veröffentlicht in NeurIPS (36. : 2022 : New Orleans, La.; Online) 36th Conference on Neural Information Processing Systems (NeurIPS 2022 ; Volume 5 of 50 (2023)

RANK AGGREGATION FROM PAIRWISE COMPARISONS IN THE PRESENCE OF ADVERSARIAL CORRUPTIONS

von Agarwal, Arpit
Veröffentlicht in International Conference on Machine Learning (37. : 2020 : Online) 37th International Conference on Machine Learning (ICML 2020) ; Part 1 of 15 (2021)

Special issue on STOC 2000 : [6 papers whose preliminary versions appeared in the proceedings of the 32nd Annual ACM Symposium on Theory of Computing, held in Portland, Oregon, M...

Veröffentlicht 2002

A greedy approximation algorithm for minimum-gap scheduling

von Chrobak, Marek
Veröffentlicht in Journal of scheduling (2017)

Special issue on STOC 2003 : [... at the 35th ACM Symposium on Theory of Computing (STOC), held in San Diego on June 9-11, 2003]

Veröffentlicht 2004