Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article

On the zone theorem for hyperplane arrangements

Published: 01 April 1993 Publication History

Abstract

No abstract available.

Cited By

View all
  • (2024)Hopcroft’s Problem, Log* Shaving, Two-dimensional Fractional Cascading, and Decision TreesACM Transactions on Algorithms10.1145/359135720:3(1-27)Online publication date: 21-Jun-2024
  • (2024)Quantifying the competitiveness of a dataset in relation to general preferencesThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-023-00804-133:1(231-250)Online publication date: 1-Jan-2024
  • (2024)Minimum-Width Double-Slabs and Widest Empty Slabs in High DimensionsLATIN 2024: Theoretical Informatics10.1007/978-3-031-55598-5_20(303-317)Online publication date: 18-Mar-2024
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image SIAM Journal on Computing
SIAM Journal on Computing  Volume 22, Issue 2
April 1993
209 pages
ISSN:0097-5397
  • Editor:
  • Z. Galil
Issue’s Table of Contents

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 01 April 1993

Author Tags

  1. arrangements
  2. counting faces
  3. discrete and computational geometry
  4. hyperplanes
  5. induction
  6. sweep
  7. zones

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 04 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (2024)Hopcroft’s Problem, Log* Shaving, Two-dimensional Fractional Cascading, and Decision TreesACM Transactions on Algorithms10.1145/359135720:3(1-27)Online publication date: 21-Jun-2024
  • (2024)Quantifying the competitiveness of a dataset in relation to general preferencesThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-023-00804-133:1(231-250)Online publication date: 1-Jan-2024
  • (2024)Minimum-Width Double-Slabs and Widest Empty Slabs in High DimensionsLATIN 2024: Theoretical Informatics10.1007/978-3-031-55598-5_20(303-317)Online publication date: 18-Mar-2024
  • (2023)Convex Hulls of Random Order TypesJournal of the ACM10.1145/357063670:1(1-47)Online publication date: 16-Jan-2023
  • (2022)On the restricted k-Steiner tree problemJournal of Combinatorial Optimization10.1007/s10878-021-00808-z44:4(2893-2918)Online publication date: 1-Nov-2022
  • (2022)Computing Shapley Values in the PlaneDiscrete & Computational Geometry10.1007/s00454-021-00368-367:3(843-881)Online publication date: 1-Apr-2022
  • (2021)Near-optimal randomized algorithms for selection in totally monotone matricesProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458153(1483-1495)Online publication date: 10-Jan-2021
  • (2021)On m-Impact Regions and Standing Top-k Influence ProblemsProceedings of the 2021 International Conference on Management of Data10.1145/3448016.3452832(1784-1796)Online publication date: 9-Jun-2021
  • (2020)On the Restricted 1-Steiner Tree ProblemComputing and Combinatorics10.1007/978-3-030-58150-3_36(448-459)Online publication date: 29-Aug-2020
  • (2017)Determining the Impact Regions of Competing Options in Preference SpaceProceedings of the 2017 ACM International Conference on Management of Data10.1145/3035918.3064044(805-820)Online publication date: 9-May-2017
  • Show More Cited By

View Options

View options

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media