How to get the archive password

So, as I’ve stated in the introductory post, my goal is to provide these discussions as a resource for CS Educators (or researchers, I suppose.  But it’s really done from an educational point of view).  What I’m not interested in doing is providing solutions to people’s homeworks.  There’s enough of that out on the internet already.

On the other hand, as someone who is- shall we say- not unfamiliar with procrastination, I know that it’s pretty likely that people will be designing assignments on a short timeframe, and thus asking me for a password to look at each post when you need to see it right now isn’t very helpful.  I’m also aware that password-protecting each post will make it less likely people will bother to look here.  I’m not doing this for fame and fortune, but it would be nice to not scare off everyone from reading here.

My solution is to just password-protect entries that are not on the first page.  I’ll also only put passwords on problems that are not already solved in the G&J book.  That way, everyone gets to see the 20 or so entries on the front page, to see what this is about, to use for assignments or whatever.  But then as time goes on, the older posts will be replaced by newer ones, and as they go back into the archives, you’ll need a password to see them.  Hopefully that has some of the best of both worlds.

My plan is to give out passwords freely to anyone who has a legitimate use (my picture is CS faculty at other schools, but if other types of people are interested, that’s fine).  If you’d like the password, please send me email, remove the extra “@” sign, and include in the email some way of showing you’re a teacher and not a student (a link to your faculty page at your school, for example).  I’ll do my best to get back to you as soon as I can.

47 thoughts on “How to get the archive password

  1. Juan Sánchez

    I’m a student at Universidad del Norte, Colombia. The information from this site will help me a lot, can i have the password please. thank you.

    Reply
      1. Juan Sánchez

        Oh i see, i was writing a paper about this NP-complete. Just wanted to have more information from a trustworthy source.
        Thank you for your time.

        Reply
        1. Frank Ciceri

          Hey juan and seal, im also from that university and now the engineer capacho told me to find some information about it, andd this information will be a lot of help. Can i have the password please?

          Thank for your time

          Reply
  2. Lucas Miguel

    Hi, I’m a master student of Computer Science. The password to this site will be of great help. I want to use as reference to working with possible problems.

    Reply
  3. giovanni andreatta

    Hi.
    I am a professor of Operations Research at the university of Padova in Italy.
    I am currently working on the problem of Partitioning a tree into Stars. Thus I am interested to look at all possible references having to do with partitioning a tree.
    Thus a password will be very welcome.
    Regards,
    Giovanni

    Reply
  4. Ajish Kumar K.S.

    I am a faculty member in the Computer Science Department, College of Engineering Trivandrum. I believe that this resource will be of great useful in my teaching life. Kindly share the password to improve my knowledge.
    Thank You
    Ajish Kumar K.S.

    Reply
  5. Renee McCauley

    I am faculty in the computer science department at the College of Charleston. I would appreciate access to this site as some of the examples would be useful in my teaching. Thank you very much for producing/maintaining this resource.

    Reply
  6. Hamed Karimi

    hello , I am a researcher in CS at University of Tehran , Tehran. Please give me the password to this website because it will be a great help to me and my knowledge , thank you very much
    Best Regards
    H.Karimi

    Reply
      1. Hamed Karimi

        no , i don’t have . i’m an amateur in CS and also beginner in this way , i will be so happy if you give me the permission for using this website , best wishes , H.Karimi

        Reply
    1. Sean McCulloch

      I don’t really want to give it to people who are using it just to do homeworks and stuff. If you’re a grad student and need it for research or something similar, let me know and we can try to figure something out

      Reply
  7. Chris Lau

    Hi, I am student of University of Florida. I am working on a paper of solving Karp’s classic NP problems and your password would be great help.

    Reply
    1. Sean T. McCulloch Post author

      I don’t really want to give out the password to students because I don’t want it to be a resource for homework solutions.

      One possibility would be for you to get a professor to contact me and tell me that it’s for research..

      Reply
  8. J

    Hi, I’m a PhD student at UCL (England), I’d use this resource as part of my research and to improve my understanding (no homework!), I’d really appreciate the password to access more articles. Thanks!

    Reply
  9. Frieda

    Hi,
    I am a Graduate student in Memorial University. I will like to explore interesting topics here for my project. I would appreciate it if you give me access.

    Reply
    1. Sean T. McCulloch Post author

      Do you mean a project for a class? I don’t really want to give out the password for those kinds of things. One possibility would be to have your professor or advisor contact me and let me know it’s ok.

      Reply
  10. Frieda

    Yes I am class project. I am suppose to present a project topic with its problem, input, and output today. I found sometime on solving parity games. I think I will work with that.

    Thanks for replying.

    Reply
  11. Y. Cyrus Liu

    Hi,
    I’m an early year CS PhD student at Stevens Institute, I’m currently building up my fundamental backgrounds for my research topics (definitely not for my homework though), could I have the password for more articles on this site please?
    Thank you! (I attached my personal website here)

    Best Regards
    Y. Cyrus Liu

    Reply
      1. Mohammadreza

        I’m not a CS educator but I’ve read Gary and Johnson book and I’m interested to know more about other Karp’s problems. If you don’t send a password for me is there any suggestion book or paper which helps me?

        Reply
  12. Sandy

    Hello.
    I work at my thesis atm. The topic is running-time-analysis of selected NP-complete problems. Exact and approximate solution vs transformation in SAT instances and solving the problems via SAT-Solvers.
    I read the book Garey/Johnson-Computers and Intractability.
    I’m interested esp. in GP15 and wish to read more about it.
    I dont need access to cheat or something. Just for the understanding. I can do the rest on my own. It would be helpful to get access for the page where GP15 is discussed. I’d like to analyse the problem, because it seems interesting and so far I dont hear about it.

    Thank you!

    Reply

Leave a Reply

Your email address will not be published. Required fields are marked *