The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for derandomization with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1989-1996 (17) 1997-1998 (19) 1999-2001 (20) 2002-2003 (23) 2004-2005 (35) 2006-2007 (27) 2008 (15) 2009-2010 (33) 2011-2012 (19) 2013-2015 (15) 2016-2017 (21) 2018-2019 (26) 2020 (17) 2021 (18) 2022 (21) 2023 (22)
Publication types (Num. hits)
article(163) incollection(5) inproceedings(176) phdthesis(4)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 207 occurrences of 111 keywords

Results
Found 348 publication records. Showing 348 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
67D. Sivakumar Algorithmic Derandomization via Complexity Theory. Search on Bibsonomy CCC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Johnson-Lindenstrauss Lemma, Derandomization, randomized rounding
67Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim A New General Derandomization Method. Search on Bibsonomy J. ACM The full citation details ... 1998 DBLP  DOI  BibTeX  RDF BPP, derandomization, Boolean circuits
62Jeff Kinne, Dieter van Melkebeek, Ronen Shaltiel Pseudorandom Generators and Typically-Correct Derandomization. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
62Chi-Jen Lu Derandomizing Arthur-Merlin games under uniform assumptions. Search on Bibsonomy Comput. Complex. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF graph nonisomorphism problem, nondeterminism, Derandomization, uniformity, Arthur-Merlin games
62Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson Near-Optimal Conversion of Hardness into Pseudo-Randomness. Search on Bibsonomy FOCS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Pseudo-Ranndom Generators, Derandomization
57Moni Naor, Leonard J. Schulman, Aravind Srinivasan Splitters and Near-Optimal Derandomization. Search on Bibsonomy FOCS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF splitters, near-optimal derandomization, fairly general method, k-restrictions, probabilistic bound, near-optimal constructions, fixed-subgraph finding algorithms, deterministic constructions, local-coloring protocol, computational complexity, learning, probability, computational linguistics, hardness of approximation, set cover, derandomization, randomised algorithms, exhaustive testing
53Olivier Teytaud, Sylvain Gelly DCMA: yet another derandomization in covariance-matrix-adaptation. Search on Bibsonomy GECCO The full citation details ... 2007 DBLP  DOI  BibTeX  RDF quasi-random, evolution strategies, derandomization
53Gagan Aggarwal, Amos Fiat, Andrew V. Goldberg, Jason D. Hartline, Nicole Immorlica, Madhu Sudan 0001 Derandomization of auctions. Search on Bibsonomy STOC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF auctions, mechanism design, derandomization
48H. Venkateswaran Derandomization of Probabilistic Auxiliary Pushdown Automata Classes. Search on Bibsonomy CCC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
48Ankur Bhargava, S. Rao Kosaraju Derandomization of Dimensionality Reduction and SDP Based Algorithms. Search on Bibsonomy WADS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
48Rahul Santhanam, Dieter van Melkebeek Holographic Proofs and Derandomization. Search on Bibsonomy CCC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
48D. Sivakumar Algorithmic derandomization via complexity theory. Search on Bibsonomy STOC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
48Eric Allender When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity. Search on Bibsonomy FSTTCS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
48Bernard Chazelle Irregularities of Distribution, Derandomization, and Complexity Theory. Search on Bibsonomy FSTTCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
48Andrei Z. Broder, Moses Charikar, Michael Mitzenmacher A Derandomization Using Min-Wise Independent Permutations. Search on Bibsonomy RANDOM The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
47Amir Shpilka, Avi Wigderson Derandomizing homomorphism testing in general groups. Search on Bibsonomy STOC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF homomorphism testing, derandomization, linearity testing
47Valentine Kabanets Easiness Assumptions and Hardness Tests: Trading Time for Zero Error. Search on Bibsonomy CCC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF probabilistic complexity classes, uniform setting, derandomization
43Luqing Wang, Chintha Tellambura Cross-Entropy-Based Sign-Selection Algorithms for Peak-to-Average Power Ratio Reduction of OFDM Systems. Search on Bibsonomy IEEE Trans. Signal Process. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
43Lance Fortnow, Rahul Santhanam Infeasibility of instance compression and succinct PCPs for NP. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF instance compression, succinct PCPs, cryptography, parameterized complexity, polynomial hierarchy
43Anand Srivastav, Peter Stangier On Quadratic Lattice Approximations. Search on Bibsonomy ISAAC The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
39Lijie Chen 0001, Roei Tell, Ryan Williams 0001 Derandomization vs Refutation: A Unified Framework for Characterizing Derandomization. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
39Lijie Chen 0001 New Lower Bounds and Derandomization for ACC, and a Derandomization-Centric View on the Algorithmic Method. Search on Bibsonomy ITCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
39Lijie Chen 0001, Roei Tell, Ryan Williams 0001 Derandomization vs Refutation: A Unified Framework for Characterizing Derandomization. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
39Lijie Chen 0008 New Lower Bounds and Derandomization for ACC, and a Derandomization-centric View on the Algorithmic Method. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2022 DBLP  BibTeX  RDF
39Ketan Mulmuley Geometric Complexity Theory V: Equivalence between blackbox derandomization of polynomial identity testing and derandomization of Noether's Normalization Lemma Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
39Ketan Mulmuley Geometric Complexity Theory V: Equivalence between Blackbox Derandomization of Polynomial Identity Testing and Derandomization of Noether's Normalization Lemma. Search on Bibsonomy FOCS The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
38Hervé Brönnimann, Bernard Chazelle, Jirí Matousek 0001 Product Range Spaces, Sensitive Sampling, and Derandomization Search on Bibsonomy FOCS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF 3-dimensional space, product range spaces, sensitive sampling, sampling theorems, standard finite VC-dimensional case, optimal deterministic convex hull algorithm, n-point set, deterministic algorithm, derandomization
34Marius Zimand Exposure-Resilient Extractors and the Derandomization of Probabilistic Sublinear Time. Search on Bibsonomy Comput. Complex. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Subject classification, 68Q15
34Moritz Müller Parameterized Derandomization. Search on Bibsonomy IWPEC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
34Harry Buhrman, Lance Fortnow, Aduri Pavan Some Results on Derandomization. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
34Harry Buhrman, Lance Fortnow, Aduri Pavan Some Results on Derandomization. Search on Bibsonomy STACS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
34Eric Allender, Michal Koucký 0001, Detlef Ronneburger, Sambuddha Roy Derandomization and Distinguishing Complexity. Search on Bibsonomy CCC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
34Adam R. Klivans On the Derandomization of Constant Depth Circuits. Search on Bibsonomy RANDOM-APPROX The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
34Lance Fortnow Comparing Notions of Full Derandomization. Search on Bibsonomy CCC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
34Yijie Han, Yoshihide Igarashi Parallel PROFIT/COST Algorithms Through Fast Derandomization. Search on Bibsonomy Acta Informatica The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
34Roy Armoni On the Derandomization of Space-Bounded Computations. Search on Bibsonomy RANDOM The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
34Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim Worst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-Offs. Search on Bibsonomy ICALP The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
33Gary L. Miller, Donald R. Sheehy Approximate center points with proofs. Search on Bibsonomy SCG The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Tverberg's theorem, centerpoints, approximation algorithms, derandomization
33Olivier Teytaud When Does Quasi-random Work?. Search on Bibsonomy PPSN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Evolution Strategies, Derandomization
33Russell Impagliazzo Can every randomized algorithm be derandomized? Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF algebraic circuit complexity, probabilistic algorithms, derandomization, circuit complexity, complexity classes, pseudo-randomness
33Valentine Kabanets, Russell Impagliazzo Derandomizing polynomial identity tests means proving circuit lower bounds. Search on Bibsonomy STOC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF BPP, NEXP, circuit lower bounds, derandomization, polynomial identity testing
33Benjamin Doerr Antirandomizing the Wrong Game. Search on Bibsonomy ICALP The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Games, randomization, derandomization
33Peter Bro Miltersen, N. V. Vinodchandran Derandomizing Arthur-Merlin Games Using Hitting Sets. Search on Bibsonomy FOCS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF derandomization, hitting sets, Arthur-Merlin games
33Moses Charikar, Chandra Chekuri, Ashish Goel, Sudipto Guha, Serge A. Plotkin Approximating a Finite Metric by a Small Number of Tree Metrics. Search on Bibsonomy FOCS The full citation details ... 1998 DBLP  DOI  BibTeX  RDF probabilistic approximation of metric spaces, low diameter partitioning, real normed spaces, algorithms, linear programming, approximation, metric space, derandomization, tree metric
29George Karakostas General Pseudo-random Generators from Weaker Models of Computation. Search on Bibsonomy ISAAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF monotone circuit complexity, circuit complexity, Pseudo-random generators
29Manindra Agrawal, V. Vinay Arithmetic Circuits: A Chasm at Depth Four. Search on Bibsonomy FOCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
29Vikraman Arvind, Partha Mukhopadhyay Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
29Vikraman Arvind, Jacobo Torán Solvable Group Isomorphism. Search on Bibsonomy CCC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
29Chi-Jen Lu Derandomizing Arthur-Merlin Games under Uniform Assumptions. Search on Bibsonomy ISAAC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
29Vojtech Rödl, Andrzej Rucinski 0001, Michelle Wagner An Algorithmic Embedding of Graphs via Perfect Matchings. Search on Bibsonomy RANDOM The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
29Anand Srivastav, Peter Stangier Integer Multicommodity Flows with Reduced Demands. Search on Bibsonomy ESA The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
20Yishu Zeng Derandomization of persuasion mechanisms. Search on Bibsonomy J. Econ. Theory The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
20Lijie Chen 0001, Ron D. Rothblum, Roei Tell, Eylon Yogev On Exponential-time Hypotheses, Derandomization, and Circuit Lower Bounds. Search on Bibsonomy J. ACM The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
20Dean Doron, Roei Tell Derandomization with Minimal Memory Footprint. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
20Yakov Shalunov Leakage-Resilient Hardness Equivalence to Logspace Derandomization. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
20Mohsen Ghaffari 0001, Christoph Grunau, Václav Rozhon Work-Efficient Parallel Derandomization I: Chernoff-like Concentrations via Pairwise Independence. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
20Ronen Shaltiel, Emanuele Viola On Hardness Assumptions Needed for "Extreme High-End" PRGs and Fast Derandomization. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
20Sameep Dahal, Francesco D'Amore 0001, Henrik Lievonen, Timothé Picavet, Jukka Suomela Distributed derandomization revisited. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
20Mohsen Ghaffari 0001, Christoph Grunau Work-Efficient Parallel Derandomization II: Optimal Concentrations via Bootstrapping. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
20Tianrong Lin Quantum and Probabilistic Computers Rigorously Powerful than Traditional Computers, and Derandomization. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
20Kouhei Nakaji, Suguru Endo, Yuichiro Matsuzaki, Hideaki Hakoshima Measurement optimization of variational quantum simulation by classical shadow and derandomization. Search on Bibsonomy Quantum The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
20Mohsen Ghaffari 0001, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, Václav Rozhon Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization. Search on Bibsonomy SODA The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
20Mohsen Ghaffari 0001, Christoph Grunau, Václav Rozhon Work-Efficient Parallel Derandomization I: Chernoff-like Concentrations via Pairwise Independence. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
20Sameep Dahal, Francesco D'Amore 0001, Henrik Lievonen, Timothé Picavet, Jukka Suomela Brief Announcement: Distributed Derandomization Revisited. Search on Bibsonomy DISC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
20Alexander Golovnev, Tom Gur, Igor Shinkar Derandomization of Cell Sampling. Search on Bibsonomy SOSA The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
20Aaron (Louie) Putterman, Edward Pyne Near-Optimal Derandomization of Medium-Width Branching Programs. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
20Lijie Chen 0001, Roei Tell When Arthur Has Neither Random Coins Nor Time to Spare: Superfast Derandomization of Proof Systems. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
20Dieter van Melkebeek, Nicollas M. Sdroievski Leakage Resilience, Targeted Pseudorandom Generators, and Mild Derandomization of Arthur-Merlin Protocols. Search on Bibsonomy FSTTCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
20Dean Doron, Roei Tell Derandomization with Minimal Memory Footprint. Search on Bibsonomy CCC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
20Sorrachai Yingchareonthawornchai Vertex Connectivity via Local Computation: Breaking Quadratic Time, Poly-logarithmic Max-flows, and Derandomization. Search on Bibsonomy 2023   RDF
20Nir Bitansky, Vinod Vaikuntanathan A Note on Perfect Correctness by Derandomization. Search on Bibsonomy J. Cryptol. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
20Kuan Cheng, William M. Hoza Hitting Sets Give Two-Sided Derandomization of Small Space. Search on Bibsonomy Theory Comput. The full citation details ... 2022 DBLP  BibTeX  RDF
20Yanyi Liu, Rafael Pass Characterizing Derandomization Through Hardness of Levin-Kolmogorov Complexity. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2022 DBLP  BibTeX  RDF
20Aaron (Louie) Putterman, Edward Pyne Near-Optimal Derandomization of Medium-Width Branching Programs. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2022 DBLP  BibTeX  RDF
20Samuel Epstein 0001 Derandomization Under Different Resource Constraints. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2022 DBLP  BibTeX  RDF
20Lijie Chen 0001, Roei Tell When Arthur has Neither Random Coins nor Time to Spare: Superfast Derandomization of Proof Systems. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2022 DBLP  BibTeX  RDF
20Roei Tell Quantified Derandomization: How to Find Water in the Ocean. Search on Bibsonomy Found. Trends Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
20Samuel Epstein 0001 22 Examples of Solution Compression via Derandomization. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
20Samuel Epstein 0001 Derandomization under Different Resource Constraints. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
20Jimmy Wu, Yatong Chen, Yang Liu Metric-Fair Classifier Derandomization. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
20Mohsen Ghaffari 0001, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, Václav Rozhon Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
20Nir Bitansky, Sapir Freizeit Statistically Sender-Private OT from LPN and Derandomization. Search on Bibsonomy IACR Cryptol. ePrint Arch. The full citation details ... 2022 DBLP  BibTeX  RDF
20Lijie Chen 0001, Hanlin Ren Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
20Zeyu Guo 0001, Mrinal Kumar 0001, Ramprasad Saptharishi, Noam Solomon Derandomization from Algebraic Hardness. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
20Ronen Shaltiel, Emanuele Viola On Hardness Assumptions Needed for "Extreme High-End" PRGs and Fast Derandomization. Search on Bibsonomy ITCS The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
20Nir Bitansky, Sapir Freizeit Statistically Sender-Private OT from LPN and Derandomization. Search on Bibsonomy CRYPTO (3) The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
20Pranav Bisht, Nitin Saxena 0001 Derandomization via Symmetric Polytopes: Poly-Time Factorization of Certain Sparse Polynomials. Search on Bibsonomy FSTTCS The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
20Yanyi Liu, Rafael Pass Characterizing Derandomization Through Hardness of Levin-Kolmogorov Complexity. Search on Bibsonomy CCC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
20Oliver Korten Derandomization from Time-Space Tradeoffs. Search on Bibsonomy CCC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
20Jimmy Wu, Yatong Chen, Yang Liu Metric-Fair Classifier Derandomization. Search on Bibsonomy ICML The full citation details ... 2022 DBLP  BibTeX  RDF
20Lior Rotem, Gil Segev 0001 Injective Trapdoor Functions via Derandomization: How Strong is Rudich's Black-Box Barrier? Search on Bibsonomy J. Cryptol. The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
20Pascal Koiran, Mateusz Skomra Derandomization and absolute reconstruction for sums of powers of linear forms. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
20Ronen Shaltiel, Emanuele Viola On Hardness Assumptions Needed for "Extreme High-End" PRGs and Fast Derandomization. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2021 DBLP  BibTeX  RDF
20William Hoza Better Pseudodistributions and Derandomization for Space-Bounded Computation. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2021 DBLP  BibTeX  RDF
20Roei Tell How to Find Water in the Ocean: A Survey on Quantified Derandomization. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2021 DBLP  BibTeX  RDF
20Moses Ganardi, Danny Hucke, Markus Lohrey Derandomization for Sliding Window Algorithms with Strict Correctness∗. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
20Paul Viallard, Pascal Germain, Amaury Habrard, Emilie Morvant A General Framework for the Derandomization of PAC-Bayesian Bounds. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
20Hsin-Yuan Huang, Richard Kueng, John Preskill Efficient estimation of Pauli observables by derandomization. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
20Alexander Golovnev, Tom Gur, Igor Shinkar Derandomization of Cell Sampling. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
20Laurent Feuilloley, Pierre Fraigniaud Randomized Local Network Computing: Derandomization Beyond Locally Checkable Labelings. Search on Bibsonomy ACM Trans. Parallel Comput. The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 348 (100 per page; Change: )
Pages: [1][2][3][4][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license