dblp.uni-trier.dewww.uni-trier.de

Teofilo F. Gonzalez Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
64EETeofilo F. Gonzalez: Improved Communication Schedules with Buffers. Parallel Processing Letters 19(1): 129-139 (2009)
2008
63EEAmit M. Bhosle, Teofilo F. Gonzalez: Efficient Algorithms and Routing Protocols for Handling Transient Single Node Failures CoRR abs/0810.3438: (2008)
62EEAmit M. Bhosle, Teofilo F. Gonzalez: Distributed Algorithms for Computing Alternate Paths Avoiding Failed Nodes and Links CoRR abs/0811.1301: (2008)
61EETeofilo F. Gonzalez: Continuous Delivery Message Dissemination Problems under the Multicasting Communication Mode. IEEE Trans. Parallel Distrib. Syst. 19(8): 1034-1043 (2008)
2007
60 Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez: Approximation Algorithms for the Minimum-Length Corridor and Related Problems. CCCG 2007: 253-256
59EETeofilo F. Gonzalez: Message Dissemination under the Multicasting Communication Mode. PDCAT 2007: 3-4
58EEArturo Gonzalez-Gutierrez, Teofilo F. Gonzalez: Complexity of the minimum-length corridor problem. Comput. Geom. 37(2): 72-103 (2007)
2006
57EETeofilo 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)
56EETeofilo F. Gonzalez, David Serena: Pairwise edge disjoint shortest paths in the n-cube. Theor. Comput. Sci. 369(1-3): 427-435 (2006)
2005
55EEEdu Metz, Raimondas Lencevicius, Teofilo F. Gonzalez: Performance data collection using a hybrid approach. ESEC/SIGSOFT FSE 2005: 126-135
54 Teofilo F. Gonzalez: Improving the Computation and Communication Time with Buffers. IASTED PDCS 2005: 336-341
53EEAmit 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)
52EERussell 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)
2004
51EEAmit M. Bhosle, Teofilo F. Gonzalez: Algorithms for Single Link Failure Recovery and Related Problems. J. Graph Algorithms Appl. 8(2): 275-294 (2004)
50EETeofilo F. Gonzalez, David Serena: n-Cube network: node disjoint shortest paths for maximal distance pairs of vertices. Parallel Computing 30(8): 973-998 (2004)
49EETeofilo F. Gonzalez: Efficient Resource Utilization in Parallel and Distributed Systems. The Journal of Supercomputing 28(1): 5-6 (2004)
48EETeofilo F. Gonzalez, David Serena: Complexity of pairwise shortest path routing in the grid. Theor. Comput. Sci. 326(1-3): 155-185 (2004)
2003
47EETeofilo F. Gonzalez: An Efficient Algorithm for Gossiping in the Multicasting Communication Environment. IEEE Trans. Parallel Distrib. Syst. 14(7): 701-708 (2003)
2002
46 Selim G. Akl, Teofilo F. Gonzalez: International Conference on Parallel and Distributed Computing Systems, PDCS 2002, November 4-6, 2002, Cambridge, USA IASTED/ACTA Press 2002
45 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
2001
44 Teofilo F. Gonzalez: Gossiping in the Multicasting Communication Environment. IPDPS 2001: 55
43EETeofilo F. Gonzalez: Simple Algorithms for Multimessage Multicasting with Forwarding. Algorithmica 29(4): 511-533 (2001)
42 Teofilo F. Gonzalez: On Solving Multimessage Multicasting Problems. Int. J. Found. Comput. Sci. 12(6): 791-808 (2001)
2000
41EETeofilo F. Gonzalez: Simple Algorithms for the On-Line Multidimensional Dictionary and Related Problems. Algorithmica 28(2): 255-267 (2000)
40 Teofilo F. Gonzalez: Distributed Algorithm for Multimessage Multicasting. Journal of Interconnection Networks 1(4): 303-314 (2000)
1998
39EETeofilo F. Gonzalez: Improved Approximation Algorithms for Embedding Hyperedges in a Cycle. Inf. Process. Lett. 67(5): 267-271 (1998)
38 Teofilo F. Gonzalez: Complexity and Approximations for Multimessage Multicasting. J. Parallel Distrib. Comput. 55(2): 215-235 (1998)
37 Teofilo F. Gonzalez: Bounded Fan-Out Multimessage Multicasting. Nord. J. Comput. 5(3): 196-213 (1998)
36 Ajoy Kumar Datta, Teofilo F. Gonzalez, Visalakshi Thiagarajan: Self-Stabilizing Algorithms for Tree Metrics. Parallel Processing Letters 8(1): 121-133 (1998)
1997
35EETeofilo F. Gonzalez: MultiMessage Multicasting: Complexity and Approximations. HICSS (1) 1997: 211-220
1996
34 Teofilo F. Gonzalez: Multi-Message Multicasting. IRREGULAR 1996: 217-228
33 Ömer Egecioglu, Teofilo F. Gonzalez: A Computationally Intractable Problem on Simplicial Complexes. Comput. Geom. 6: 85-98 (1996)
1995
32EETeofilo F. Gonzalez: A Simple LP-Free Approximation Algorithm for the Minimum Weight Vertex Cover Problem. Inf. Process. Lett. 54(3): 129-131 (1995)
31 Hans L. Bodlaender, Teofilo F. Gonzalez, Ton Kloks: Complexity Aspects of Two-Dimensional Data Compression. Nord. J. Comput. 2(4): 462-495 (1995)
1994
30 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)
1993
29 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)
1992
28EETeofilo F. Gonzalez, Toshio Murayama: Alhorithms for a Class of Min-Cut and Max-Cut Problem. ISAAC 1992: 97-105
27EETeofilo F. Gonzalez: The On-Line d-Dimensional Dictionary Problem. SODA 1992: 376-385
1991
26 Hans L. Bodlaender, Teofilo F. Gonzalez, Ton Kloks: Complexity Aspects of Map Compression. Data Compression Conference 1991: 287-296
25 Teofilo F. Gonzalez: Covering a Set of Points in Multidimensional Space. Inf. Process. Lett. 40(4): 181-188 (1991)
1990
24 Teofilo F. Gonzalez, Si-Qing Zheng: Approximation Algorithms for Partitioning a Rectangle with Interior Points. Algorithmica 5(1): 11-42 (1990)
23EETeofilo F. Gonzalez, Eugene L. Lawler, Sartaj Sahni: Optimal Preemptive Scheduling of Two Unrelated Processors. INFORMS Journal on Computing 2(3): 219-224 (1990)
1989
22EETeofilo 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)
21 Teofilo F. Gonzalez, Si-Qing Zheng: Inproved Bounds for Rectangular and Guillotine Partitions. J. Symb. Comput. 7(6): 591-610 (1989)
1988
20 Teofilo F. Gonzalez, Si-Qing Zheng: Simple Three-Layer Channel Routing Algorithms. AWOC 1988: 237-246
19EETeofilo 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)
18EETeofilo F. Gonzalez, Sing-Ling Lee: A linear time algorithm for optimal routing around a rectangle. J. ACM 35(4): 810-831 (1988)
1987
17 Teofilo F. Gonzalez, Sing-Ling Lee: A 1.6 Approximation Algorithm for Routing Multiterminal Nets. SIAM J. Comput. 16(4): 669-704 (1987)
1986
16 Teofilo F. Gonzalez, Sing-Ling Lee: Routing Multiterminal Nets Around a Rectangle. IEEE Trans. Computers 35(6): 543-549 (1986)
1985
15 Teofilo F. Gonzalez: Clustering to Minimize the Maximum Intercluster Distance. Theor. Comput. Sci. 38: 293-306 (1985)
1984
14EETeofilo 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)
13 Simeon C. Ntafos, Teofilo F. Gonzalez: On the Computational Complexity of Path Cover Problems. J. Comput. Syst. Sci. 29(2): 225-242 (1984)
1982
12 Teofilo F. Gonzalez: On Minimizing the Number of Page Faults with Complete Information. IMACS World Congress 1982: 77-81
11 Teofilo F. Gonzalez, Donald B. Johnson: Sorting Numbers in Linear Expected Time and Optimal Extra Space. Inf. Process. Lett. 15(3): 119-124 (1982)
10 Teofilo F. Gonzalez, Joseph JáJá: Evaluation of Arithmetic Expressions with Algebraic Identities. SIAM J. Comput. 11(4): 633-662 (1982)
1980
9EETeofilo F. Gonzalez, Donald B. Johnson: A New Algorithm for Preemptive Scheduling of Trees. J. ACM 27(2): 287-312 (1980)
8 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)
1979
7 Teofilo F. Gonzalez: A Note on Open Shop Preemptive Schedules. IEEE Trans. Computers 28(10): 782-786 (1979)
1978
6EETeofilo F. Gonzalez, Sartaj Sahni: Preemptive Scheduling of Uniform Processor Systems. J. ACM 25(1): 92-101 (1978)
1977
5EETeofilo 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)
4 Teofilo F. Gonzalez, Oscar H. Ibarra, Sartaj Sahni: Bounds for LPT Schedules on Uniform Processors. SIAM J. Comput. 6(1): 155-166 (1977)
1976
3EESartaj Sahni, Teofilo F. Gonzalez: P-Complete Approximation Problems. J. ACM 23(3): 555-565 (1976)
2EETeofilo F. Gonzalez, Sartaj Sahni: Open Shop Scheduling to Minimize Finish Time. J. ACM 23(4): 665-679 (1976)
1974
1 Sartaj Sahni, Teofilo F. Gonzalez: P-Complete Problems and Approximate Solutions FOCS 1974: 28-32

Coauthor Index

1Selim G. Akl [46]
2Amit M. Bhosle [51] [53] [62] [63]
3Hans L. Bodlaender [26] [31]
4Russell Brandt [52]
5Ajoy Kumar Datta [36]
6Ömer Egecioglu [33]
7William R. Franta [5]
8Arturo Gonzalez-Gutierrez [58] [60]
9Oscar H. Ibarra [4]
10Joseph JáJá [8] [10]
11Donald B. Johnson [9] [11]
12Ton Kloks (Antonius J. J. Kloks) [26] [31]
13Shashishekhar Kurki-Gowdara [19] [22]
14Eugene L. Lawler [23]
15Sing-Ling Lee [16] [17] [18]
16Raimondas Lencevicius [55]
17Joseph Y.-T. Leung [57]
18Edu Metz [55]
19Toshio Murayama [28]
20Simeon C. Ntafos [13]
21Michael Pinedo [57]
22Mohammadreza Razzazi [30]
23Sartaj Sahni (Sartaj K. Sahni) [1] [2] [3] [4] [5] [6] [23]
24David Serena [45] [48] [50] [56]
25Man-tak Shing [30]
26Visalakshi Thiagarajan [36]
27Si-Qing Zheng (S. Q. Zheng) [20] [21] [24] [29] [30]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)