The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Lata Narayanan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Mark de Berg, Prosenjit Bose, David Bremner, William S. Evans, Lata Narayanan
    Recovering lines with fixed linear probes. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  2. 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]
  3. Lali Barrière, Pierre Fraigniaud, Lata Narayanan
    Robust position-based routing in wireless Ad Hoc networks with unstable transmission ranges. [Citation Graph (0, 0)][DBLP]
    DIAL-M, 2001, pp:19-27 [Conf]
  4. Lata Narayanan, Yihui Tang
    Worst-case analysis of a dynamic channel assignment strategy. [Citation Graph (0, 0)][DBLP]
    DIAL-M, 2000, pp:8-17 [Conf]
  5. 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]
  6. Lata Narayanan, Jaroslav Opatrny
    Wavelength Routing of Uniform Instances in Optical Rings. [Citation Graph (0, 0)][DBLP]
    ICALP Satellite Workshops, 2000, pp:203-214 [Conf]
  7. Danny Krizanc, Lata Narayanan
    Multipacket Selection on Mesh-Connected Processor Arrays. [Citation Graph (0, 0)][DBLP]
    IPPS, 1992, pp:602-605 [Conf]
  8. Lata Narayanan
    Randomized Algorithms on the Mesh. [Citation Graph (0, 0)][DBLP]
    IPPS/SPDP Workshops, 1998, pp:408-417 [Conf]
  9. Jeannette Janssen, Lata Narayanan
    Approximation Algorithms for Channel Assignment with Constraints. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1999, pp:327-336 [Conf]
  10. Francesc Comellas, Margarida Mitjana, Lata Narayanan, Jaroslav Opatrny
    Optical Routing of Uniform Instances in Tori. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:285-294 [Conf]
  11. Sabeel Ansari, Lata Narayanan, Jaroslav Opatrny
    A Generalization of the Face Routing. [Citation Graph (0, 0)][DBLP]
    MobiQuitous, 2005, pp:213-224 [Conf]
  12. Thomas Fevens, Israat Tanzeena Haque, Lata Narayanan
    Randomized Routing Algorithms in Mobile Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    MWCN, 2004, pp:347-357 [Conf]
  13. Sébastien Choplin, Lata Narayanan, Jaroslav Opatrny
    Two-Hop Virtual Path Layout in Tori. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2004, pp:69-78 [Conf]
  14. Lata Narayanan, Naomi Nishimura
    Interval Routing on k-trees. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1996, pp:104-118 [Conf]
  15. Lata Narayanan, Jaroslav Opatrny
    Compact Routing on Chordal Rings. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1997, pp:125-137 [Conf]
  16. Lata Narayanan, Sunil M. Shende
    Characterization of Networks Supporting Shortest-Path Interval Labeling Schemes. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1996, pp:73-87 [Conf]
  17. Lata Narayanan, Sunil M. Shende
    Static Frequency Assignment in Cellular Networks. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1997, pp:215-227 [Conf]
  18. Pilar de la Torre, Lata Narayanan, David Peleg
    Thy Neighbor's Interval is Greener: A Proposal for Exploiting Interval Routing Schemes (Position paper). [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1998, pp:214-228 [Conf]
  19. Lali Barrière, Pierre Fraigniaud, Lata Narayanan, Jaroslav Opatrny
    Dynamic construction of Bluetooth scatternets of fixed degree and low diameter. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:781-790 [Conf]
  20. Lata Narayanan, Jaroslav Opatrny, Dominique Sotteau
    All-to-All Optical Routing in Optimal Chordal Rings of Degree Four. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:695-703 [Conf]
  21. 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]
  22. 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]
  23. Danny Krizanc, Lata Narayanan
    Zero-One Sorting on the Mesh. [Citation Graph (0, 0)][DBLP]
    SPDP, 1993, pp:641-649 [Conf]
  24. 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]
  25. Antoniy Ganchev, Lata Narayanan, Sunil M. Shende
    Mechanisms to Induce Random Choice. [Citation Graph (0, 0)][DBLP]
    WINE, 2006, pp:124-135 [Conf]
  26. Anne Condon, Lata Narayanan
    Upper and Lower Bounds for Selection in the Mesh. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:20, n:1, pp:1-30 [Journal]
  27. 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]
  28. Lata Narayanan, Jaroslav Opatrny
    Compact Routing on Chordal Rings of Degree 4. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:23, n:1, pp:72-96 [Journal]
  29. Lata Narayanan, Jaroslav Opatrny, Dominique Sotteau
    All-to-All Optical Routing in Chordal Rings of Degree 4. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:31, n:2, pp:155-178 [Journal]
  30. Lata Narayanan, Sunil M. Shende
    Static Frequency Assignment in Cellular Networks. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:29, n:3, pp:396-409 [Journal]
  31. Lata Narayanan, Sunil M. Shende
    Corrigendum: Static Frequency Assignment in Cellular Networks. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:32, n:4, pp:679- [Journal]
  32. Lata Narayanan, Yihui Tang
    Worst-case analysis of a dynamic channel assignment strategy. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:140, n:1-3, pp:115-141 [Journal]
  33. 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]
  34. Lata Narayanan, Naomi Nishimura
    Interval Routing on k-Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:26, n:2, pp:325-369 [Journal]
  35. Lata Narayanan, Sunil M. Shende
    Partial characterizations of networks supporting shortest path interval labeling schemes. [Citation Graph (0, 0)][DBLP]
    Networks, 1998, v:32, n:2, pp:103-113 [Journal]
  36. 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]
  37. Jeannette Janssen, Lata Narayanan
    Approximation algorithms for channel assignment with constraints. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:649-667 [Journal]
  38. Lali Barrière, Pierre Fraigniaud, Lata Narayanan, Jaroslav Opatrny
    Robust position-based routing in wireless ad hoc networks with irregular transmission ranges. [Citation Graph (0, 0)][DBLP]
    Wireless Communications and Mobile Computing, 2003, v:3, n:2, pp:141-153 [Journal]

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


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


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


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


  43. Modelling gateway placement in wireless networks: geometric k-centres of unit disc graphs. [Citation Graph (, )][DBLP]


  44. Multiple Sink Positioning in Sensor Networks. [Citation Graph (, )][DBLP]


  45. A new local algorithm for backbone formation in ad hoc networks. [Citation Graph (, )][DBLP]


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


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


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


  49. On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks. [Citation Graph (, )][DBLP]


  50. Efficient Algorithms for Connected Dominating Sets in Ad Hoc Networks. [Citation Graph (, )][DBLP]


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


Search in 0.037secs, Finished in 0.040secs
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