default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMagnus Find
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j8]Magnus Gausdal Find, Alexander Golovnev, Edward A. Hirsch, Alexander S. Kulikov
:
Improving 3N Circuit Complexity Lower Bounds. Comput. Complex. 32(2): 13 (2023)- 2019
- [j7]Joan Boyar, Magnus Gausdal Find, René Peralta:
Small low-depth circuits for cryptographic applications. Cryptogr. Commun. 11(1): 109-127 (2019) - [j6]Magnus Gausdal Find, René Peralta:
Better Circuits for Binary Polynomial Multiplication. IEEE Trans. Computers 68(4): 624-630 (2019) - 2018
- [j5]Joan Boyar, Magnus Gausdal Find:
Multiplicative complexity of vector valued Boolean functions. Theor. Comput. Sci. 720: 36-46 (2018) - 2017
- [j4]Magnus Gausdal Find, Daniel Smith-Tone, Meltem Sönmez Turan:
The number of boolean functions with multiplicative complexity 2. Int. J. Inf. Coding Theory 4(4): 222-236 (2017) - 2016
- [j3]Joan Boyar, Magnus Gausdal Find, René Peralta:
On various nonlinearity measures for boolean functions. Cryptogr. Commun. 8(3): 313-330 (2016) - [j2]Magnus Find, Mika Göös, Matti Järvisalo, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen:
Separating OR, SUM, and XOR circuits. J. Comput. Syst. Sci. 82(5): 793-801 (2016) - 2015
- [j1]Joan Boyar, Magnus Gausdal Find:
Cancellation-free circuits in unbounded and bounded depth. Theor. Comput. Sci. 590: 17-26 (2015)
Conference and Workshop Papers
- 2016
- [c6]Magnus Gausdal Find, Alexander Golovnev, Edward A. Hirsch, Alexander S. Kulikov:
A Better-Than-3n Lower Bound for the Circuit Complexity of an Explicit Function. FOCS 2016: 89-98 - 2015
- [c5]Joan Boyar, Magnus Gausdal Find:
Constructive Relationships Between Algebraic Thickness and Normality. FCT 2015: 106-117 - 2014
- [c4]Magnus Gausdal Find:
On the Complexity of Computing Two Nonlinearity Measures. CSR 2014: 167-175 - [c3]Joan Boyar, Magnus Gausdal Find:
The Relationship between Multiplicative Complexity and Nonlinearity. MFCS (2) 2014: 130-140 - 2013
- [c2]Joan Boyar, Magnus Find, René Peralta:
Four Measures of Nonlinearity. CIAC 2013: 61-72 - [c1]Joan Boyar, Magnus Gausdal Find:
Cancellation-Free Circuits in Unbounded and Bounded Depth. FCT 2013: 159-170
Informal and Other Publications
- 2015
- [i9]Magnus Gausdal Find, Alexander Golovnev, Edward A. Hirsch, Alexander S. Kulikov:
A better-than-3n lower bound for the circuit complexity of an explicit function. Electron. Colloquium Comput. Complex. TR15 (2015) - [i8]Magnus Gausdal Find, Daniel Smith-Tone, Meltem Sönmez Turan:
The Number of Boolean Functions with Multiplicative Complexity 2. IACR Cryptol. ePrint Arch. 2015: 1041 (2015) - 2014
- [i7]Magnus Gausdal Find:
On the Complexity of Computing Two Nonlinearity Measures. CoRR abs/1403.0417 (2014) - [i6]Joan Boyar, Magnus Gausdal Find:
The Relationship Between Multiplicative Complexity and Nonlinearity. CoRR abs/1407.6169 (2014) - [i5]Joan Boyar, Magnus Gausdal Find:
Constructive Relationships Between Algebraic Thickness and Normality. CoRR abs/1410.1318 (2014) - 2013
- [i4]Magnus Find, Mika Göös, Matti Järvisalo, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen:
Separating OR, SUM, and XOR Circuits. CoRR abs/1304.0513 (2013) - [i3]Joan Boyar, Magnus Find:
Cancellation-Free Circuits in Unbounded and Bounded Depth. CoRR abs/1305.3041 (2013) - [i2]Joan Boyar, Magnus Find, René Peralta:
Four Measures of Nonlinearity. IACR Cryptol. ePrint Arch. 2013: 633 (2013) - 2012
- [i1]Joan Boyar, Magnus Find:
Cancellation-free circuits: An approach for proving superlinear lower bounds for linear Boolean operators. CoRR abs/1207.5321 (2012)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-03 00:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
