The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Danny Krizanc: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  135. On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment. [Citation Graph (, )][DBLP]


  136. On Minimizing the Sum of Sensor Movements for Barrier Coverage of a Line Segment. [Citation Graph (, )][DBLP]


  137. Routing on Delay Tolerant Sensor Networks. [Citation Graph (, )][DBLP]


  138. Asymptotics of Canonical RNA Secondary Structures. [Citation Graph (, )][DBLP]


  139. Inapproximability of the Perimeter Defense Problem. [Citation Graph (, )][DBLP]


  140. Detecting Denial of Service Attacks in Tor. [Citation Graph (, )][DBLP]


  141. Sensor network connectivity with multiple directional antennae of a given angular sum. [Citation Graph (, )][DBLP]


  142. Randomized Rendez-Vous with Limited Memory. [Citation Graph (, )][DBLP]


  143. Maximum Interference of Random Sensors on a Line. [Citation Graph (, )][DBLP]


  144. The Power of Tokens: Rendezvous and Symmetry Detection for Two Mobile Agents in a Ring. [Citation Graph (, )][DBLP]


  145. Communication in wireless networks with directional antennas. [Citation Graph (, )][DBLP]


  146. Off-line routing with small queues on a mesh-connected processor array. [Citation Graph (, )][DBLP]


  147. Distributed computing on anonymous hypercube networks. [Citation Graph (, )][DBLP]


  148. Computing Minimum Spanning Trees with Uncertainty. [Citation Graph (, )][DBLP]


  149. Balancing Traffic Load Using One-Turn Rectilinear Routing. [Citation Graph (, )][DBLP]


  150. An Algorithmic Theory of Mobile Agents. [Citation Graph (, )][DBLP]


  151. The Urinal Problem. [Citation Graph (, )][DBLP]


  152. Assigning Bookmarks in Perfect Binary Trees. [Citation Graph (, )][DBLP]


  153. Revitalizing computing education through free and open source software for humanity. [Citation Graph (, )][DBLP]


  154. Computing Minimum Spanning Trees with Uncertainty [Citation Graph (, )][DBLP]


  155. A Tight Bound on the Maximum Interference of Random Sensors in the Highway Model [Citation Graph (, )][DBLP]


  156. Random maximal independent sets and the unfriendly theater seating arrangement problem. [Citation Graph (, )][DBLP]


Search in 0.096secs, Finished in 0.101secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002