The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

Publication years (Num. hits)
1969-2016 (19) 2017-2020 (15) 2023-2024 (2)
Publication types (Num. hits)
article(20) inproceedings(16)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 17 occurrences of 13 keywords

Results
Found 36 publication records. Showing 36 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
51Yue-Sun Kuo, W. K. Chou Generating essential primes for a Boolean function with multiple-valued inputs. Search on Bibsonomy DAC The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
31Leomar S. da Rosa Jr., André Inácio Reis, Renato P. Ribas, Felipe de Souza Marques, Felipe Ribeiro Schneider A comparative study of CMOS gates with minimum transistor stacks. Search on Bibsonomy SBCCI The full citation details ... 2007 DBLP  DOI  BibTeX  RDF PTL, unateness, BDDs, technology mapping, switch theory, logical effort, CMOS gates
31Leomar S. da Rosa Jr., Felipe S. Marques 0001, Tiago Muller Gil Cardoso, Renato P. Ribas, Sachin S. Sapatnekar, André Inácio Reis Fast disjoint transistor networks from BDDs. Search on Bibsonomy SBCCI The full citation details ... 2006 DBLP  DOI  BibTeX  RDF PTL, unateness, BDDs, switch theory, CMOS gates
31Felipe S. Marques 0001, Renato P. Ribas, Sachin S. Sapatnekar, André Inácio Reis A new approach to the use of satisfiability in false path detection. Search on Bibsonomy ACM Great Lakes Symposium on VLSI The full citation details ... 2005 DBLP  DOI  BibTeX  RDF unateness, satisfiability, false paths
29Xi Chen 0001, Anindya De, Yuhao Li 0002, Shivam Nadimpalli, Rocco A. Servedio Mildly Exponential Lower Bounds on Tolerant Testers for Monotonicity, Unateness, and Juntas. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
29Xi Chen 0001, Anindya De, Yuhao Li 0002, Shivam Nadimpalli, Rocco A. Servedio Mildly Exponential Lower Bounds on Tolerant Testers for Monotonicity, Unateness, and Juntas. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
29Roksana Baleshzar, Deeparnab Chakrabarty, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, C. Seshadhri 0001 Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps. Search on Bibsonomy Theory Comput. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
29Xi Chen 0001, Erik Waingarten Testing Unateness Nearly Optimally. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
29Amit Levi, Erik Waingarten Lower Bounds for Tolerant Junta and Unateness Testing via Rejection Sampling of Graphs. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
29Xi Chen 0001, Erik Waingarten Testing unateness nearly optimally. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
29Amit Levi, Erik Waingarten Lower Bounds for Tolerant Junta and Unateness Testing via Rejection Sampling of Graphs. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2018 DBLP  BibTeX  RDF
29Amit Levi, Erik Waingarten Lower Bounds for Tolerant Junta and Unateness Testing via Rejection Sampling of Graphs. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
29Roksana Baleshzar, Deeparnab Chakrabarty, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, C. Seshadhri 0001 Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2017 DBLP  BibTeX  RDF
29Roksana Baleshzar, Deeparnab Chakrabarty, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, C. Seshadhri 0001 A Lower Bound for Nonadaptive, One-Sided Error Testing of Unateness of Boolean Functions over the Hypercube. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2017 DBLP  BibTeX  RDF
29Xi Chen 0001, Erik Waingarten, Jinyu Xie Boolean Unateness Testing with Õ(n3/4) Adaptive Queries. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
29Roksana Baleshzar, Deeparnab Chakrabarty, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, C. Seshadhri 0001 Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
29Roksana Baleshzar, Deeparnab Chakrabarty, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, C. Seshadhri 0001 A Lower Bound for Nonadaptive, One-Sided Error Testing of Unateness of Boolean Functions over the Hypercube. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
29Xi Chen 0001, Erik Waingarten, Jinyu Xie Beyond Talagrand Functions: New Lower Bounds for Testing Monotonicity and Unateness. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
29Xi Chen 0001, Erik Waingarten, Jinyu Xie Boolean Unateness Testing with Õ(n3/4) Adaptive Queries. Search on Bibsonomy FOCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
29Roksana Baleshzar, Deeparnab Chakrabarty, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, C. Seshadhri 0001 Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps. Search on Bibsonomy ICALP The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
29Xi Chen 0001, Erik Waingarten, Jinyu Xie Beyond Talagrand functions: new lower bounds for testing monotonicity and unateness. Search on Bibsonomy STOC The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
29Subhash Khot, Igor Shinkar An Õ(n) Queries Adaptive Tester for Unateness. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2016 DBLP  BibTeX  RDF
29Deeparnab Chakrabarty, C. Seshadhri 0001 A Õ(n) Non-Adaptive Tester for Unateness. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2016 DBLP  BibTeX  RDF
29Roksana Baleshzar, Meiram Murzabulatov, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova Testing Unateness of Real-Valued Functions. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
29Subhash Khot, Igor Shinkar An $\widetilde{O}(n)$ Queries Adaptive Tester for Unateness. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
29Deeparnab Chakrabarty, C. Seshadhri 0001 A $\widetilde{O}(n)$ Non-Adaptive Tester for Unateness. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
29Subhash Khot, Igor Shinkar An ~O(n) Queries Adaptive Tester for Unateness. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
29Felipe S. Marques 0001, Osvaldo Martinello, Renato P. Ribas, André Inácio Reis Improvements on the detection of false paths by using unateness and satisfiability. Search on Bibsonomy SBCCI The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
29Dhiraj K. Pradhan Asynchronous State Assignments with Unateness Properties and Fault-Secure Design. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1978 DBLP  DOI  BibTeX  RDF upper bound on the number of state variables, fault-secure networks, self-checking networks, single-transition-time assignments, unate next-state functions, unidirectional faults, universal assignments, fault detection, Asynchronous networks, Berger codes, self-checking checker
29Lawrence T. Fisher Unateness Properties of and-Exclusive-or Logic Circuits. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1974 DBLP  DOI  BibTeX  RDF
29James D. Bargainer R70-34 Unateness Test of a Boolean Function and Two General Synthesis Methods Using Threshold Logic. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1970 DBLP  DOI  BibTeX  RDF
29Branislav Hrúz Unateness Test of a Boolean Function and Two General Synthesis Methods Using Threshold Logic Elements. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1969 DBLP  DOI  BibTeX  RDF
25Kuo-Hua Wang, Chung-Ming Chan, Jung-Chang Liu Simulation and SAT-based Boolean matching for large Boolean networks. Search on Bibsonomy DAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF simulation and SAT, Boolean matching
25Leonardo Franco, José Luis Subirats, Martin Anthony, José M. Jerez A New Constructive Approach for Creating All Linearly Separable (Threshold) Functions. Search on Bibsonomy IJCNN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
25Alan Mishchenko, Tsutomu Sasao Large-scale SOP minimization using decomposition and functional properties. Search on Bibsonomy DAC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF SOP minimization, disjoint-support decomposition, orthodox functions, BDDs, divide-and-conquer strategy
25Frédéric Mailhot 0001, Giovanni De Micheli Technology mapping using boolean matching and don't care sets. Search on Bibsonomy EURO-DAC The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #36 of 36 (100 per page; Change: )
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