article

Free access

On the Optimality of Some Set Algorithms

Author:

Edward M. ReingoldAuthors Info & Claims

Journal of the ACM (JACM), Volume 19, Issue 4

Pages 649 - 659

https://doi.org/10.1145/321724.321730

Published: 01 October 1972 Publication History

PDF eReader

References

[1]

BLUM, M., FLOYD, R. W., PRATT, V., RIVEST, R. L., AND TARJAN, n .E . Linear time bounds for median computations. Proc. Fourth Ann. ACM Symp. on Theory of Computing, Denver, Colo., 1972, pp. 119-124.

Crossref

Google Scholar

[2]

FORD, L. R. JR., AND JOHNSON, S. M. A tournament problem. Amer. Math. Mon. 66 (1959), 387-389.

Google Scholar

[3]

KNUTH, D.E. The Art of Computer Programming, Vol. 3. Addison-Wesley, Reading, Mass. (in press), Sec. 5.3.1.

Crossref

Google Scholar

[4]

RABIN, M.O. Proving simultaneous positivity of linear forms. Presented at Third Annual ACM Symp. on Theory of Computing, Shaker Heights, Ohio, 1971 (unpublished).

Google Scholar

[5]

STEINHAUS, H. Mathematical Snapshots. Oxford U. Press, New York, 1st ed., 1950; 2nd ed., 1960.

Google Scholar

[6]

STEINHAUS, H. Some remarks about tournaments. Calcutta Math. Soc., Golden Jubilee Commem. Vol. (1958-1959), Pt. II, pp. 323-327.

Google Scholar

Cited By

View all

Cardinal JSharir M(2024)Improved Algebraic Degeneracy TestingDiscrete & Computational Geometry10.1007/s00454-024-00673-7Online publication date: 25-Jun-2024
https://doi.org/10.1007/s00454-024-00673-7
Carbonnel CCooper MMarques-Silva JMarquis PSon TKern-Isberner G(2023)Tractable explaining of multivariate decision treesProceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning10.24963/kr.2023/13(127-135)Online publication date: 2-Sep-2023
https://dl.acm.org/doi/10.24963/kr.2023/13
Lee DWu Y(2023)Geometric complexity of some location problemsAlgorithmica10.1007/BF018404421:1-4(193-211)Online publication date: 22-Mar-2023
https://dl.acm.org/doi/10.1007/BF01840442
Show More Cited By

Index Terms

On the Optimality of Some Set Algorithms
1. Mathematics of computing
  1. Discrete mathematics
2. Theory of computation
  1. Logic
    1. Type theory

Recommendations

Improved Hamming Diversity Measure for Set-Based Optimization Algorithms
Advances in Swarm Intelligence
Abstract
Proper evaluation of the performance of a population-based algorithm often requires a good understanding of the search behaviour of the population over time. One approach towards understanding search behaviour is to measure the diversity of the ...
A covering-based pessimistic multigranulation rough set
ICIC'11: Proceedings of the 7th international conference on Intelligent Computing: bio-inspired computing and applications

In view of granular computing, the classical optimistic and pessimistic multigranulation rough set models are both primarily based on simple granules among multiple granular structures, namely multiple partitions of the universe in MGRS. This ...
Multigranulation rough set theory over two universes

Recently, a multigranulation rough set MGRS has become a new direction in rough set theory, which is based on multiple binary relations on the universe of discourse. The existing literature about multigranulation rough set is based on the assumption of ...

Comments

Information & Contributors

Information

Published In

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 October 1972

Published in JACM Volume 19, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

54
Total Citations
View Citations
677
Total Downloads

Downloads (Last 12 months)55
Downloads (Last 6 weeks)15

Reflects downloads up to 06 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Cardinal JSharir M(2024)Improved Algebraic Degeneracy TestingDiscrete & Computational Geometry10.1007/s00454-024-00673-7Online publication date: 25-Jun-2024
https://doi.org/10.1007/s00454-024-00673-7
Carbonnel CCooper MMarques-Silva JMarquis PSon TKern-Isberner G(2023)Tractable explaining of multivariate decision treesProceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning10.24963/kr.2023/13(127-135)Online publication date: 2-Sep-2023
https://dl.acm.org/doi/10.24963/kr.2023/13
Lee DWu Y(2023)Geometric complexity of some location problemsAlgorithmica10.1007/BF018404421:1-4(193-211)Online publication date: 22-Mar-2023
https://dl.acm.org/doi/10.1007/BF01840442
Bunder MNitaj ASusilo WTonien J(2017)A generalized attack on RSA type cryptosystemsTheoretical Computer Science10.1016/j.tcs.2017.09.009704:C(74-81)Online publication date: 15-Dec-2017
https://dl.acm.org/doi/10.1016/j.tcs.2017.09.009
Jayapaul VIan Munro JRaman VSatti S(2017)Finding modes with equality comparisonsTheoretical Computer Science10.1016/j.tcs.2017.09.007704:C(28-41)Online publication date: 15-Dec-2017
https://dl.acm.org/doi/10.1016/j.tcs.2017.09.007
Salkuyeh DRahimian M(2017)A modification of the generalized shift-splitting method for singular saddle point problemsComputers & Mathematics with Applications10.1016/j.camwa.2017.07.02974:12(2940-2949)Online publication date: 15-Dec-2017
https://dl.acm.org/doi/10.1016/j.camwa.2017.07.029
Jayapaul VRaman VSatti S(2016)Finding Mode Using Equality ComparisonsWALCOM: Algorithms and Computation10.1007/978-3-319-30139-6_28(351-360)Online publication date: 2016
https://doi.org/10.1007/978-3-319-30139-6_28
Jayapaul VMunro JRaman VSatti S(2015)Sorting and Selection with Equality ComparisonsAlgorithms and Data Structures10.1007/978-3-319-21840-3_36(434-445)Online publication date: 28-Jul-2015
https://doi.org/10.1007/978-3-319-21840-3_36
van Kreveld M(2014)Computational GeometryComputing Handbook, Third Edition10.1201/b16812-9(1-24)Online publication date: 8-May-2014
https://doi.org/10.1201/b16812-9
Skiena SSkiena S(2012)Data StructuresThe Algorithm Design Manual10.1007/978-1-84800-070-4_12(366-392)Online publication date: 2012
https://doi.org/10.1007/978-1-84800-070-4_12
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

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

References

Cited By

Index Terms

Recommendations

Improved Hamming Diversity Measure for Set-Based Optimization Algorithms

A covering-based pessimistic multigranulation rough set

Multigranulation rough set theory over two universes

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations