Teofilo F. Gonzalez

Publication Activity (10 Years)

Years Active: 1974-2011
Publications (10 Years): 0

Publications

Amit M. Bhosle, Teofilo F. Gonzalez
Finding Optimal Geodesic Bridges Between Two Simple Polygons. CCCG (2011)
Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez
Approximating corridors and tours via restriction and relaxation techniques. ACM Trans. Algorithms 6 (3) (2010)
Christopher C. Cipriano, Teofilo F. Gonzalez
Multicasting in the hypercube, chord and binomial graphs. Inf. Process. Lett. 110 (17) (2010)
Teofilo F. Gonzalez
Improved Communication Schedules with Buffers. Parallel Process. Lett. 19 (1) (2009)
Amit M. Bhosle, Teofilo F. Gonzalez
Efficient Algorithms and Routing Protocols for Handling Transient Single Node Failures CoRR (2008)
Amit M. Bhosle, Teofilo F. Gonzalez
Distributed Algorithms for Computing Alternate Paths Avoiding Failed Nodes and Links CoRR (2008)
Teofilo F. Gonzalez
Continuous Delivery Message Dissemination Problems under the Multicasting Communication Mode. IEEE Trans. Parallel Distributed Syst. 19 (8) (2008)
Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez
Complexity of the minimum-length corridor problem. Comput. Geom. 37 (2) (2007)
Teofilo F. Gonzalez
Message Dissemination under the Multicasting Communication Mode. PDCAT (2007)
Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez
Approximation Algorithms for the Minimum-Length Corridor and Related Problems. CCCG (2007)
Teofilo F. Gonzalez, Joseph Y.-T. Leung, Michael L. Pinedo
Minimizing total completion time on uniform machines with deadline constraints. ACM Trans. Algorithms 2 (1) (2006)
Teofilo F. Gonzalez, David Serena
Pairwise edge disjoint shortest paths in the n-cube. Theor. Comput. Sci. 369 (1-3) (2006)
Amit M. Bhosle, Teofilo F. Gonzalez
Exact and Approximation Algorithms for Finding an Optimal Bridge Connecting Two Simple Polygons. Int. J. Comput. Geom. Appl. 15 (6) (2005)
Russell Brandt, Teofilo F. Gonzalez
Wavelength Assignment in Multifiber Optical Star Networks under the Multicasting Communication Mode. J. Interconnect. Networks 6 (4) (2005)
Teofilo F. Gonzalez
Improving the Computation and Communication Time with Buffers. IASTED PDCS (2005)
Edu Metz, Raimondas Lencevicius, Teofilo F. Gonzalez
Performance data collection using a hybrid approach. ESEC/SIGSOFT FSE (2005)
Teofilo F. Gonzalez
Efficient Resource Utilization in Parallel and Distributed Systems. J. Supercomput. 28 (1) (2004)
Teofilo F. Gonzalez, David Serena
-Cube network: node disjoint shortest paths for maximal distance pairs of vertices. Parallel Comput. 30 (8) (2004)
Amit M. Bhosle, Teofilo F. Gonzalez
Algorithms for Single Link Failure Recovery and Related Problems. J. Graph Algorithms Appl. 8 (3) (2004)
Teofilo F. Gonzalez, David Serena
Complexity of pairwise shortest path routing in the grid. Theor. Comput. Sci. 326 (1-3) (2004)
Teofilo F. Gonzalez
An Efficient Algorithm for Gossiping in the Multicasting Communication Environment. IEEE Trans. Parallel Distributed Syst. 14 (7) (2003)
Teofilo F. Gonzalez, David Serena
Complexity of k-Pairwise Disjoint Shortest Paths in the Undirected Hypercubic Network and Related Problems. IASTED PDCS (2002)
Teofilo F. Gonzalez
Gossiping in the Multicasting Communication Environment. IPDPS (2001)
Teofilo F. Gonzalez
On Solving Multimessage Multicasting Problems. Int. J. Found. Comput. Sci. 12 (6) (2001)
Teofilo F. Gonzalez
Simple Algorithms for Multimessage Multicasting with Forwarding. Algorithmica 29 (4) (2001)
Teofilo F. Gonzalez
Distributed Algorithm for Multimessage Multicasting. J. Interconnect. Networks 1 (4) (2000)
Teofilo F. Gonzalez
Simple Algorithms for the On-Line Multidimensional Dictionary and Related Problems. Algorithmica 28 (2) (2000)
Teofilo F. Gonzalez, Si-Qing Zheng
On Ensuring Multilayer Wirability by Stretching Layouts. VLSI Design 1998 (4) (1998)
Teofilo F. Gonzalez
Bounded Fan-Out Multimessage Multicasting. Nord. J. Comput. 5 (3) (1998)
Ajoy Kumar Datta, Teofilo F. Gonzalez, Visalakshi Thiagarajan
Self-Stabilizing Algorithms for Tree Metrics. Parallel Process. Lett. 8 (1) (1998)
Teofilo F. Gonzalez
Complexity and Approximations for Multimessage Multicasting. J. Parallel Distributed Comput. 55 (2) (1998)
Teofilo F. Gonzalez
Improved Approximation Algorithms for Embedding Hyperedges in a Cycle. Inf. Process. Lett. 67 (5) (1998)
Teofilo F. Gonzalez
MultiMessage Multicasting: Complexity and Approximations. HICSS (1) (1997)
Ömer Egecioglu, Teofilo F. Gonzalez
A Computationally Intractable Problem on Simplicial Complexes. Comput. Geom. 6 (1996)
Teofilo F. Gonzalez
Multi-Message Multicasting. IRREGULAR (1996)
Teofilo F. Gonzalez
A Simple LP-Free Approximation Algorithm for the Minimum Weight Vertex Cover Problem. Inf. Process. Lett. 54 (3) (1995)
Hans L. Bodlaender, Teofilo F. Gonzalez, Ton Kloks
Complexity Aspects of Two-Dimensional Data Compression. Nord. J. Comput. 2 (4) (1995)
Teofilo F. Gonzalez, Mohammadreza Razzazi, Man-tak Shing, Si-Qing Zheng
On Optimal Guillotine Partitions Approximating Optimal D-box Partitions. Comput. Geom. 4 (1994)
Douglas Chang, Teofilo F. Gonzalez, Oscar H. Ibarra
A flow based approach to the pin redistribution problem for multi-chip modules. Great Lakes Symposium on VLSI (1994)
Teofilo F. Gonzalez, Si-Qing Zheng
Single phase three-layer channel routing algorithms. Integr. 17 (2) (1994)
Teofilo F. Gonzalez, Si-Qing Zheng
An efficient divide and conquer approximation algorithm for partitionning into D-boxes. Int. J. Comput. Geom. Appl. 3 (4) (1993)
Teofilo F. Gonzalez
-Dimensional Dictionary Problem. SODA (1992)
Teofilo F. Gonzalez, Toshio Murayama
Alhorithms for a Class of Min-Cut and Max-Cut Problem. ISAAC (1992)
Teofilo F. Gonzalez, Si-Qing Zheng
Grid stretching algorithms for routing multiterminal nets through a rectangle. Integr. 13 (2) (1992)
Teofilo F. Gonzalez, Mohammadreza Razzazi
On the generalized channel definition problem. Great Lakes Symposium on VLSI (1991)
Teofilo F. Gonzalez
Covering a Set of Points in Multidimensional Space. Inf. Process. Lett. 40 (4) (1991)
Hans L. Bodlaender, Teofilo F. Gonzalez, Ton Kloks
Complexity Aspects of Map Compression. Data Compression Conference (1991)
Teofilo F. Gonzalez, Si-Qing Zheng
Multiterminal-net routing by grid stretching. ICCD (1990)
Teofilo F. Gonzalez, Eugene L. Lawler, Sartaj Sahni
Optimal Preemptive Scheduling of Two Unrelated Processors. INFORMS J. Comput. 2 (3) (1990)
Teofilo F. Gonzalez, Si-Qing Zheng
Approximation Algorithms for Partitioning a Rectangle with Interior Points. Algorithmica 5 (1) (1990)
Teofilo F. Gonzalez, Si-Qing Zheng
Inproved Bounds for Rectangular and Guillotine Partitions. J. Symb. Comput. 7 (6) (1989)
Teofilo F. Gonzalez, Si-Qing Zheng
Stretching and three-layer wiring planar layouts. Integr. 8 (2) (1989)
Teofilo F. Gonzalez, Shashishekhar Kurki-Gowdara
An approximation algorithm for the via placement problem. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 8 (3) (1989)
Teofilo F. Gonzalez, Sing-Ling Lee
A linear time algorithm for optimal routing around a rectangle. J. ACM 35 (4) (1988)
Teofilo F. Gonzalez, Shashishekhar Kurki-Gowdara
Minimization of the number of layers for single row routing with fixed street capacity. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 7 (3) (1988)
Teofilo F. Gonzalez, Si-Qing Zheng
Simple Three-Layer Channel Routing Algorithms. AWOC (1988)
Teofilo F. Gonzalez, Sing-Ling Lee
A 1.6 Approximation Algorithm for Routing Multiterminal Nets. SIAM J. Comput. 16 (4) (1987)
Teofilo F. Gonzalez, Sing-Ling Lee
Routing Multiterminal Nets Around a Rectangle. IEEE Trans. Computers 35 (6) (1986)
Teofilo F. Gonzalez, Si-Qing Zheng
Bounds for partitioning rectilinear polygons. SCG (1985)
Teofilo F. Gonzalez
Clustering to Minimize the Maximum Intercluster Distance. Theor. Comput. Sci. 38 (1985)
Simeon C. Ntafos, Teofilo F. Gonzalez
On the Computational Complexity of Path Cover Problems. J. Comput. Syst. Sci. 29 (2) (1984)
Teofilo F. Gonzalez
An Approximation Problem for the Multi-Via Assignment Problem. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 3 (4) (1984)
Teofilo F. Gonzalez
Unit Execution Time Shop Problems. Math. Oper. Res. 7 (1) (1982)
Teofilo F. Gonzalez, Joseph F. JáJá
Evaluation of Arithmetic Expressions with Algebraic Identities. SIAM J. Comput. 11 (4) (1982)
Teofilo F. Gonzalez, Donald B. Johnson
Sorting Numbers in Linear Expected Time and Optimal Extra Space. Inf. Process. Lett. 15 (3) (1982)
Teofilo F. Gonzalez
On Minimizing the Number of Page Faults with Complete Information. IMACS World Congress (1982)
Teofilo F. Gonzalez, Donald B. Johnson
A New Algorithm for Preemptive Scheduling of Trees. J. ACM 27 (2) (1980)
Teofilo F. Gonzalez, Joseph F. JáJá
On the Complexity of Computing Bilinear Forms with {0, 1} Constants. J. Comput. Syst. Sci. 20 (1) (1980)
Teofilo F. Gonzalez
A Note on Open Shop Preemptive Schedules. IEEE Trans. Computers 28 (10) (1979)
Teofilo F. Gonzalez, Sartaj Sahni
Preemptive Scheduling of Uniform Processor Systems. J. ACM 25 (1) (1978)
Teofilo F. Gonzalez, Sartaj Sahni
Flowshop and Jobshop Schedules: Complexity and Approximation. Oper. Res. 26 (1) (1978)
Teofilo F. Gonzalez, Sartaj Sahni, William R. Franta
An Efficient Algorithm for the Kolmogorov-Smirnov and Lilliefors Tests. ACM Trans. Math. Softw. 3 (1) (1977)
Teofilo F. Gonzalez, Oscar H. Ibarra, Sartaj Sahni
Bounds for LPT Schedules on Uniform Processors. SIAM J. Comput. 6 (1) (1977)
Teofilo F. Gonzalez, Sartaj Sahni
Open Shop Scheduling to Minimize Finish Time. J. ACM 23 (4) (1976)
Sartaj Sahni, Teofilo F. Gonzalez
P-Complete Approximation Problems. J. ACM 23 (3) (1976)
Sartaj Sahni, Teofilo F. Gonzalez
P-Complete Problems and Approximate Solutions SWAT (1974)