default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnna Gál
Publications
- 2023
[j29]Siddhesh Chaubal
, Anna Gál:
Tight bounds on sensitivity and block sensitivity of some classes of transitive functions. Theor. Comput. Sci. 946: 113687 (2023)- 2022
- [i25]Siddhesh Chaubal, Anna Gál:
Diameter versus Certificate Complexity of Boolean Functions. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c27]Anna Gál, Ridwan Syed:
Upper Bounds on Communication in Terms of Approximate Rank. CSR 2021: 116-130 - [c26]Siddhesh Chaubal, Anna Gál:
Diameter Versus Certificate Complexity of Boolean Functions. MFCS 2021: 31:1-31:22 - 2020
- [c24]Siddhesh Chaubal, Anna Gál:
Tight Bounds on Sensitivity and Block Sensitivity of Some Classes of Transitive Functions. LATIN 2020: 323-335 - [i23]Siddhesh Chaubal, Anna Gál:
Tight Bounds on Sensitivity and Block Sensitivity of Some Classes of Transitive Functions. Electron. Colloquium Comput. Complex. TR20 (2020) - 2019
- [i20]Anna Gál, Ridwan Syed:
Upper Bounds on Communication in terms of Approximate Rank. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c22]Siddhesh Chaubal, Anna Gál:
New Constructions with Quadratic Separation between Sensitivity and Block Sensitivity. FSTTCS 2018: 13:1-13:16 - [i19]Siddhesh Chaubal, Anna Gál:
New Constructions with Quadratic Separation between Sensitivity and Block Sensitivity. Electron. Colloquium Comput. Complex. TR18 (2018) - 2013
- [j23]Jeff Ford, Anna Gál:
Hadamard tensors and lower bounds on multiparty communication complexity. Comput. Complex. 22(3): 595-622 (2013) - 2012
- [j21]Anna Gál, Vladimir Trifonov:
On the Correlation Between Parity and Modular Polynomials. Theory Comput. Syst. 50(3): 516-536 (2012) - 2006
- [c13]Anna Gál, Vladimir Trifonov:
On the Correlation Between Parity and Modular Polynomials. MFCS 2006: 387-398 - [i6]Jeff Ford, Anna Gál:
Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity. Complexity of Boolean Functions 2006 - 2005
- [j12]Anna Gál, Adi Rosén:
Omega(log n) Lower Bounds on the Amount of Randomness in 2-Private Computation. SIAM J. Comput. 34(4): 946-959 (2005) - [c12]Jeff Ford, Anna Gál:
Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity. ICALP 2005: 1163-1175 - 2003
- [c10]Anna Gál, Adi Rosén:
Lower bounds on the amount of randomness in private computation. STOC 2003: 659-666 - 2002
- [j8]Anna Gál, Adi Rosén:
A Theorem on Sensitivity and Applications in Private Computation. SIAM J. Comput. 31(5): 1424-1437 (2002) - 1999
- [c8]Anna Gál, Adi Rosén:
A Theorem on Sensitivity and Applications in Private Computation. STOC 1999: 348-357 - 1994
- [j1]Péter Gács, Anna Gál:
Lower bounds for the complexity of reliable Boolean circuits with noisy gates. IEEE Trans. Inf. Theory 40(2): 579-583 (1994)
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 2024-05-16 23:03 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:
