Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("GAL, Anna")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 20 of 20

  • Page / 1

Export

Selection :

  • and

LOWER BOUNDS ON STREAMING ALGORITHMS FOR APPROXIMATING THE LENGTH OF THE LONGEST INCREASING SUBSEQUENCEGAL, Anna; GOPALAN, Parikshit.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 3463-3479, issn 0097-5397, 17 p.Article

A note on monotone complexity and the rank of matricesGAL, Anna; PUDLAK, Pavel.Information processing letters. 2003, Vol 87, Num 6, pp 321-326, issn 0020-0190, 6 p.Article

A theorem on sensitivity and applications in private computationGAL, Anna; ROSEN, Adi.SIAM journal on computing (Print). 2002, Vol 31, Num 5, pp 1424-1437, issn 0097-5397, 14 p.Article

Automata, Languages and Programming (ICALP 2006)GAL, Anna.Theoretical computer science. 2009, Vol 410, Num 44, issn 0304-3975, 90 p.Conference Proceedings

Ω(log n) lower bounds on the amount of randomness in 2-private computationGAL, Anna; ROSEN, Adi.SIAM journal on computing (Print). 2005, Vol 34, Num 4, pp 946-959, issn 0097-5397, 14 p.Article

The size and depth of layered Boolean circuitsGAL, Anna; JANG, Jing-Tang.Information processing letters. 2011, Vol 111, Num 5, pp 213-217, issn 0020-0190, 5 p.Article

A parameterized view on matroid optimization problemsMARX, Dániel.Theoretical computer science. 2009, Vol 410, Num 44, pp 4471-4479, issn 0304-3975, 9 p.Conference Paper

On the correlation between parity and modular polynomialsGAL, Anna; TRIFONOV, Vladimir.Lecture notes in computer science. 2006, pp 387-398, issn 0302-9743, isbn 3-540-37791-3, 1Vol, 12 p.Conference Paper

Maximum weight bipartite matching in matrix multiplication timeSANKOWSKI, Piotr.Theoretical computer science. 2009, Vol 410, Num 44, pp 4480-4488, issn 0304-3975, 9 p.Conference Paper

Approximation algorithms for orthogonal packing problems for hypercubesHARREN, Rolf.Theoretical computer science. 2009, Vol 410, Num 44, pp 4504-4532, issn 0304-3975, 29 p.Conference Paper

Intraoperative bilateral cavernous sinus sampling for ACTH measurements during transsphenoidal pituitary surgery in patient with Cushing's diseaseCZIRJAK, Sandor; BEZZEGH, Attila; GAL, Anna et al.Clinical neurology and neurosurgery. 2002, Vol 104, Num 4, pp 334-338, issn 0303-8467Article

A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroidsCHAUDHURI, Kamalika; RAO, Satish; RIESENFELD, Samantha et al.Theoretical computer science. 2009, Vol 410, Num 44, pp 4489-4503, issn 0304-3975, 15 p.Conference Paper

Optimal resilient sorting and searching in the presence of memory faultsFINOCCHI, Irene; GRANDONI, Fabrizio; ITALIANO, Giuseppe F et al.Theoretical computer science. 2009, Vol 410, Num 44, pp 4457-4470, issn 0304-3975, 14 p.Conference Paper

The cell probe complexity of succinct data structuresGAL, Anna; MILTERSEN, Peter Bro.Theoretical computer science. 2007, Vol 379, Num 3, pp 405-417, issn 0304-3975, 13 p.Conference Paper

On the complexity of 2D discrete fixed point problemXI CHEN; XIAOTIE DENG.Theoretical computer science. 2009, Vol 410, Num 44, pp 4448-4456, issn 0304-3975, 9 p.Conference Paper

The cell probe complexity of succinct data structuresGAL, Anna; MILTERSEN, Peter Bro.Lecture notes in computer science. 2003, pp 332-344, issn 0302-9743, isbn 3-540-40493-7, 13 p.Conference Paper

Communication complexity of simultaneous messagesBABAI, Laszlo; GAL, Anna; KIMMEL, Peter G et al.SIAM journal on computing (Print). 2004, Vol 33, Num 1, pp 137-166, issn 0097-5397, 30 p.Article

Tight Bounds on Computing Error-Correcting Codes by Bounded-Depth Circuits With Arbitrary GatesGAL, Anna; HANSEN, Kristoffer Arnsfelt; KOUCKY, Michal et al.IEEE transactions on information theory. 2013, Vol 59, Num 10, pp 6611-6627, issn 0018-9448, 17 p.Conference Paper

Incremental branching programsGAL, Anna; KOUCKY, Michal; MCKENZIE, Pierre et al.Lecture notes in computer science. 2006, pp 178-190, issn 0302-9743, isbn 3-540-34166-8, 1Vol, 13 p.Conference Paper

Hadamard tensors and lower bounds on multiparty communication complexityFORD, Jeff; GAL, Anna.Lecture notes in computer science. 2005, pp 1163-1175, issn 0302-9743, isbn 3-540-27580-0, 13 p.Conference Paper

  • Page / 1