University of California at Santa Barbara

picture Welcome to my Web Page!

My name is Arturo Gonzalez-Gutierrez (aglez AT cs.ucsb.edu) and I am a candidate Ph. D. student of the Department of Computer Science at the University of California at Santa Barbara.

I am working under the direction of Professor Teofilo F. Gonzalez in NP-complete problems and Approximation Algorithms.

Teaching
========

  • Discrete Mathematics
    Fundamentos de Logica (pdf)
    Logica de Predicados (pdf)
    Principios Fundamentales de Conteo (pdf)
    Teoria de Conjuntos: (Parte 1, pdf) (Parte 2, pdf)
    Relaciones y Funciones: (Parte 1, pdf) (Parte 2, pdf)
  • Programming and Data Structures
    Suma de Enteros Contiguos en una Subsecuencia (pdf)


    Ph.D. Thesis Proposal Presentation:

  • Fall 2005: File in format *.ppt

    Ph.D. Thesis:

  • Summer 2007:

    Metaheuristics:

  • Presentation: File in format *.ppt


    Teaching Activities as TA:

  • Fall 2005: Data Structures and Algorithms (CS130A)
  • Winter 2006: Numerical Simulation (CS211B)
  • Spring 2006: Design and Analysis of Algorithms (CS230)
  • Fall 2006: Design and Analysis of Algorithms (CS230)
  • Winter 2007: Data Structures and Algorithms (CS130A)
  • Spring 2007: Data Structures and Algorithms (CS130B)

    Classes taken so far:

  • Automata and Formal Languages (136)
  • Theory of Computation (186)
  • Data Structures and Algorithms (130B)
  • Logic Design Principles (152A)
  • Computer Architecture (154)
  • Programming Languages (162)
  • Operating Systems (170)
  • Design and Analysis of Algorithms (230A)
  • Computational Geometry (235)
  • Theory of Computing and Computational Complexity (220)
  • Design and Analysis of Algorithms (230B)
  • Numerical Simulation (211B)
  • Quantum Information and Quantum Computation (290A)
  • Preconditioning Iterative Methods in Computational Science and Engineering (290H):
    You can find the final project presentation here in format (ppt) or (pdf).
  • Applied Parallel Computing (CS240A):
    You can find the web page of the final project here

    Talks:

  • The Natural and Behavioral Sciences (NBS) seminar. Minimum-Length Corridor Problem: Algorithms and Complexity. Host Department: Mathematics and Computer Science, Westmont College. March 2, 2007.
  • "Theoretically Speaking" CS595A seminar. Approximating the Minimum Length Corridor Problem and Related Problems. Computer Science Department, UCSB. May 17, 2007.
  • UC MEXUS-CONACYT First Biennial Doctoral Fellows Symposium. Approximation Algorithms and Complexity: Minimum-Length Corridor Problem. June 8, 2007.

    Research:

  • Approximation Algorithms for the Minimum-Length Corridor and Related Problems. Arturo Gonzalez-Gutierrez and Teofilo F. Gonzalez. TR UCSB 2007-03
  • Complexity of the Minimum-Length Corridor Problem. Arturo Gonzalez-Gutierrez and Teofilo F. Gonzalez. Journal of Computational Geometry: Theory and Applications. Volume 37, Issue 2 , July 2007, Pages 72-103
  • Algorithms on Trees. Rangel, Jaime and Gonzalez, Arturo. Posted by Wolfram Research Inc.

    Interesting links:

  • Theory of Computation Laboratory (Room 2106, Engineering I, Second Floor)
  • Computer Science Graduate Student List
  • The University of California Institute for Mexico and the United States (UC MEXUS)
  • University of Queretaro, MEXICO
  • Westmont College
  • Christ Presbyterian Church at Santa Barbara
  • Instituto Libre De Mexico de Estudios Superiores
  • Iglesia Presbiteriana Betania en Queretaro, Qro MEXICO
  • The Herman Dooyeweerd Pages
  • A Guide to Dooyeweerd's New Critique of Theoretical Thought
  • Academic Genealogy

  • Car Honda 1991