Danny Krizanc

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2011
26Encoding 2-D Range Maximum Queries. Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao. CoRR (abs/1109.2885) (2011). Web SearchBibTeXDownload
25Encoding 2D Range Maximum Queries. Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao. ISAAC 2011, 180-189. Web SearchBibTeXDownload
2008
24Realizing partitions respecting full and partial order information. Erik D. Demaine, Jeff Erickson, Danny Krizanc, Henk Meijer, Pat Morin, Mark H. Overmars, Sue Whitesides. J. Discrete Algorithms (6): 51-58 (2008). Web SearchBibTeXDownload
23Computing Minimum Spanning Trees with Uncertainty. Thomas Erlebach, Michael Hoffmann, Danny Krizanc, Matús Mihalák, Rajeev Raman. STACS (abs/0802.2855): 277-288 (2008). Web SearchBibTeXDownload
22Memoryless search algorithms in a network with faulty advice. Nicolas Hanusse, Dimitris J. Kavvadias, Evangelos Kranakis, Danny Krizanc. Theor. Comput. Sci. (402): 190-198 (2008). Web SearchBibTeXDownload
2006
21Topic 12: Theory and Algorithms for Parallel Computation. Geppino Pucci, Michael Kaufmann, Ioannis Caragiannis, Kieran T. Herley. Euro-Par 2006, 799. Web SearchBibTeXDownload
2005
20Efficient Update Strategies for Geometric Computing with Uncertainty. Richard Bruce, Michael Hoffmann, Danny Krizanc, Rajeev Raman. Theory Comput. Syst. (38): 411-423 (2005). Web SearchBibTeXDownload
2004
19Searching with mobile agents in networks with liars. Nicolas Hanusse, Evangelos Kranakis, Danny Krizanc. Discrete Applied Mathematics (137): 69-85 (2004). Web SearchBibTeXDownload
18Topic 13: Theory and Algorithms for Parallel Computation. Christos Kaklamanis, Nancy M. Amato, Danny Krizanc, Andrea Pietracaprina. Euro-Par 2004, 803. Web SearchBibTeXDownload
17Compact Routing Schemes for Dynamic Ring Networks. Danny Krizanc, Flaminia L. Luccio, Rajeev Raman. Theory Comput. Syst. (37): 585-607 (2004). Web SearchBibTeXDownload
2003
16Efficient Update Strategies for Geometric Computing with Uncertainty. Richard Bruce, Michael Hoffmann, Danny Krizanc, Rajeev Raman. CIAC 2003, 12-23. Web SearchBibTeXDownload
15Topic Introduction. Yves Robert, David B. Skillicorn, Pierre Fraigniaud, Peter H. Welch. Euro-Par 2003, 1229. Web SearchBibTeXDownload
2002
14Memoryless Search Algorithms in a Network with Faulty Advice. Nicolas Hanusse, Dimitris J. Kavvadias, Evangelos Kranakis, Danny Krizanc. IFIP TCS 2002, 206-216. Web SearchBibTeX
2001
13Locating Information with Uncertainty in Fully Interconnected Networks with Applications to World Wide Web Information Retrieval. Alexis C. Kaporis, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Yannis C. Stamatiou, Elias C. Stavropoulos. Comput. J. (44): 221-229 (2001). Web SearchBibTeXDownload
12Random Constraint Satisfaction: A More Accurate Picture. Dimitris Achlioptas, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Michael S. O. Molloy, Yannis C. Stamatiou. Constraints (6): 329-344 (2001). Web SearchBibTeXDownload
11Efficient Routing in Networks with Long Range Contacts. Lali Barričre, Pierre Fraigniaud, Evangelos Kranakis, Danny Krizanc. DISC 2001, 270-284. Web SearchBibTeXDownload
10Rigorous results for random (2+p)-SAT. Dimitris Achlioptas, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc. Theor. Comput. Sci. (265): 109-129 (2001). Web SearchBibTeXDownload
2000
9Searching with Mobile Agents in Networks with Liars. Nicolas Hanusse, Evangelos Kranakis, Danny Krizanc. Euro-Par 2000, 583-590. Web SearchBibTeXDownload
1999
8Dynamic Interval Routing on Asynchronous Rings. Danny Krizanc, Flaminia L. Luccio, Rajeev Raman. IPPS/SPDP 1999, 225-232. Web SearchBibTeXDownload
1997
7Many-to-One Packed Routing via Matchings. Danny Krizanc, Louxin Zhang. COCOON 1997, 11-17. Web SearchBibTeXDownload
6Random Constraint Satisfaction: A More Accurate Picture. Dimitris Achlioptas, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Michael S. O. Molloy, Yannis C. Stamatiou. CP 1997, 107-120. Web SearchBibTeXDownload
1996
5Fast Deterministic Selection on Mesh-Connected Processor Arrays. Danny Krizanc, Lata Narayanan, Rajeev Raman. Algorithmica (15): 319-331 (1996). Web SearchBibTeXDownload
4On Multi-Label Linear Interval Routing Schemes. Evangelos Kranakis, Danny Krizanc, S. S. Ravi. Comput. J. (39): 133-139 (1996). Web SearchBibTeXDownload
1993
3On Multi-Label Linear Interval Routing Schemes (Extended Abstract). Evangelos Kranakis, Danny Krizanc, S. S. Ravi. WG 1993, 338-349. Web SearchBibTeXDownload
1991
2Fast Deterministic Selection on Mesh-Connected Processor Arrays. Danny Krizanc, Lata Narayanan, Rajeev Raman. FSTTCS 1991, 336-346. Web SearchBibTeXDownload
1988
1A Time-Randomness Tradeoff for Oblivious Routing (Extended Abstract). Danny Krizanc, David Peleg, Eli Upfal. STOC 1988, 93-102. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research