article

Computing dominances inEⁿ (short communication)

Author:

Jiří MatoušekAuthors Info & Claims

Information Processing Letters, Volume 38, Issue 5

Pages 277 - 278

https://doi.org/10.1016/0020-0190(91)90071-O

Published: 14 June 1991 Publication History

Abstract

No abstract available.

Cited By

View all

Abboud AFischer NKelley ZLovett SMeka RMohar BShinkar IO'Donnell R(2024)New Graph Decompositions and Combinatorial Boolean Matrix Multiplication AlgorithmsProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649696(935-943)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649696
Koutris PDeep S(2023)The Fine-Grained Complexity of CFL ReachabilityProceedings of the ACM on Programming Languages10.1145/35712527:POPL(1713-1739)Online publication date: 11-Jan-2023
https://dl.acm.org/doi/10.1145/3571252
Chan TVassilevska Williams VXu YSaha BServedio R(2023)Fredman’s Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and MoreProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585237(419-432)Online publication date: 2-Jun-2023
https://dl.acm.org/doi/10.1145/3564246.3585237
Show More Cited By

Index Terms

Computing dominances inEⁿ (short communication)
1. Computing methodologies
  1. Computer graphics
    1. Shape modeling
2. Theory of computation
  1. Randomness, geometry and discrete structures
    1. Computational geometry

Recommendations

Short communication: Waiting-time distribution of a discrete-time multiserver queue with correlated arrivals and deterministic service times: D-MAP/D/k system

We derive the waiting-time distribution of a discrete-time multiserver queue with correlated arrivals and deterministic (or constant) service times. We show that the procedure for obtaining the waiting-time distribution of a multiserver queue is reduced ...
A characterization of average case communication complexity

It is well known that the average case deterministic communication complexity is bounded below by an entropic quantity, which one would now call deterministic information complexity. In this paper we show a corresponding upper bound. We also improve ...
Computational Geometry A Survey

We survey the state of the art of computational geometry, a discipline that deals with the complexity of geometric problems within the framework of the analysis of algorithms. This newly emerged area of activities has found numerous applications in ...

Comments

Information & Contributors

Information

Published In

Information Processing Letters Volume 38, Issue 5

June 14, 1991

50 pages

ISSN:0020-0190

Editor:
S. G. Akl
Queen's Univ., Kingston, Canada

Issue’s Table of Contents

Publisher

Elsevier North-Holland, Inc.

United States

Publication History

Published: 14 June 1991

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

50
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Abboud AFischer NKelley ZLovett SMeka RMohar BShinkar IO'Donnell R(2024)New Graph Decompositions and Combinatorial Boolean Matrix Multiplication AlgorithmsProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649696(935-943)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649696
Koutris PDeep S(2023)The Fine-Grained Complexity of CFL ReachabilityProceedings of the ACM on Programming Languages10.1145/35712527:POPL(1713-1739)Online publication date: 11-Jan-2023
https://dl.acm.org/doi/10.1145/3571252
Chan TVassilevska Williams VXu YSaha BServedio R(2023)Fredman’s Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and MoreProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585237(419-432)Online publication date: 2-Jun-2023
https://dl.acm.org/doi/10.1145/3564246.3585237
Sornat KVassilevska Williams VXu YBiró PChawla SEchenique F(2021)Fine-Grained Complexity and Algorithms for the Schulze Voting MethodProceedings of the 22nd ACM Conference on Economics and Computation10.1145/3465456.3467630(841-859)Online publication date: 18-Jul-2021
https://dl.acm.org/doi/10.1145/3465456.3467630
Chan TWilliams R(2020)Deterministic APSP, Orthogonal Vectors, and MoreACM Transactions on Algorithms10.1145/340292617:1(1-14)Online publication date: 31-Dec-2020
https://dl.acm.org/doi/10.1145/3402926
Chan T(2019)Orthogonal Range Searching in Moderate DimensionsDiscrete & Computational Geometry10.1007/s00454-019-00062-561:4(899-922)Online publication date: 1-Jun-2019
https://dl.acm.org/doi/10.1007/s00454-019-00062-5
Williams VWilliams R(2018)Subcubic Equivalences Between Path, Matrix, and Triangle ProblemsJournal of the ACM10.1145/318689365:5(1-38)Online publication date: 29-Aug-2018
https://dl.acm.org/doi/10.1145/3186893
Dhifli WDa Costa NElati M(2017)An evolutionary schema for mining skyline clusters of attributed graph data2017 IEEE Congress on Evolutionary Computation (CEC)10.1109/CEC.2017.7969559(2102-2109)Online publication date: 5-Jun-2017
https://dl.acm.org/doi/10.1109/CEC.2017.7969559
Ugarte WBoizumault PCrmilleux BLepailleur ALoudni SPlantevit MRassi CSoulet A(2017)Skypattern miningArtificial Intelligence10.1016/j.artint.2015.04.003244:C(48-69)Online publication date: 1-Mar-2017
https://dl.acm.org/doi/10.1016/j.artint.2015.04.003
Chan TWilliams R(2016)Deterministic APSP, orthogonal vectors, and moreProceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms10.5555/2884435.2884522(1246-1255)Online publication date: 10-Jan-2016
https://dl.acm.org/doi/10.5555/2884435.2884522
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Index Terms

Recommendations

Short communication: Waiting-time distribution of a discrete-time multiserver queue with correlated arrivals and deterministic service times: D-MAP/D/k system

A characterization of average case communication complexity

Computational Geometry A Survey

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations