The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Teofilo F. Gonzalez: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Teofilo F. Gonzalez
    Clustering to Minimize the Maximum Intercluster Distance. [Citation Graph (2, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:38, n:, pp:293-306 [Journal]
  2. Teofilo F. Gonzalez, Si-Qing Zheng
    Simple Three-Layer Channel Routing Algorithms. [Citation Graph (0, 0)][DBLP]
    AWOC, 1988, pp:237-246 [Conf]
  3. Hans L. Bodlaender, Teofilo F. Gonzalez, Ton Kloks
    Complexity Aspects of Map Compression. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1991, pp:287-296 [Conf]
  4. Sartaj Sahni, Teofilo F. Gonzalez
    P-Complete Problems and Approximate Solutions [Citation Graph (0, 0)][DBLP]
    FOCS, 1974, pp:28-32 [Conf]
  5. Teofilo F. Gonzalez
    MultiMessage Multicasting: Complexity and Approximations. [Citation Graph (0, 0)][DBLP]
    HICSS (1), 1997, pp:211-220 [Conf]
  6. Teofilo F. Gonzalez
    On Minimizing the Number of Page Faults with Complete Information. [Citation Graph (0, 0)][DBLP]
    IMACS World Congress, 1982, pp:77-81 [Conf]
  7. Teofilo F. Gonzalez
    Gossiping in the Multicasting Communication Environment. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2001, pp:55- [Conf]
  8. Teofilo F. Gonzalez
    Multi-Message Multicasting. [Citation Graph (0, 0)][DBLP]
    IRREGULAR, 1996, pp:217-228 [Conf]
  9. Teofilo F. Gonzalez, Toshio Murayama
    Alhorithms for a Class of Min-Cut and Max-Cut Problem. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1992, pp:97-105 [Conf]
  10. Teofilo F. Gonzalez
    Improving the Computation and Communication Time with Buffers. [Citation Graph (0, 0)][DBLP]
    IASTED PDCS, 2005, pp:336-341 [Conf]
  11. Teofilo F. Gonzalez, David Serena
    Complexity of k-Pairwise Disjoint Shortest Paths in the Undirected Hypercubic Network and Related Problems. [Citation Graph (0, 0)][DBLP]
    IASTED PDCS, 2002, pp:61-66 [Conf]
  12. Edu Metz, Raimondas Lencevicius, Teofilo F. Gonzalez
    Performance data collection using a hybrid approach. [Citation Graph (0, 0)][DBLP]
    ESEC/SIGSOFT FSE, 2005, pp:126-135 [Conf]
  13. Teofilo F. Gonzalez
    The On-Line d-Dimensional Dictionary Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:376-385 [Conf]
  14. Teofilo F. Gonzalez
    Simple Algorithms for the On-Line Multidimensional Dictionary and Related Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:28, n:2, pp:255-267 [Journal]
  15. Teofilo F. Gonzalez
    Simple Algorithms for Multimessage Multicasting with Forwarding. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:29, n:4, pp:511-533 [Journal]
  16. Teofilo F. Gonzalez, Si-Qing Zheng
    Approximation Algorithms for Partitioning a Rectangle with Interior Points. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1990, v:5, n:1, pp:11-42 [Journal]
  17. Ömer Egecioglu, Teofilo F. Gonzalez
    A Computationally Intractable Problem on Simplicial Complexes. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1996, v:6, n:, pp:85-98 [Journal]
  18. Teofilo F. Gonzalez, Mohammadreza Razzazi, Man-tak Shing, Si-Qing Zheng
    On Optimal Guillotine Partitions Approximating Optimal D-box Partitions. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1994, v:4, n:, pp:1-11 [Journal]
  19. Amit M. Bhosle, Teofilo F. Gonzalez
    Exact and Approximation Algorithms for Finding an Optimal Bridge Connecting Two Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2005, v:15, n:6, pp:609-630 [Journal]
  20. Teofilo F. Gonzalez, Si-Qing Zheng
    An efficient divide and conquer approximation algorithm for partitionning into D-boxes. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1993, v:3, n:4, pp:417-428 [Journal]
  21. Teofilo F. Gonzalez
    On Solving Multimessage Multicasting Problems. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2001, v:12, n:6, pp:791-808 [Journal]
  22. Teofilo F. Gonzalez
    A Simple LP-Free Approximation Algorithm for the Minimum Weight Vertex Cover Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:54, n:3, pp:129-131 [Journal]
  23. Teofilo F. Gonzalez
    Covering a Set of Points in Multidimensional Space. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:40, n:4, pp:181-188 [Journal]
  24. Teofilo F. Gonzalez
    Improved Approximation Algorithms for Embedding Hyperedges in a Cycle. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:67, n:5, pp:267-271 [Journal]
  25. Teofilo F. Gonzalez, Donald B. Johnson
    Sorting Numbers in Linear Expected Time and Optimal Extra Space. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1982, v:15, n:3, pp:119-124 [Journal]
  26. Teofilo F. Gonzalez, Donald B. Johnson
    A New Algorithm for Preemptive Scheduling of Trees. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1980, v:27, n:2, pp:287-312 [Journal]
  27. Teofilo F. Gonzalez, Sing-Ling Lee
    A linear time algorithm for optimal routing around a rectangle. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1988, v:35, n:4, pp:810-831 [Journal]
  28. Teofilo F. Gonzalez, Sartaj Sahni
    Open Shop Scheduling to Minimize Finish Time. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1976, v:23, n:4, pp:665-679 [Journal]
  29. Teofilo F. Gonzalez, Sartaj Sahni
    Preemptive Scheduling of Uniform Processor Systems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1978, v:25, n:1, pp:92-101 [Journal]
  30. Sartaj Sahni, Teofilo F. Gonzalez
    P-Complete Approximation Problems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1976, v:23, n:3, pp:555-565 [Journal]
  31. Teofilo F. Gonzalez, Joseph JáJá
    On the Complexity of Computing Bilinear Forms with {0, 1} Constants. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1980, v:20, n:1, pp:77-95 [Journal]
  32. Simeon C. Ntafos, Teofilo F. Gonzalez
    On the Computational Complexity of Path Cover Problems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1984, v:29, n:2, pp:225-242 [Journal]
  33. Amit M. Bhosle, Teofilo F. Gonzalez
    Algorithms for Single Link Failure Recovery and Related Problems. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2004, v:8, n:2, pp:275-294 [Journal]
  34. Russell Brandt, Teofilo F. Gonzalez
    Wavelength Assignment in Multifiber Optical Star Networks under the Multicasting Communication Mode. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2005, v:6, n:4, pp:383-406 [Journal]
  35. Teofilo F. Gonzalez
    Distributed Algorithm for Multimessage Multicasting. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2000, v:1, n:4, pp:303-314 [Journal]
  36. Teofilo F. Gonzalez
    Complexity and Approximations for Multimessage Multicasting. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1998, v:55, n:2, pp:215-235 [Journal]
  37. Teofilo F. Gonzalez, Si-Qing Zheng
    Inproved Bounds for Rectangular and Guillotine Partitions. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1989, v:7, n:6, pp:591-610 [Journal]
  38. Teofilo F. Gonzalez
    Bounded Fan-Out Multimessage Multicasting. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1998, v:5, n:3, pp:196-213 [Journal]
  39. Hans L. Bodlaender, Teofilo F. Gonzalez, Ton Kloks
    Complexity Aspects of Two-Dimensional Data Compression. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1995, v:2, n:4, pp:462-495 [Journal]
  40. Teofilo F. Gonzalez, David Serena
    n-Cube network: node disjoint shortest paths for maximal distance pairs of vertices. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 2004, v:30, n:8, pp:973-998 [Journal]
  41. Ajoy Kumar Datta, Teofilo F. Gonzalez, Visalakshi Thiagarajan
    Self-Stabilizing Algorithms for Tree Metrics. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1998, v:8, n:1, pp:121-133 [Journal]
  42. Teofilo F. Gonzalez, Oscar H. Ibarra, Sartaj Sahni
    Bounds for LPT Schedules on Uniform Processors. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:1, pp:155-166 [Journal]
  43. Teofilo F. Gonzalez, Joseph JáJá
    Evaluation of Arithmetic Expressions with Algebraic Identities. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:4, pp:633-662 [Journal]
  44. Teofilo F. Gonzalez, Sing-Ling Lee
    A 1.6 Approximation Algorithm for Routing Multiterminal Nets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:4, pp:669-704 [Journal]
  45. Teofilo F. Gonzalez, Joseph Y.-T. Leung, Michael Pinedo
    Minimizing total completion time on uniform machines with deadline constraints. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:1, pp:95-115 [Journal]
  46. Teofilo F. Gonzalez
    A Note on Open Shop Preemptive Schedules. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1979, v:28, n:10, pp:782-786 [Journal]
  47. Teofilo F. Gonzalez, Sing-Ling Lee
    Routing Multiterminal Nets Around a Rectangle. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1986, v:35, n:6, pp:543-549 [Journal]
  48. Teofilo F. Gonzalez
    An Approximation Problem for the Multi-Via Assignment Problem. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1984, v:3, n:4, pp:257-264 [Journal]
  49. Teofilo F. Gonzalez, Shashishekhar Kurki-Gowdara
    Minimization of the number of layers for single row routing with fixed street capacity. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1988, v:7, n:3, pp:420-424 [Journal]
  50. Teofilo F. Gonzalez, Shashishekhar Kurki-Gowdara
    An approximation algorithm for the via placement problem. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1989, v:8, n:3, pp:219-228 [Journal]
  51. Teofilo F. Gonzalez, David Serena
    Complexity of pairwise shortest path routing in the grid. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:326, n:1-3, pp:155-185 [Journal]
  52. Teofilo F. Gonzalez, David Serena
    Pairwise edge disjoint shortest paths in the n-cube. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:427-435 [Journal]
  53. Teofilo F. Gonzalez
    Efficient Resource Utilization in Parallel and Distributed Systems. [Citation Graph (0, 0)][DBLP]
    The Journal of Supercomputing, 2004, v:28, n:1, pp:5-6 [Journal]
  54. Teofilo F. Gonzalez, Sartaj Sahni, William R. Franta
    An Efficient Algorithm for the Kolmogorov-Smirnov and Lilliefors Tests. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 1977, v:3, n:1, pp:60-64 [Journal]
  55. Teofilo F. Gonzalez
    An Efficient Algorithm for Gossiping in the Multicasting Communication Environment. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2003, v:14, n:7, pp:701-708 [Journal]
  56. Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez
    Approximation Algorithms for the Minimum-Length Corridor and Related Problems. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:253-256 [Conf]
  57. Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez
    Complexity of the minimum-length corridor problem. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:37, n:2, pp:72-103 [Journal]

  58. Bounds for partitioning rectilinear polygons. [Citation Graph (, )][DBLP]


  59. Message Dissemination under the Multicasting Communication Mode. [Citation Graph (, )][DBLP]


  60. Efficient Algorithms and Routing Protocols for Handling Transient Single Node Failures [Citation Graph (, )][DBLP]


  61. Distributed Algorithms for Computing Alternate Paths Avoiding Failed Nodes and Links [Citation Graph (, )][DBLP]


Search in 0.081secs, Finished in 0.084secs
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