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

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

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