| 2008 |
|---|
| 148 | EE | Evangelos Kranakis,
Danny Krizanc,
Pat Morin:
Randomized Rendez-Vous with Limited Memory.
LATIN 2008: 605-616 |
| 147 | EE | Jurek Czyzowicz,
Stefan Dobrev,
Evangelos Kranakis,
Danny Krizanc:
The Power of Tokens: Rendezvous and Symmetry Detection for Two Mobile Agents in a Ring.
SOFSEM 2008: 234-246 |
| 146 | EE | Ioannis Caragiannis,
Christos Kaklamanis,
Evangelos Kranakis,
Danny Krizanc,
Andreas Wiese:
Communication in wireless networks with directional antennas.
SPAA 2008: 344-351 |
| 145 | EE | Michael Hoffmann,
Thomas Erlebach,
Danny Krizanc,
Matús Mihalák,
Rajeev Raman:
Computing Minimum Spanning Trees with Uncertainty.
STACS 2008: 277-288 |
| 144 | EE | Stephane Durocher,
Evangelos Kranakis,
Danny Krizanc,
Lata Narayanan:
Balancing Traffic Load Using One-Turn Rectilinear Routing.
TAMC 2008: 467-478 |
| 143 | EE | Evangelos Kranakis,
Danny Krizanc:
Mobile Agents and Exploration.
Encyclopedia of Algorithms 2008 |
| 142 | EE | Thomas Erlebach,
Michael Hoffmann,
Danny Krizanc,
Matús Mihalák,
Rajeev Raman:
Computing Minimum Spanning Trees with Uncertainty
CoRR abs/0802.2855: (2008) |
| 141 | EE | Erik D. Demaine,
Jeff Erickson,
Danny Krizanc,
Henk Meijer,
Pat Morin,
Mark H. Overmars,
Sue Whitesides:
Realizing partitions respecting full and partial order information.
J. Discrete Algorithms 6(1): 51-58 (2008) |
| 140 | EE | Prosenjit Bose,
Vida Dujmovic,
Danny Krizanc,
Stefan Langerman,
Pat Morin,
David R. Wood,
Stefanie Wuhrer:
A Characterization of the degree sequences of 2-trees.
Journal of Graph Theory 58(3): 191-209 (2008) |
| 139 | EE | Danny Krizanc:
Review of "The Game's Afoot: Game Theory in Myth and Paradox by Alexander Mehlmann", American Mathematical Society, 2000, 0-8218-2121-0.
SIGACT News 39(1): 22-24 (2008) |
| 138 | EE | Nicolas Hanusse,
Dimitris J. Kavvadias,
Evangelos Kranakis,
Danny Krizanc:
Memoryless search algorithms in a network with faulty advice.
Theor. Comput. Sci. 402(2-3): 190-198 (2008) |
| 2007 |
|---|
| 137 | EE | Frederick Cohan,
Danny Krizanc,
Yun Lu:
Estimating Bacterial Diversity from Environmental DNA: A Maximum Likelihood Approach.
ISBRA 2007: 133-144 |
| 136 | | Jurek Czyzowicz,
Evangelos Kranakis,
Danny Krizanc,
Andrzej Pelc,
Miguel Vargas Martin:
Assigning Bookmarks in Perfect Binary Trees.
Ars Comb. 82: (2007) |
| 135 | EE | Peter Clote,
Evangelos Kranakis,
Danny Krizanc,
Ladislav Stacho:
Asymptotic expected number of base pairs in optimal secondary structure for random RNA using the Nussinov-Jacobson energy model.
Discrete Applied Mathematics 155(6-7): 759-787 (2007) |
| 2006 |
|---|
| 134 | EE | Danny Krizanc,
Michael Kaufmann,
Pierre Fraigniaud,
Christos D. Zaroliagis:
Topic 12: Theory and Algorithms for Parallel Computation.
Euro-Par 2006: 799 |
| 133 | EE | Evangelos Kranakis,
Danny Krizanc,
Euripides Markou:
Mobile Agent Rendezvous in a Synchronous Torus.
LATIN 2006: 653-664 |
| 132 | EE | Evangelos Kranakis,
Danny Krizanc,
Sergio Rajsbaum:
Mobile Agent Rendezvous: A Survey.
SIROCCO 2006: 1-9 |
| 131 | EE | Leszek Gasieniec,
Evangelos Kranakis,
Danny Krizanc,
X. Zhang:
Optimal Memory Rendezvous of Anonymous Mobile Agents in a Unidirectional Ring.
SOFSEM 2006: 282-292 |
| 130 | EE | Evangelos Kranakis,
Danny Krizanc:
An Algorithmic Theory of Mobile Agents.
TGC 2006: 86-97 |
| 129 | EE | Prosenjit Bose,
Vida Dujmovic,
Danny Krizanc,
Stefan Langerman,
Pat Morin,
David R. Wood,
Stefanie Wuhrer:
A Characterization of the Degree Sequences of 2-Trees
CoRR abs/cs/0605011: (2006) |
| 128 | EE | Christos Kaklamanis,
Danny Krizanc,
Manuela Montangero,
Giuseppe Persiano:
Efficient automatic simulation of parallel computation on networks of workstations.
Discrete Applied Mathematics 154(10): 1500-1509 (2006) |
| 127 | EE | Gianluca De Marco,
Luisa Gargano,
Evangelos Kranakis,
Danny Krizanc,
Andrzej Pelc,
Ugo Vaccaro:
Asynchronous deterministic rendezvous in graphs.
Theor. Comput. Sci. 355(3): 315-326 (2006) |
| 2005 |
|---|
| 126 | EE | Gianluca De Marco,
Luisa Gargano,
Evangelos Kranakis,
Danny Krizanc,
Andrzej Pelc,
Ugo Vaccaro:
Asynchronous Deterministic Rendezvous in Graphs.
MFCS 2005: 271-282 |
| 125 | | Danny Krizanc,
Pat Morin,
Michiel H. M. Smid:
Range Mode and Range Median Queries on Lists and Trees.
Nord. J. Comput. 12(1): 1-17 (2005) |
| 124 | EE | Richard Bruce,
Michael Hoffmann,
Danny Krizanc,
Rajeev Raman:
Efficient Update Strategies for Geometric Computing with Uncertainty.
Theory Comput. Syst. 38(4): 411-423 (2005) |
| 2004 |
|---|
| 123 | EE | Michel Barbeau,
Evangelos Kranakis,
Danny Krizanc,
Pat Morin:
Improving Distance Based Geographic Location Techniques in Sensor Networks.
ADHOC-NOW 2004: 197-210 |
| 122 | EE | Christos Kaklamanis,
Nancy M. Amato,
Danny Krizanc,
Andrea Pietracaprina:
Topic 13: Theory and Algorithms for Parallel Computation.
Euro-Par 2004: 803 |
| 121 | EE | Evangelos Kranakis,
Danny Krizanc,
Jorge Urrutia:
Coverage and Connectivity in Networks with Directional Sensors.
Euro-Par 2004: 917-924 |
| 120 | EE | Paola Flocchini,
Evangelos Kranakis,
Danny Krizanc,
Nicola Santoro,
Cindy Sawchuk:
Multiple Mobile Agent Rendezvous in a Ring.
LATIN 2004: 599-608 |
| 119 | EE | Evangelos Kranakis,
Danny Krizanc,
Eric Williams:
Directional Versus Omnidirectional Antennas for Energy Consumption and k-Connectivity of Networks of Sensors.
OPODIS 2004: 357-368 |
| 118 | EE | Paola Flocchini,
Evangelos Kranakis,
Danny Krizanc,
Flaminia L. Luccio,
Nicola Santoro,
Cindy Sawchuk:
Mobile Agents Rendezvous When Tokens Fail.
SIROCCO 2004: 161-172 |
| 117 | EE | Nicolas Hanusse,
Evangelos Kranakis,
Danny Krizanc:
Searching with mobile agents in networks with liars.
Discrete Applied Mathematics 137(1): 69-85 (2004) |
| 116 | EE | Evangelos Kranakis,
Danny Krizanc,
Sunil M. Shende:
Approximate hotlink assignment.
Inf. Process. Lett. 90(3): 121-128 (2004) |
| 115 | EE | Paola Flocchini,
Evangelos Kranakis,
Danny Krizanc,
Flaminia L. Luccio,
Nicola Santoro:
Sorting and election in anonymous asynchronous rings.
J. Parallel Distrib. Comput. 64(2): 254-265 (2004) |
| 114 | EE | Danny Krizanc,
Flaminia L. Luccio,
Rajeev Raman:
Compact Routing Schemes for Dynamic Ring Networks.
Theory Comput. Syst. 37(5): 585-607 (2004) |
| 2003 |
|---|
| 113 | EE | Richard Bruce,
Michael Hoffmann,
Danny Krizanc,
Rajeev Raman:
Efficient Update Strategies for Geometric Computing with Uncertainty.
CIAC 2003: 12-23 |
| 112 | EE | Christos Kaklamanis,
Danny Krizanc,
Pierre Fraigniaud,
Michael Kaufmann:
Topic Introduction.
Euro-Par 2003: 884 |
| 111 | EE | Evangelos Kranakis,
Nicola Santoro,
Cindy Sawchuk,
Danny Krizanc:
Mobile Agent Rendezvous in a Ring.
ICDCS 2003: 592-599 |
| 110 | | Evangelos Kranakis,
Danny Krizanc,
Miguel Vargas Martin:
Optimizing Web Server's Data Transfer with Hotlinks.
ICWI 2003: 341-346 |
| 109 | EE | Danny Krizanc,
Pat Morin,
Michiel H. M. Smid:
Range Mode and Range Median Queries on Lists and Trees.
ISAAC 2003: 517-526 |
| 108 | | Evangelos Kranakis,
Danny Krizanc,
Sunil M. Shende:
Tracking Users in Cellular Networks using Timing Information.
SIROCCO 2003: 223-234 |
| 107 | EE | Danny Krizanc,
Pat Morin,
Michiel H. M. Smid:
Range Mode and Range Median Queries on Lists and Trees
CoRR cs.DS/0307034: (2003) |
| 106 | | Jurek Czyzowicz,
Evangelos Kranakis,
Danny Krizanc,
Andrzej Pelc,
Mogiel V. Martin:
Enhancing Hyperlink Structure for Improving Web Performance.
J. Web Eng. 1(2): 93-127 (2003) |
| 105 | EE | Lefteris M. Kirousis,
Evangelos Kranakis,
Danny Krizanc,
Yannis C. Stamatiou:
Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory.
Networks 42(3): 169-180 (2003) |
| 104 | EE | Prosenjit Bose,
Danny Krizanc,
Stefan Langerman,
Pat Morin:
Asymmetric Communication Protocols via Hotlink Assignments.
Theory Comput. Syst. 36(6): 655-661 (2003) |
| 2002 |
|---|
| 103 | | Nicolas Hanusse,
Dimitris J. Kavvadias,
Evangelos Kranakis,
Danny Krizanc:
Memoryless Search Algorithms in a Network with Faulty Advice.
IFIP TCS 2002: 206-216 |
| 102 | | Evangelos Kranakis,
Danny Krizanc,
Miguel Vargas Martin:
The Hotlink Optimizer.
International Conference on Internet Computing 2002: 87-94 |
| 101 | | Prosenjit Bose,
Danny Krizanc,
Stefan Langerman,
Pat Morin:
Asymmetric Communication Protocols via Hotlink Assignments.
SIROCCO 2002: 33-39 |
| 100 | EE | Prosenjit Bose,
Evangelos Kranakis,
Christos Kaklamanis,
Lefteris M. Kirousis,
Danny Krizanc,
David Peleg:
Station Layouts in the Presence of Location Constraints.
Journal of Interconnection Networks 3(1-2): 1-17 (2002) |
| 99 | | Krzysztof Diks,
Evangelos Kranakis,
Danny Krizanc,
Andrzej Pelc:
The impact of information on broadcasting time in linear radio networks.
Theor. Comput. Sci. 287(2): 449-471 (2002) |
| 2001 |
|---|
| 98 | EE | Lali Barrière,
Pierre Fraigniaud,
Evangelos Kranakis,
Danny Krizanc:
Efficient Routing in Networks with Long Range Contacts.
DISC 2001: 270-284 |
| 97 | EE | Evangelos Kranakis,
Danny Krizanc,
Sunil M. Shende:
Approximate Hotlink Assignment.
ISAAC 2001: 756-767 |
| 96 | EE | Alexis C. Kaporis,
Lefteris M. Kirousis,
Evangelos Kranakis,
Danny Krizanc,
Yannis C. Stamatiou,
Elias C. Stavropoulos:
Locating Information with Uncertainty in Fully Interconnected Networks with Applications to World Wide Web Information Retrieval.
Comput. J. 44(4): 221-229 (2001) |
| 95 | | Dimitris Achlioptas,
Michael S. O. Molloy,
Lefteris M. Kirousis,
Yannis C. Stamatiou,
Evangelos Kranakis,
Danny Krizanc:
Random Constraint Satisfaction: A More Accurate Picture.
Constraints 6(4): 329-344 (2001) |
| 94 | | Evangelos Kranakis,
Danny Krizanc,
Anil Maheshwari,
Jörg-Rüdiger Sack,
Jorge Urrutia:
Ray shooting from convex ranges.
Discrete Applied Mathematics 108(3): 259-267 (2001) |
| 93 | EE | Jorge Alberto Calvo,
Danny Krizanc,
Pat Morin,
Michael A. Soss,
Godfried T. Toussaint:
Convexifying polygons with simple projections.
Inf. Process. Lett. 80(2): 81-86 (2001) |
| 92 | | Evangelos Kranakis,
Danny Krizanc,
Andrzej Pelc:
Fault-Tolerant Broadcasting in Radio Networks.
J. Algorithms 39(1): 47-67 (2001) |
| 91 | EE | Dimitris Achlioptas,
Lefteris M. Kirousis,
Evangelos Kranakis,
Danny Krizanc:
Rigorous results for random (2+p)-SAT.
Theor. Comput. Sci. 265(1-2): 109-129 (2001) |
| 90 | EE | Evangelos Kranakis,
Danny Krizanc,
Flaminia L. Luccio:
On Recognizing a String on an Anonymous Ring.
Theory Comput. Syst. 34(1): 3-12 (2001) |
| 89 | | Amotz Bar-Noy,
Danny Krizanc,
Arunabha Sen:
Introduction: Discrete Algorithms and Methods for Mobility.
Wireless Networks 7(6): 565-566 (2001) |
| 2000 |
|---|
| 88 | EE | Lefteris M. Kirousis,
Evangelos Kranakis,
Danny Krizanc,
Yannis C. Stamatiou:
Locating Information with Uncertainty in Fully Interconnected Networks.
DISC 2000: 283-296 |
| 87 | EE | Nicolas Hanusse,
Evangelos Kranakis,
Danny Krizanc:
Searching with Mobile Agents in Networks with Liars.
Euro-Par 2000: 583-590 |
| 86 | | Christos Kaklamanis,
Danny Krizanc,
Manuela Montangero,
Pino Persiano:
Efficient Automatic Simulation of Parallel Computation on Network of Workstations.
ICALP Satellite Workshops 2000: 191-202 |
| 85 | EE | Paola Flocchini,
Evangelos Kranakis,
Nicola Santoro,
Danny Krizanc,
Flaminia L. Luccio:
Sorting Multisets in Anonymous Rings.
IPDPS 2000: 275-280 |
| 84 | EE | Prosenjit Bose,
Evangelos Kranakis,
Danny Krizanc,
Miguel Vargas Martin,
Jurek Czyzowicz,
Andrzej Pelc,
Leszek Gasieniec:
Strategies for Hotlink Assignments.
ISAAC 2000: 23-34 |
| 83 | | Jeannette Janssen,
Danny Krizanc,
Lata Narayanan,
Sunil M. Shende:
Distributed Online Frequency Assignment in Cellular Networks.
J. Algorithms 36(2): 119-151 (2000) |
| 82 | EE | Lefteris M. Kirousis,
Evangelos Kranakis,
Danny Krizanc,
Andrzej Pelc:
Power consumption in packet radio networks.
Theor. Comput. Sci. 243(1-2): 289-305 (2000) |
| 1999 |
|---|
| 81 | EE | Prosenjit Bose,
Jurek Czyzowicz,
Evangelos Kranakis,
Danny Krizanc,
Dominic Lessard:
Near optimal-partitioning of rectangles and prisms.
CCCG 1999 |
| 80 | EE | Krzysztof Diks,
Evangelos Kranakis,
Danny Krizanc,
Andrzej Pelc:
The Impact of Knowledge on Broadcasting Time in Radio Networks.
ESA 1999: 41-52 |
| 79 | EE | Danny Krizanc,
Flaminia L. Luccio,
Rajeev Raman:
Dynamic Interval Routing on Asynchronous Rings.
IPPS/SPDP 1999: 225-232 |
| 78 | EE | Prosenjit Bose,
Christos Kaklamanis,
Lefteris M. Kirousis,
Evangelos Kranakis,
Danny Krizanc,
David Peleg:
Station Layouts in the Presence of Location Constraints.
ISAAC 1999: 269-278 |
| 77 | | Evangelos Kranakis,
Danny Krizanc:
Searching with Uncertainty.
SIROCCO 1999: 194-203 |
| 76 | | Leszek Gasieniec,
Evangelos Kranakis,
Danny Krizanc,
Andrzej Pelc:
Minimizing Congestion of Layouts for ATM Networks with Faulty Links.
Int. J. Found. Comput. Sci. 10(4): 503-512 (1999) |
| 75 | | Shlomi Dolev,
Evangelos Kranakis,
Danny Krizanc:
Baked-Potato Routing.
J. Algorithms 30(2): 379-399 (1999) |
| 74 | | Danny Krizanc,
Anton Saarimaki:
Bulk synchronous parallel: practical experience with a model for parallel computing.
Parallel Computing 25(2): 159-181 (1999) |
| 73 | | Shlomi Dolev,
Evangelos Kranakis,
Danny Krizanc,
David Peleg:
Bubbles: Adaptive Routing Scheme for High-Speed Dynamic Networks.
SIAM J. Comput. 29(3): 804-833 (1999) |
| 1998 |
|---|
| 72 | EE | Evangelos Kranakis,
Danny Krizanc,
Andrzej Pelc:
Fault-Tolerant Broadcasting in Radio Networks (Extended Abstract).
ESA 1998: 283-294 |
| 71 | | Danny Krizanc:
A Survey of Randomness and Parallelism in Comparison Problems.
IPPS/SPDP Workshops 1998: 324-329 |
| 70 | | Evangelos Kranakis,
Danny Krizanc,
Jorge Urrutia:
Efficient Regular Polygon Dissections.
JCDCG 1998: 172-187 |
| 69 | | Prosenjit Bose,
Jurek Czyzowicz,
Evangelos Kranakis,
Danny Krizanc,
Anil Maheshwari:
Polygon Cutting: Revisited.
JCDCG 1998: 81-92 |
| 68 | | Jeannette Janssen,
Danny Krizanc,
Lata Narayanan,
Sunil M. Shende:
Distributed Online Frequency Assignment in Cellular Networks.
STACS 1998: 3-13 |
| 67 | | Lefteris M. Kirousis,
Evangelos Kranakis,
Danny Krizanc,
Yannis C. Stamatiou:
Approximating the unsatisfiability threshold of random formulas.
Random Struct. Algorithms 12(3): 253-269 (1998) |
| 66 | EE | Evangelos Kranakis,
Danny Krizanc,
Andrzej Pelc,
David Peleg:
Approximate Maxima Finding of Continuous Functions under Restricted Budget.
Theor. Comput. Sci. 203(1): 151-162 (1998) |
| 1997 |
|---|
| 65 | | Danny Krizanc,
Peter Widmayer:
SIROCCO'97, 4th International Colloquium on Structural Information & Communication Complexity, Monte Verita, Ascona, Switzerland, July 24-26, 1997
Carleton Scientific 1997 |
| 64 | | Danny Krizanc,
Louxin Zhang:
Many-to-One Packed Routing via Matchings.
COCOON 1997: 11-17 |
| 63 | | Dimitris Achlioptas,
Lefteris M. Kirousis,
Evangelos Kranakis,
Danny Krizanc,
Michael S. O. Molloy,
Yannis C. Stamatiou:
Random Constraint Satisfaction: A More Accurate Picture.
CP 1997: 107-120 |
| 62 | | Jurek Czyzowicz,
Evangelos Kranakis,
Danny Krizanc,
Jorge Urrutia:
Discrete Realizations of Contact and Intersection Graphs.
Graph Drawing 1997: 359-370 |
| 61 | | Lefteris M. Kirousis,
Evangelos Kranakis,
Danny Krizanc,
Andrzej Pelc:
Power Consumption in Packet Radio Networks (Extended Abstract).
STACS 1997: 363-374 |
| 60 | EE | Evangelos Kranakis,
Danny Krizanc,
Anil Maheshwari,
Marc Noy,
Jörg-Rüdiger Sack,
Jorge Urrutia:
Stage-graph Representations.
Discrete Applied Mathematics 75(1): 71-80 (1997) |
| 59 | EE | Evangelos Kranakis,
Danny Krizanc,
Berthold Ruf,
Jorge Urrutia,
Gerhard J. Woeginger:
The VC-dimension of Set Systems Defined by Graphs.
Discrete Applied Mathematics 77(3): 237-257 (1997) |
| 58 | | Evangelos Kranakis,
Danny Krizanc,
Andrzej Pelc:
Hop-Congestion Trade-Offs for High-Speed Networks.
Int. J. Found. Comput. Sci. 8(2): 117- (1997) |
| 57 | | Evangelos Kranakis,
Danny Krizanc:
Distributed Computing on Anonymous Hypercube Networks.
J. Algorithms 23(1): 32-50 (1997) |
| 56 | | Amos Israeli,
Evangelos Kranakis,
Danny Krizanc,
Nicola Santoro:
Time-Message Trade-Offs for the Weak Unison Problem.
Nord. J. Comput. 4(4): 317-341 (1997) |
| 55 | EE | Frank Bauernöppel,
Evangelos Kranakis,
Danny Krizanc,
Anil Maheshwari,
Jörg-Rüdiger Sack,
Jorge Urrutia:
Planar Stage Graphs: Characterizations and Applications.
Theor. Comput. Sci. 175(2): 239-255 (1997) |
| 54 | | Christos Kaklamanis,
Danny Krizanc,
Satish Rao:
New Graph Decompositions with Applications to Emulations.
Theory Comput. Syst. 30(1): 39-49 (1997) |
| 1996 |
|---|
| 53 | | Jurek Czyzowicz,
Evangelos Kranakis,
Danny Krizanc,
Jorge Urrutia:
Maximal Length Common Non-intersecting Paths.
CCCG 1996: 185-189 |
| 52 | | Lefteris M. Kirousis,
Evangelos Kranakis,
Danny Krizanc:
Approximating the Unsatisfiability Threshold of Random Formulas (Extended Abstract).
ESA 1996: 27-38 |
| 51 | | Christos Kaklamanis,
Danny Krizanc:
Multipacket Hot-Potato Routing on Processor Arrays.
Euro-Par, Vol. I 1996: 270-277 |
| 50 | | Shlomi Dolev,
Evangelos Kranakis,
Danny Krizanc:
Baked Potato Routing.
ISTCS 1996: 27-36 |
| 49 | | Leszek Gasieniec,
Evangelos Kranakis,
Danny Krizanc,
Andrzej Pelc:
Minimizing Congestion of Layouts for ATM Networks with Faulty Links.
MFCS 1996: 372-381 |
| 48 | | Evangelos Kranakis,
Danny Krizanc,
Andrzej Pelc,
David Peleg:
The Complexity of Data Mining on the Web (Abstract).
PODC 1996: 153 |
| 47 | | Shlomi Dolev,
Evangelos Kranakis,
Danny Krizanc:
Baked Potatoes: Deadlock Prevention Via Scheduling (Abstract).
PODC 1996: 210 |
| 46 | | Evangelos Kranakis,
Danny Krizanc:
Boolean Routing on Cayley Networks.
SIROCCO 1996: 119-124 |
| 45 | | Evangelos Kranakis,
Danny Krizanc:
Lower Bounds for Compact Routing (Extended Abstract).
STACS 1996: 529-540 |
| 44 | | Evangelos Kranakis,
Danny Krizanc,
Andrzej Pelc,
David Peleg:
Approximate Maxima Finding of Continuous Functions Under Restricted Budget (Extended Abstract).
WG 1996: 268-278 |
| 43 | | Danny Krizanc,
Lata Narayanan,
Rajeev Raman:
Fast Deterministic Selection on Mesh-Connected Processor Arrays.
Algorithmica 15(4): 319-331 (1996) |
| 42 | | Evangelos Kranakis,
Danny Krizanc,
S. S. Ravi:
On Multi-Label Linear Interval Routing Schemes.
Comput. J. 39(2): 133-139 (1996) |
| 41 | | Danny Krizanc:
Time-Randomness Trade-offs in Parallel Computation.
J. Algorithms 20(1): 1-19 (1996) |
| 1995 |
|---|
| 40 | | Frank Bauernöppel,
Evangelos Kranakis,
Danny Krizanc,
Anil Maheshwari,
Marc Noy,
Jörg-Rüdiger Sack,
Jorge Urrutia:
Optimal Shooting: Characterizations and Applications.
ICALP 1995: 220-231 |
| 39 | | Evangelos Kranakis,
Danny Krizanc,
Flaminia L. Luccio:
String Recognition on Anonymous Rings.
MFCS 1995: 392-401 |
| 38 | | Evangelos Kranakis,
Danny Krizanc,
Jorge Urrutia:
Implicit Routing and Shortest Path Information (Extended Abstract).
SIROCCO 1995: 101-112 |
| 37 | | Danny Krizanc,
Flaminia L. Luccio:
Boolean Routing on Chordal Rings.
SIROCCO 1995: 89-100 |
| 36 | EE | Shlomi Dolev,
Evangelos Kranakis,
Danny Krizanc,
David Peleg:
Bubbles: adaptive routing scheme for high-speed dynamic networks (Extended Abstract).
STOC 1995: 528-537 |
| 35 | | Evangelos Kranakis,
Danny Krizanc,
Berthold Ruf,
Jorge Urrutia,
Gerhard J. Woeginger:
VC-Dimensions for Graphs (Extended Abstract).
WG 1995: 1-13 |
| 34 | EE | Evangelos Kranakis,
Danny Krizanc:
Labeled Versus Unlabeled Distributed Cayley Networks.
Discrete Applied Mathematics 63(3): 223-236 (1995) |
| 33 | | Danny Krizanc,
Lata Narayanan:
Zero-One Sorting on the Mesh.
Parallel Processing Letters 5: 149-155 (1995) |
| 1994 |
|---|
| 32 | EE | Mike Just,
Evangelos Kranakis,
Danny Krizanc,
Paul C. van Oorschot:
On Key Distribution via True Broadcasting.
ACM Conference on Computer and Communications Security 1994: 81-88 |
| 31 | | Amos Israeli,
Evangelos Kranakis,
Danny Krizanc,
Nicola Santoro:
Time-Message Trade-Offs for the Weak Unison Problem.
CIAC 1994: 167-178 |
| 30 | | Danny Krizanc,
Lata Narayanan:
Sorting and Selection on Arrays with Diagonal Connections.
Canada-France Conference on Parallel and Distributed Computing 1994: 121-136 |
| 29 | | Evangelos Kranakis,
Danny Krizanc,
Jorge Urrutia:
On the Number of Directions in Visibility Representations.
Graph Drawing 1994: 167-176 |
| 28 | | Evangelos Kranakis,
Danny Krizanc:
Labeled versus Unlabeled Distributed Cayley Networks.
SIROCCO 1994: 71-82 |
| 27 | | Evangelos Kranakis,
Danny Krizanc,
Jacob van den Berg:
Computing Boolean Functions on Anonymous Networks
Inf. Comput. 114(2): 214-236 (1994) |
| 26 | | Krzysztof Diks,
Evangelos Kranakis,
Danny Krizanc,
Bernard Mans,
Andrzej Pelc:
Optimal Coteries and Voting Schemes.
Inf. Process. Lett. 51(1): 1-6 (1994) |
| 1993 |
|---|
| 25 | | Christos Kaklamanis,
Danny Krizanc,
Satish Rao:
Universal Emulations with Sublogarithmic Slowdown
FOCS 1993: 341-350 |
| 24 | EE | Christos Kaklamanis,
Danny Krizanc,
Satish Rao:
New Graph Decompositions and Fast Emulations in Hypercubes and Butterflies.
SPAA 1993: 325-334 |
| 23 | | Danny Krizanc,
Lata Narayanan:
Zero-One Sorting on the Mesh.
SPDP 1993: 641-649 |
| 22 | | Danny Krizanc:
A Time-Randomness Tradeoff for Selection in Parallel.
WADS 1993: 464-470 |
| 21 | | Evangelos Kranakis,
Danny Krizanc,
S. S. Ravi:
On Multi-Label Linear Interval Routing Schemes (Extended Abstract).
WG 1993: 338-349 |
| 20 | | Danny Krizanc:
Integer Sorting on a Mesh-Connected Array of Processors.
Inf. Process. Lett. 47(6): 283-289 (1993) |
| 19 | | Danny Krizanc,
Sanguthevar Rajasekaran,
Sunil M. Shende:
A Comparison of Meshes with Static Buses and Half-Duplex Wrap-Arounds.
Parallel Processing Letters 3: 109-114 (1993) |
| 1992 |
|---|
| 18 | | Danny Krizanc,
Lata Narayanan:
Multipacket Selection on Mesh-Connected Processor Arrays.
IPPS 1992: 602-605 |
| 17 | EE | Christos Kaklamanis,
Danny Krizanc,
Satish Rao:
Simple Path Selection for Optimal Routing on Processor Arrays.
SPAA 1992: 23-30 |
| 16 | EE | Christos Kaklamanis,
Danny Krizanc:
Optimal Sorting on Mesh-Connected Processor Arrays.
SPAA 1992: 50-59 |
| 15 | | Evangelos Kranakis,
Danny Krizanc:
Distributed Computing on Cayley Networks (Extended Abstract).
SPDP 1992: 222-229 |
| 14 | | Danny Krizanc,
Lata Narayanan:
Optimal Algorithms for Selection on a Mesh-Connected Processor Array.
SPDP 1992: 70-76 |
| 13 | | Mihály Geréb-Graus,
Danny Krizanc:
The Average Complexity of Parallel Comparison Merging.
SIAM J. Comput. 21(1): 43-47 (1992) |
| 1991 |
|---|
| 12 | | Danny Krizanc,
Lata Narayanan,
Rajeev Raman:
Fast Deterministic Selection on Mesh-Connected Processor Arrays.
FSTTCS 1991: 336-346 |
| 11 | | Danny Krizanc:
A Note on Off-Line Permutation Routing on a Mesh-Connected Processor Array.
ICCI 1991: 418-420 |
| 10 | EE | Christos Kaklamanis,
Danny Krizanc,
Lata Narayanan,
Thanasis Tsantilas:
Randomized Sorting and Selection on Mesh-Connected Processor Arrays (Preliminary Version).
SPAA 1991: 17-28 |
| 9 | | Danny Krizanc:
Oblivious Routing with Limited Buffer Capacity.
J. Comput. Syst. Sci. 43(2): 317-327 (1991) |
| 8 | | Christos Kaklamanis,
Danny Krizanc,
Thanasis Tsantilas:
Tight Bounds for Oblivious Routing in the Hypercube.
Mathematical Systems Theory 24(4): 223-232 (1991) |
| 7 | | Danny Krizanc:
A Note on Off-Line Permutation Routing on a Mesh-Connected Processor Array.
Parallel Processing Letters 1: 67-70 (1991) |
| 1990 |
|---|
| 6 | | Evangelos Kranakis,
Danny Krizanc,
Jacob van den Berg:
Computing Boolean Functions on Anonymous Networks.
ICALP 1990: 254-267 |
| 5 | EE | Christos Kaklamanis,
Danny Krizanc,
Thanasis Tsantilas:
Tight Bounds for Oblivious Routing in the Hypercube.
SPAA 1990: 31-36 |
| 4 | EE | Danny Krizanc:
Integer sorting on a mesh-connected array of processors.
SPDP 1990: 250-253 |
| 1988 |
|---|
| 3 | | Danny Krizanc,
Sanguthevar Rajasekaran,
Thanasis Tsantilas:
Optimal Routing Algorithms for Mesh-Connected Processor Arrays.
AWOC 1988: 411-422 |
| 2 | | Danny Krizanc,
David Peleg,
Eli Upfal:
A Time-Randomness Tradeoff for Oblivious Routing (Extended Abstract)
STOC 1988: 93-102 |
| 1987 |
|---|
| 1 | | Mihály Geréb-Graus,
Danny Krizanc:
The Complexity of Parallel Comparison Merging
FOCS 1987: 195-201 |
