Search dblp for Publications

export results for "toc:db/journals/algorithmica/algorithmica16.bht:"

 download as .bib file

@article{DBLP:journals/algorithmica/AlonN96,
  author       = {Noga Alon and
                  Moni Naor},
  title        = {Derandomization, Witnesses for Boolean Matrix Multiplication and Construction
                  of Perfect Hash Functions},
  journal      = {Algorithmica},
  volume       = {16},
  number       = {4/5},
  pages        = {434--449},
  year         = {1996},
  url          = {https://doi.org/10.1007/BF01940874},
  doi          = {10.1007/BF01940874},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/AlonN96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/AltGMKW96,
  author       = {Helmut Alt and
                  Leonidas J. Guibas and
                  Kurt Mehlhorn and
                  Richard M. Karp and
                  Avi Wigderson},
  title        = {A Method for Obtaining Randomized Algorithms with Small Tail Probabilities},
  journal      = {Algorithmica},
  volume       = {16},
  number       = {4/5},
  pages        = {543--547},
  year         = {1996},
  url          = {https://doi.org/10.1007/BF01940879},
  doi          = {10.1007/BF01940879},
  timestamp    = {Fri, 25 Dec 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/AltGMKW96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/Ambainis96,
  author       = {Andris Ambainis},
  title        = {Communication Complexity in a 3-Computer Model},
  journal      = {Algorithmica},
  volume       = {16},
  number       = {3},
  pages        = {298--301},
  year         = {1996},
  url          = {https://doi.org/10.1007/BF01955678},
  doi          = {10.1007/BF01955678},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Ambainis96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/Avis96,
  author       = {David Avis},
  title        = {Generating Rooted Triangulations Without Repetitions},
  journal      = {Algorithmica},
  volume       = {16},
  number       = {6},
  pages        = {618--632},
  year         = {1996},
  url          = {https://doi.org/10.1007/BF01944353},
  doi          = {10.1007/BF01944353},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Avis96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/BattistaT96a,
  author       = {Giuseppe Di Battista and
                  Roberto Tamassia},
  title        = {Guest Editors' Introduction to the Special Issue on Graph Drwaing},
  journal      = {Algorithmica},
  volume       = {16},
  number       = {1},
  pages        = {1--3},
  year         = {1996},
  url          = {https://doi.org/10.1007/BF02086605},
  doi          = {10.1007/BF02086605},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/BattistaT96a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/BoseLL96,
  author       = {Prosenjit Bose and
                  William J. Lenhart and
                  Giuseppe Liotta},
  title        = {Characterizing Proximity Trees},
  journal      = {Algorithmica},
  volume       = {16},
  number       = {1},
  pages        = {83--110},
  year         = {1996},
  url          = {https://doi.org/10.1007/BF02086609},
  doi          = {10.1007/BF02086609},
  timestamp    = {Tue, 20 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/BoseLL96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/ChoyFS96,
  author       = {David M. Choy and
                  Ronald Fagin and
                  Larry J. Stockmeyer},
  title        = {Efficiently Extendible Mappings for Balanced Data Distribution},
  journal      = {Algorithmica},
  volume       = {16},
  number       = {2},
  pages        = {215--232},
  year         = {1996},
  url          = {https://doi.org/10.1007/BF01940647},
  doi          = {10.1007/BF01940647},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/ChoyFS96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/ColeGO96,
  author       = {Richard Cole and
                  Michael T. Goodrich and
                  Colm {\'{O}}'D{\'{u}}nlaing},
  title        = {A Nearly Optimal Deterministic Parallel Voroni Diagram Algorithm},
  journal      = {Algorithmica},
  volume       = {16},
  number       = {6},
  pages        = {569--617},
  year         = {1996},
  url          = {https://doi.org/10.1007/BF01944352},
  doi          = {10.1007/BF01944352},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/ColeGO96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/DengP96,
  author       = {Xiaotie Deng and
                  Christos H. Papadimitriou},
  title        = {Competitive Distributed Decision-Making},
  journal      = {Algorithmica},
  volume       = {16},
  number       = {2},
  pages        = {133--150},
  year         = {1996},
  url          = {https://doi.org/10.1007/BF01940643},
  doi          = {10.1007/BF01940643},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/DengP96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/EadesW96,
  author       = {Peter Eades and
                  Sue Whitesides},
  title        = {The Realization Problem for Euclidean Minimum Spanning Trees in NP-Hard},
  journal      = {Algorithmica},
  volume       = {16},
  number       = {1},
  pages        = {60--82},
  year         = {1996},
  url          = {https://doi.org/10.1007/BF02086608},
  doi          = {10.1007/BF02086608},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/EadesW96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/Edahiro96,
  author       = {Masato Edahiro},
  title        = {Equispreading Tree in Manhattan Distance},
  journal      = {Algorithmica},
  volume       = {16},
  number       = {3},
  pages        = {316--338},
  year         = {1996},
  url          = {https://doi.org/10.1007/BF01955680},
  doi          = {10.1007/BF01955680},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Edahiro96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/FlamminiGS96,
  author       = {Michele Flammini and
                  Giorgio Gambosi and
                  Sandro Salomone},
  title        = {Interval Routing Schemes},
  journal      = {Algorithmica},
  volume       = {16},
  number       = {6},
  pages        = {549--568},
  year         = {1996},
  url          = {https://doi.org/10.1007/BF01944351},
  doi          = {10.1007/BF01944351},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/FlamminiGS96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/GiammarresiI96,
  author       = {Dora Giammarresi and
                  Giuseppe F. Italiano},
  title        = {Decremental 2- and 3-Connectivity on Planar Graphs},
  journal      = {Algorithmica},
  volume       = {16},
  number       = {3},
  pages        = {263--287},
  year         = {1996},
  url          = {https://doi.org/10.1007/BF01955676},
  doi          = {10.1007/BF01955676},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/GiammarresiI96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/HuangLV96,
  author       = {Shou{-}Hsuan Stephen Huang and
                  Hongfei Liu and
                  Rakesh M. Verma},
  title        = {A New Combinatorial Approach to Optimal Embeddings of Rectangles},
  journal      = {Algorithmica},
  volume       = {16},
  number       = {2},
  pages        = {161--180},
  year         = {1996},
  url          = {https://doi.org/10.1007/BF01940645},
  doi          = {10.1007/BF01940645},
  timestamp    = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/HuangLV96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/IliopoulosMP96,
  author       = {Costas S. Iliopoulos and
                  Dennis W. G. Moore and
                  Kunsoo Park},
  title        = {Covering a String},
  journal      = {Algorithmica},
  volume       = {16},
  number       = {3},
  pages        = {288--297},
  year         = {1996},
  url          = {https://doi.org/10.1007/BF01955677},
  doi          = {10.1007/BF01955677},
  timestamp    = {Mon, 18 Dec 2017 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/IliopoulosMP96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/JerrumV96,
  author       = {Mark Jerrum and
                  Umesh V. Vazirani},
  title        = {A Mildly Exponential Approximation Algorithm for the Permanent},
  journal      = {Algorithmica},
  volume       = {16},
  number       = {4/5},
  pages        = {392--401},
  year         = {1996},
  url          = {https://doi.org/10.1007/BF01940871},
  doi          = {10.1007/BF01940871},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/JerrumV96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/JohnsonM96,
  author       = {Donald B. Johnson and
                  Panagiotis Takis Metaxas},
  title        = {Optimal Algorithms for the Single and Multiple Vertex Updating Problems
                  of a Minimum Spanning Tree},
  journal      = {Algorithmica},
  volume       = {16},
  number       = {6},
  pages        = {633--648},
  year         = {1996},
  url          = {https://doi.org/10.1007/BF01944354},
  doi          = {10.1007/BF01944354},
  timestamp    = {Tue, 18 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/JohnsonM96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/JungerM96,
  author       = {Michael J{\"{u}}nger and
                  Petra Mutzel},
  title        = {Maximum Planar Subgraphs and Nice Embeddings: Practical Layout Tools},
  journal      = {Algorithmica},
  volume       = {16},
  number       = {1},
  pages        = {33--59},
  year         = {1996},
  url          = {https://doi.org/10.1007/BF02086607},
  doi          = {10.1007/BF02086607},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/JungerM96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/Kant96,
  author       = {Goos Kant},
  title        = {Drawing Planar Graphs Using the Canonical Ordering},
  journal      = {Algorithmica},
  volume       = {16},
  number       = {1},
  pages        = {4--32},
  year         = {1996},
  url          = {https://doi.org/10.1007/BF02086606},
  doi          = {10.1007/BF02086606},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Kant96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/KarpLH96,
  author       = {Richard M. Karp and
                  Michael Luby and
                  Friedhelm Meyer auf der Heide},
  title        = {Efficient {PRAM} Simulation on a Distributed Memory Machine},
  journal      = {Algorithmica},
  volume       = {16},
  number       = {4/5},
  pages        = {517--542},
  year         = {1996},
  url          = {https://doi.org/10.1007/BF01940878},
  doi          = {10.1007/BF01940878},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/KarpLH96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/Luby96,
  author       = {Michael Luby},
  title        = {Introduction to Special Issue on Randomized and Derandomized Algorithms},
  journal      = {Algorithmica},
  volume       = {16},
  number       = {4/5},
  pages        = {359--366},
  year         = {1996},
  url          = {https://doi.org/10.1007/BF01940869},
  doi          = {10.1007/BF01940869},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Luby96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/LubyV96,
  author       = {Michael Luby and
                  Boban Velickovic},
  title        = {On Deterministic Approximation of {DNF}},
  journal      = {Algorithmica},
  volume       = {16},
  number       = {4/5},
  pages        = {415--433},
  year         = {1996},
  url          = {https://doi.org/10.1007/BF01940873},
  doi          = {10.1007/BF01940873},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/LubyV96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/MatousekSW96,
  author       = {Jir{\'{\i}} Matousek and
                  Micha Sharir and
                  Emo Welzl},
  title        = {A Subexponential Bound for Linear Programming},
  journal      = {Algorithmica},
  volume       = {16},
  number       = {4/5},
  pages        = {498--516},
  year         = {1996},
  url          = {https://doi.org/10.1007/BF01940877},
  doi          = {10.1007/BF01940877},
  timestamp    = {Thu, 24 Jan 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/MatousekSW96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/MehlhornM96,
  author       = {Kurt Mehlhorn and
                  Petra Mutzel},
  title        = {On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing
                  Algorithm},
  journal      = {Algorithmica},
  volume       = {16},
  number       = {2},
  pages        = {233--242},
  year         = {1996},
  url          = {https://doi.org/10.1007/BF01940648},
  doi          = {10.1007/BF01940648},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/MehlhornM96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/MihailW96,
  author       = {Milena Mihail and
                  Peter Winkler},
  title        = {On the Number of Eulerian Orientations of a Graph},
  journal      = {Algorithmica},
  volume       = {16},
  number       = {4/5},
  pages        = {402--414},
  year         = {1996},
  url          = {https://doi.org/10.1007/BF01940872},
  doi          = {10.1007/BF01940872},
  timestamp    = {Mon, 23 Oct 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/MihailW96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/Mulmuley96,
  author       = {Ketan Mulmuley},
  title        = {Randomized Geometric Algorithms and Pseudorandom Generators},
  journal      = {Algorithmica},
  volume       = {16},
  number       = {4/5},
  pages        = {450--463},
  year         = {1996},
  url          = {https://doi.org/10.1007/BF01940875},
  doi          = {10.1007/BF01940875},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Mulmuley96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/MunroR96,
  author       = {J. Ian Munro and
                  Venkatesh Raman},
  title        = {Fast Stable In-Place Sorting with \emph{O (n)} Data Moves},
  journal      = {Algorithmica},
  volume       = {16},
  number       = {2},
  pages        = {151--160},
  year         = {1996},
  url          = {https://doi.org/10.1007/BF01940644},
  doi          = {10.1007/BF01940644},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/MunroR96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/NodineGV96,
  author       = {Mark H. Nodine and
                  Michael T. Goodrich and
                  Jeffrey Scott Vitter},
  title        = {Blocking for External Graph Searching},
  journal      = {Algorithmica},
  volume       = {16},
  number       = {2},
  pages        = {181--214},
  year         = {1996},
  url          = {https://doi.org/10.1007/BF01940646},
  doi          = {10.1007/BF01940646},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/NodineGV96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/PachSS96,
  author       = {J{\'{a}}nos Pach and
                  Farhad Shahrokhi and
                  Mario Szegedy},
  title        = {Applications of the Crossing Number},
  journal      = {Algorithmica},
  volume       = {16},
  number       = {1},
  pages        = {111--117},
  year         = {1996},
  url          = {https://doi.org/10.1007/BF02086610},
  doi          = {10.1007/BF02086610},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/PachSS96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/SeidelA96,
  author       = {Raimund Seidel and
                  Cecilia R. Aragon},
  title        = {Randomized Search Trees},
  journal      = {Algorithmica},
  volume       = {16},
  number       = {4/5},
  pages        = {464--497},
  year         = {1996},
  url          = {https://doi.org/10.1007/BF01940876},
  doi          = {10.1007/BF01940876},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/SeidelA96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/ShahrokhiSSV96,
  author       = {Farhad Shahrokhi and
                  L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely and
                  Ondrej S{\'{y}}kora and
                  Imrich Vrto},
  title        = {Drawings of Graphs on Surfaces with Few Crossings},
  journal      = {Algorithmica},
  volume       = {16},
  number       = {1},
  pages        = {118--131},
  year         = {1996},
  url          = {https://doi.org/10.1007/BF02086611},
  doi          = {10.1007/BF02086611},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/ShahrokhiSSV96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/SunderH96,
  author       = {Sivaprakasam Sunder and
                  Xin He},
  title        = {An {NC} Algorithm for Finding a Minimum Weighted Completion Time Schedule
                  on Series Parallel Graphs},
  journal      = {Algorithmica},
  volume       = {16},
  number       = {3},
  pages        = {243--262},
  year         = {1996},
  url          = {https://doi.org/10.1007/BF01955675},
  doi          = {10.1007/BF01955675},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/SunderH96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/TakahashiSN96,
  author       = {Jun{-}ya Takahashi and
                  Hitoshi Suzuki and
                  Takao Nishizeki},
  title        = {Shortest Noncrossing Paths in Plane Graphs},
  journal      = {Algorithmica},
  volume       = {16},
  number       = {3},
  pages        = {339--357},
  year         = {1996},
  url          = {https://doi.org/10.1007/BF01955681},
  doi          = {10.1007/BF01955681},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/TakahashiSN96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/WangJL96,
  author       = {Lusheng Wang and
                  Tao Jiang and
                  Eugene L. Lawler},
  title        = {Approximation Algorithms for Tree Alignment with a Given Phylogeny},
  journal      = {Algorithmica},
  volume       = {16},
  number       = {3},
  pages        = {302--315},
  year         = {1996},
  url          = {https://doi.org/10.1007/BF01955679},
  doi          = {10.1007/BF01955679},
  timestamp    = {Thu, 23 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/WangJL96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/Weiss96,
  author       = {Mark Allen Weiss},
  title        = {Shellsort with a Constant Number of Increments},
  journal      = {Algorithmica},
  volume       = {16},
  number       = {6},
  pages        = {649--654},
  year         = {1996},
  url          = {https://doi.org/10.1007/BF01944355},
  doi          = {10.1007/BF01944355},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Weiss96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/Zuckerman96,
  author       = {David Zuckerman},
  title        = {Simulating {BPP} Using a General Weak Random Source},
  journal      = {Algorithmica},
  volume       = {16},
  number       = {4/5},
  pages        = {367--391},
  year         = {1996},
  url          = {https://doi.org/10.1007/BF01940870},
  doi          = {10.1007/BF01940870},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Zuckerman96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.