Result 1 to 20 of 22 total
Testing Lipschitz functions on hypergrid domains. (English)
Gupta, Anupam (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 15th international workshop, APPROX 2012, and 16th international workshop, RANDOM 2012, Cambridge, MA, USA, August 15‒17, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32511-3/pbk). Lecture Notes in Computer Science 7408, 387-398 (2012).
1
Limitations of local filters of Lipschitz and monotone functions. (English)
Gupta, Anupam (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 15th international workshop, APPROX 2012, and 16th international workshop, RANDOM 2012, Cambridge, MA, USA, August 15‒17, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32511-3/pbk). Lecture Notes in Computer Science 7408, 374-386 (2012).
2
On the complexity of searching in trees and partially ordered structures. (English)
Theor. Comput. Sci. 412, No. 50, 6879-6896 (2011).
3
Capacitated vehicle routing with non-uniform speeds. (English)
Günlük, Oktay (ed.) et al., Integer programming and combinatoral optimization. 15th international conference, IPCO 2011, New York, NY, USA, June 15‒17, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20806-5/pbk). Lecture Notes in Computer Science 6655, 235-247 (2011).
4
A probabilistic analysis of the strength of the split and triangle closures. (English)
Günlük, Oktay (ed.) et al., Integer programming and combinatoral optimization. 15th international conference, IPCO 2011, New York, NY, USA, June 15‒17, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20806-5/pbk). Lecture Notes in Computer Science 6655, 27-38 (2011).
5
Approximation algorithms for correlated knapsacks and non-martingale bandits. (English)
Comput. Res. Repos. 2011, Article No. 1102.3749 (2011).
6
An approximation algorithm for binary searching in trees. (English)
Algorithmica 59, No. 4, 601-620 (2011).
7
Improved approximations for the hotlink assignment problem (English)
ACM Transactions on Algorithms 7, No. 3, 39 (2011).
8
Capacitated vehicle routing with non-uniform speeds (English)
IPCO, 235-247 (2011).
9
A probabilistic analysis of the strength of the Split and triangle closures (English)
IPCO, 27-38 (2011).
10
On greedy algorithms for decision trees. (English)
Cheong, Otfried (ed.) et al., Algorithms and computation. 21st international symposium, ISAAC 2010, Jeju, Korea, December 15‒17, 2010. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-17513-8/pbk). Lecture Notes in Computer Science 6507, 206-217 (2010).
11
Grid and databases: BaSTI as a practical integration example. (English)
J. Grid Comput. 8, No. 2, 223-240 (2010).
12
On the complexity of searching in trees: Average-case minimization. (English)
Abramsky, Samson (ed.) et al., Automata, languages and programming. 37th international colloquium, ICALP 2010, Bordeaux, France, July 6‒10, 2010. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-14164-5/pbk). Lecture Notes in Computer Science 6198, 527-539 (2010).
13
Preliminary results for atmospheric remote sensing data processing through grid computing (English)
HPCS, 666-671 (2010).
14
On the complexity of searching in trees: average-case minimization (English)
ICALP (1), 527-539 (2010).
15
On greedy algorithms for decision trees (English)
ISAAC (2), 206-217 (2010).
16
On the complexity of searching in trees: average-case minimization. (English)
Comput. Res. Repos. 2009, Article No. 0904.3503 (2009).
17
A distributed environment approach for the GPS radio occultation analysis (English)
ICNS, 487-492 (2009).
18
An approximation algorithm for binary searching in trees. (English)
Aceto, Luca (ed.) et al., Automata, languages and programming. 35th international colloquium, ICALP 2008, Reykjavik, Iceland, July 7‒11, 2008. Proceedings, Part I. Berlin: Springer (ISBN 978-3-540-70574-1/pbk). Lecture Notes in Computer Science 5125, 459-471 (2008).
19
An approximation algorithm for binary searching in trees (English)
ICALP (1), 459-471 (2008).
20
Result 1 to 20 of 22 total
Start
Contact
Print
General Help
