Teofilo F. Gonzalez

Amit M. Bhosle, Teofilo F. Gonzalez: Finding Optimal Geodesic Bridges Between Two Simple Polygons. CCCG 2011

Christopher C. Cipriano, Teofilo F. Gonzalez: Multicasting in the hypercube, chord and binomial graphs. Inf. Process. Lett. 110(17): 774-777 (2010)

Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez: Approximating corridors and tours via restriction and relaxation techniques. ACM Transactions on Algorithms 6(3) (2010)

Teofilo F. Gonzalez: Improved Communication Schedules with Buffers. Parallel Processing Letters 19(1): 129-139 (2009)

Teofilo F. Gonzalez: Continuous Delivery Message Dissemination Problems under the Multicasting Communication Mode. IEEE Trans. Parallel Distrib. Syst. 19(8): 1034-1043 (2008)

Amit M. Bhosle, Teofilo F. Gonzalez: Efficient Algorithms and Routing Protocols for Handling Transient Single Node Failures. CoRR abs/0810.3438 (2008)

Amit M. Bhosle, Teofilo F. Gonzalez: Distributed Algorithms for Computing Alternate Paths Avoiding Failed Nodes and Links. CoRR abs/0811.1301 (2008)

Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez: Complexity of the minimum-length corridor problem. Comput. Geom. 37(2): 72-103 (2007)

Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez: Approximation Algorithms for the Minimum-Length Corridor and Related Problems. CCCG 2007: 253-256

Teofilo F. Gonzalez: Message Dissemination under the Multicasting Communication Mode. PDCAT 2007: 3-4

Teofilo F. Gonzalez, Joseph Y.-T. Leung, Michael Pinedo: Minimizing total completion time on uniform machines with deadline constraints. ACM Transactions on Algorithms 2(1): 95-115 (2006)

Teofilo F. Gonzalez, David Serena: Pairwise edge disjoint shortest paths in the n-cube. Theor. Comput. Sci. 369(1-3): 427-435 (2006)

Amit M. Bhosle, Teofilo F. Gonzalez: Exact and Approximation Algorithms for Finding an Optimal Bridge Connecting Two Simple Polygons. Int. J. Comput. Geometry Appl. 15(6): 609-630 (2005)

Russell Brandt, Teofilo F. Gonzalez: Wavelength Assignment in Multifiber Optical Star Networks under the Multicasting Communication Mode. Journal of Interconnection Networks 6(4): 383-406 (2005)

Teofilo F. Gonzalez: Improving the Computation and Communication Time with Buffers. IASTED PDCS 2005: 336-341

Edu Metz, Raimondas Lencevicius, Teofilo F. Gonzalez: Performance data collection using a hybrid approach. ESEC/SIGSOFT FSE 2005: 126-135

Amit M. Bhosle, Teofilo F. Gonzalez: Algorithms for Single Link Failure Recovery and Related Problems. J. Graph Algorithms Appl. 8(2): 275-294 (2004)

Teofilo F. Gonzalez, David Serena: n-Cube network: node disjoint shortest paths for maximal distance pairs of vertices. Parallel Computing 30(8): 973-998 (2004)

Teofilo F. Gonzalez, David Serena: Complexity of pairwise shortest path routing in the grid. Theor. Comput. Sci. 326(1-3): 155-185 (2004)

Teofilo F. Gonzalez: Efficient Resource Utilization in Parallel and Distributed Systems. The Journal of Supercomputing 28(1): 5-6 (2004)

Teofilo F. Gonzalez: An Efficient Algorithm for Gossiping in the Multicasting Communication Environment. IEEE Trans. Parallel Distrib. Syst. 14(7): 701-708 (2003)

Teofilo F. Gonzalez, David Serena: Complexity of k-Pairwise Disjoint Shortest Paths in the Undirected Hypercubic Network and Related Problems. IASTED PDCS 2002: 61-66

Selim G. Akl, Teofilo F. Gonzalez (Eds.): International Conference on Parallel and Distributed Computing Systems, PDCS 2002, November 4-6, 2002, Cambridge, USA. IASTED/ACTA Press 2002, isbn 0-88986-366-0

Teofilo F. Gonzalez: Simple Algorithms for Multimessage Multicasting with Forwarding. Algorithmica 29(4): 511-533 (2001)

Teofilo F. Gonzalez: On Solving Multimessage Multicasting Problems. Int. J. Found. Comput. Sci. 12(6): 791-808 (2001)

Teofilo F. Gonzalez: Gossiping in the Multicasting Communication Environment. IPDPS 2001: 55

Teofilo F. Gonzalez: Simple Algorithms for the On-Line Multidimensional Dictionary and Related Problems. Algorithmica 28(2): 255-267 (2000)

Teofilo F. Gonzalez: Distributed Algorithm for Multimessage Multicasting. Journal of Interconnection Networks 1(4): 303-314 (2000)

Teofilo F. Gonzalez: Improved Approximation Algorithms for Embedding Hyperedges in a Cycle. Inf. Process. Lett. 67(5): 267-271 (1998)

Teofilo F. Gonzalez: Complexity and Approximations for Multimessage Multicasting. J. Parallel Distrib. Comput. 55(2): 215-235 (1998)

Teofilo F. Gonzalez: Bounded Fan-Out Multimessage Multicasting. Nord. J. Comput. 5(3): 196-213 (1998)

Ajoy Kumar Datta, Teofilo F. Gonzalez, Visalakshi Thiagarajan: Self-Stabilizing Algorithms for Tree Metrics. Parallel Processing Letters 8(1): 121-133 (1998)

Teofilo F. Gonzalez: MultiMessage Multicasting: Complexity and Approximations. HICSS (1) 1997: 211-220

Ömer Egecioglu, Teofilo F. Gonzalez: A Computationally Intractable Problem on Simplicial Complexes. Comput. Geom. 6: 85-98 (1996)

Teofilo F. Gonzalez: Multi-Message Multicasting. IRREGULAR 1996: 217-228

Teofilo F. Gonzalez: A Simple LP-Free Approximation Algorithm for the Minimum Weight Vertex Cover Problem. Inf. Process. Lett. 54(3): 129-131 (1995)

Hans L. Bodlaender, Teofilo F. Gonzalez, Ton Kloks: Complexity Aspects of Two-Dimensional Data Compression. Nord. J. Comput. 2(4): 462-495 (1995)

Teofilo F. Gonzalez, Mohammadreza Razzazi, Man-tak Shing, Si-Qing Zheng: On Optimal Guillotine Partitions Approximating Optimal D-box Partitions. Comput. Geom. 4: 1-11 (1994)

Teofilo F. Gonzalez, Si-Qing Zheng: Single phase three-layer channel routing algorithms. Integration 17(2): 141-151 (1994)

Teofilo F. Gonzalez, Si-Qing Zheng: An efficient divide and conquer approximation algorithm for partitionning into D-boxes. Int. J. Comput. Geometry Appl. 3(4): 417-428 (1993)

Teofilo F. Gonzalez, Toshio Murayama: Alhorithms for a Class of Min-Cut and Max-Cut Problem. ISAAC 1992: 97-105

Teofilo F. Gonzalez: The On-Line d-Dimensional Dictionary Problem. SODA 1992: 376-385

Teofilo F. Gonzalez: Covering a Set of Points in Multidimensional Space. Inf. Process. Lett. 40(4): 181-188 (1991)

Hans L. Bodlaender, Teofilo F. Gonzalez, Ton Kloks: Complexity Aspects of Map Compression. Data Compression Conference 1991: 287-296

Teofilo F. Gonzalez, Si-Qing Zheng: Approximation Algorithms for Partitioning a Rectangle with Interior Points. Algorithmica 5(1): 11-42 (1990)

Teofilo F. Gonzalez, Eugene L. Lawler, Sartaj Sahni: Optimal Preemptive Scheduling of Two Unrelated Processors. INFORMS Journal on Computing 2(3): 219-224 (1990)

Teofilo F. Gonzalez, Si-Qing Zheng: Inproved Bounds for Rectangular and Guillotine Partitions. J. Symb. Comput. 7(6): 591-610 (1989)

Teofilo F. Gonzalez, Shashishekhar Kurki-Gowdara: An approximation algorithm for the via placement problem. IEEE Trans. on CAD of Integrated Circuits and Systems 8(3): 219-228 (1989)

Teofilo F. Gonzalez, Sing-Ling Lee: A linear time algorithm for optimal routing around a rectangle. J. ACM 35(4): 810-831 (1988)

Teofilo F. Gonzalez, Shashishekhar Kurki-Gowdara: Minimization of the number of layers for single row routing with fixed street capacity. IEEE Trans. on CAD of Integrated Circuits and Systems 7(3): 420-424 (1988)

Teofilo F. Gonzalez, Si-Qing Zheng: Simple Three-Layer Channel Routing Algorithms. AWOC 1988: 237-246

Teofilo F. Gonzalez, Sing-Ling Lee: A 1.6 Approximation Algorithm for Routing Multiterminal Nets. SIAM J. Comput. 16(4): 669-704 (1987)

Teofilo F. Gonzalez, Sing-Ling Lee: Routing Multiterminal Nets Around a Rectangle. IEEE Trans. Computers 35(6): 543-549 (1986)

Teofilo F. Gonzalez: Clustering to Minimize the Maximum Intercluster Distance. Theor. Comput. Sci. 38: 293-306 (1985)

Teofilo F. Gonzalez, Si-Qing Zheng: Bounds for partitioning rectilinear polygons. Symposium on Computational Geometry 1985: 281-287

Simeon C. Ntafos, Teofilo F. Gonzalez: On the Computational Complexity of Path Cover Problems. J. Comput. Syst. Sci. 29(2): 225-242 (1984)

Teofilo F. Gonzalez: An Approximation Problem for the Multi-Via Assignment Problem. IEEE Trans. on CAD of Integrated Circuits and Systems 3(4): 257-264 (1984)

Teofilo F. Gonzalez, Donald B. Johnson: Sorting Numbers in Linear Expected Time and Optimal Extra Space. Inf. Process. Lett. 15(3): 119-124 (1982)

Teofilo F. Gonzalez, Joseph JáJá: Evaluation of Arithmetic Expressions with Algebraic Identities. SIAM J. Comput. 11(4): 633-662 (1982)

Teofilo F. Gonzalez: On Minimizing the Number of Page Faults with Complete Information. IMACS World Congress 1982: 77-81

Teofilo F. Gonzalez, Donald B. Johnson: A New Algorithm for Preemptive Scheduling of Trees. J. ACM 27(2): 287-312 (1980)

Teofilo F. Gonzalez, Joseph JáJá: On the Complexity of Computing Bilinear Forms with {0, 1} Constants. J. Comput. Syst. Sci. 20(1): 77-95 (1980)

Teofilo F. Gonzalez: A Note on Open Shop Preemptive Schedules. IEEE Trans. Computers 28(10): 782-786 (1979)

Teofilo F. Gonzalez, Sartaj Sahni: Preemptive Scheduling of Uniform Processor Systems. J. ACM 25(1): 92-101 (1978)

Teofilo F. Gonzalez, Oscar H. Ibarra, Sartaj Sahni: Bounds for LPT Schedules on Uniform Processors. SIAM J. Comput. 6(1): 155-166 (1977)

Teofilo F. Gonzalez, Sartaj Sahni, William R. Franta: An Efficient Algorithm for the Kolmogorov-Smirnov and Lilliefors Tests. ACM Trans. Math. Softw. 3(1): 60-64 (1977)

Sartaj Sahni, Teofilo F. Gonzalez: P-Complete Approximation Problems. J. ACM 23(3): 555-565 (1976)

Teofilo F. Gonzalez, Sartaj Sahni: Open Shop Scheduling to Minimize Finish Time. J. ACM 23(4): 665-679 (1976)

Sartaj Sahni, Teofilo F. Gonzalez: P-Complete Problems and Approximate Solutions. SWAT (FOCS) 1974: 28-32