comp.theory

• Date Index

---

• A hashing problem, rpboland
  • Re: A hashing problem, Zig
• Can anyone explain this quote?, Craig Feinstein
  • Re: Can anyone explain this quote?, John F
    • Re: Can anyone explain this quote?, Craig Feinstein
      • Re: Can anyone explain this quote?, Claudio Grondi
      • Re: Can anyone explain this quote?, Ben Rudiak-Gould
      • Re: Can anyone explain this quote?, Rick Decker
      • Re: Can anyone explain this quote?, Claudio Grondi
      • Re: Can anyone explain this quote?, examachine
      • Re: Can anyone explain this quote?, Alan S
• a question on regular languages, venkata subramanian
  • Re: a question on regular languages, venkata subramanian
    • Re: a question on regular languages, Rick Decker
    • Re: a question on regular languages, Jaisingh Solanki
• Text fingerprinting, Sumedh
  • Re: Text fingerprinting, Thad Smith
  • Re: Text fingerprinting, Zig
• SPIN 2006 Last call for papers. DL: December 2, 2005, Valmari Antti
• Re: Complexity of graph problems, Nathan Gilbert
  • Re: Complexity of graph problems, Jaisingh Solanki
• "Importance" of a node in a graph, hbdere
  • Re: "Importance" of a node in a graph, Falk Hueffner
• Special matching problem, Michael Hussmann
  • Re: Special matching problem, Zig
    • Re: Special matching problem, Michael Hussmann
  • Re: Special matching problem, Woeginger Gerhard
    • Re: Special matching problem, Michael Hussmann
• Proof - the right track?, RonnyM
  • Re: Proof - the right track?, Pat Farrell
  • Re: Proof - the right track?, andy . twigg
• gre practice booklet (computer science), titanium . bits
• hash,index, dictionary, ed.thyme
  • Re: hash,index, dictionary, Arash Partow
• Bag intersections to create trees from bigger bags, Hiren Joshi
• rb-tree creation from sorted sequence, Arne Ehrlich
  • Re: rb-tree creation from sorted sequence, Googmeister
  • Re: rb-tree creation from sorted sequence, Ben Pfaff
• [ counting sort ideea... ], ed.thyme
  • Re: [ counting sort ideea... ], Marcin
    • Re: [ counting sort ideea... ], ed.thyme
• O-notation, Ronny Mandal
  • Re: O-notation, Pat Farrell
    • Re: O-notation, Ronny Mandal
    • Re: O-notation, Richard Harter
      • Re: O-notation, Pat Farrell
• category theory question, Godfrey Muganda
• "Reverse Doubling List", is there another name?, cdiggins
  • Re: "Reverse Doubling List", is there another name?, Torben Ægidius Mogensen
    • Re: "Reverse Doubling List", is there another name?, cdiggins
• Filling 2d array in less than O(n^2)?, pjhyett
  • Re: Filling 2d array in less than O(n^2)?, Casey Hawthorne
    • Re: Filling 2d array in less than O(n^2)?, pjhyett
      • Re: Filling 2d array in less than O(n^2)?, Amitabha Roy
  • Re: Filling 2d array in less than O(n^2)?, A . L .
    • Re: Filling 2d array in less than O(n^2)?, Jason Barrett Prado
      • Re: Filling 2d array in less than O(n^2)?, A . L .
      • Re: Filling 2d array in less than O(n^2)?, Nicholas King
  • Re: Filling 2d array in less than O(n^2)?, jeffrey_h_miller
    • Re: Filling 2d array in less than O(n^2)?, Dimitri Ognibene
• Problems with JFLAP, Paminu
  • Re: Problems with JFLAP, Torben Ægidius Mogensen
• Create DFA from regular expression?, Paminu
  • Re: Create DFA from regular expression?, Matt Timmermans
    • Re: Create DFA from regular expression?, Paminu
    • Re: Create DFA from regular expression?, Torben Ægidius Mogensen
• Re: "The Art of Computer Programming" by Knuth, Nathan Gilbert
  • Re: "The Art of Computer Programming" by Knuth, jitasi
• Help about Graphy Theory and Communication Networks plz.., xeyder
  • Re: Help about Graphy Theory and Communication Networks plz.., Jamie Andrews; real address @ bottom of message
  • Re: Help about Graphy Theory and Communication Networks plz.., Nathan Gilbert
    • Re: Help about Graphy Theory and Communication Networks plz.., Nicholas King
• Can someone give me an example of this type of problem?, Nathan Gilbert
  • Re: Can someone give me an example of this type of problem?, Johan Kwisthout
    • Re: Can someone give me an example of this type of problem?, Nathan Gilbert
    • Re: Can someone give me an example of this type of problem?, grouchy
      • Re: Can someone give me an example of this type of problem?, Jym
      • Re: Can someone give me an example of this type of problem?, Googmeister
  • Re: Can someone give me an example of this type of problem?, stephen
    • Re: Can someone give me an example of this type of problem?, Nathan Gilbert
      • Re: Can someone give me an example of this type of problem?, stephen
      • Re: Can someone give me an example of this type of problem?, Nathan Gilbert
  • Re: Can someone give me an example of this type of problem?, jeffrey_h_miller
    • Re: Can someone give me an example of this type of problem?, Googmeister
      • Re: Can someone give me an example of this type of problem?, jeffrey_h_miller
      • Re: Can someone give me an example of this type of problem?, Nathan Gilbert
      • Re: Can someone give me an example of this type of problem?, tchow
      • Re: Can someone give me an example of this type of problem?, jeffrey_h_miller
      • Re: Can someone give me an example of this type of problem?, stephen
      • Re: Can someone give me an example of this type of problem?, jeffrey_h_miller
      • Re: Can someone give me an example of this type of problem?, stephen
      • Re: Can someone give me an example of this type of problem?, jeffrey_h_miller
      • Re: Can someone give me an example of this type of problem?, grouchy
      • Re: Can someone give me an example of this type of problem?, tchow
      • Re: Can someone give me an example of this type of problem?, jeffrey_h_miller
      • Re: Can someone give me an example of this type of problem?, tchow
      • Re: Can someone give me an example of this type of problem?, jeffrey_h_miller
      • Re: Can someone give me an example of this type of problem?, tchow
      • Re: Can someone give me an example of this type of problem?, jeffrey_h_miller
  • Re: Can someone give me an example of this type of problem?, paragn
    • Re: Can someone give me an example of this type of problem?, Googmeister
      • Re: Can someone give me an example of this type of problem?, grouchy
• Shortest path algorithms, TheOriginalThemePark
  • Re: Shortest path algorithms, stephen
    • Re: Shortest path algorithms, TheOriginalThemePark
      • Re: Shortest path algorithms, stephen
      • Re: Shortest path algorithms, ThemePark
      • Re: Shortest path algorithms, wade
      • Re: Shortest path algorithms, Jaisingh Solanki
• CSR-2006: Deadline set to December 11, CSR-2006
• Can anyone please help me with this question, Aaron
  • Re: Can anyone please help me with this question, Barb Knox
    • Re: Can anyone please help me with this question, Aaron
      • Re: Can anyone please help me with this question, stephen
      • Re: Can anyone please help me with this question, Aaron
  • Re: Can anyone please help me with this question, Pat Farrell
    • Re: Can anyone please help me with this question, Aaron
  • Re: Can anyone please help me with this question, georgie
  • Re: Can anyone please help me with this question, Rick Decker
• Lee' algorithm for visibility polygon, Nangi
• Count all the substrings in a string, itportal
  • Re: Count all the substrings in a string, Bryan Olson
    • Re: Count all the substrings in a string, itportal
      • Re: Count all the substrings in a string, Bryan Olson
      • Re: Count all the substrings in a string, itportal
      • Re: Count all the substrings in a string, Bryan Olson
      • Re: Count all the substrings in a string, itportal
      • Re: Count all the substrings in a string, Bryan Olson
      • Re: Count all the substrings in a string, itportal
      • Re: Count all the substrings in a string, shailendra . malik
      • Re: Count all the substrings in a string, Paul E. Black
      • Re: Count all the substrings in a string, Nathan Gilbert
      • Re: Count all the substrings in a string, Shail
      • Re: Count all the substrings in a string, Aatu Koskensilta
  • Re: Count all the substrings in a string, Googmeister
• Help with quantum computing project, kenfitz3
  • Re: Help with quantum computing project, Paul E. Black
• A distributed algorithm to assign multiple colors to a single vertex, iwan2no
  • Re: A distributed algorithm to assign multiple colors to a single vertex, Jaisingh Solanki
    • Message not available
      • Re: A distributed algorithm to assign multiple colors to a single vertex, iwan2no
• Log-space Completeness Question, Sam
  • Re: Log-space Completeness Question, PeterPan
    • Re: Log-space Completeness Question, albinali
    • Re: Log-space Completeness Question, Sam
      • Re: Log-space Completeness Question, PeterPan
  • Re: Log-space Completeness Question, tchow
• subtree isomorphism problem, Joe . ntang
  • Re: subtree isomorphism problem, Matt Timmermans
    • Re: subtree isomorphism problem, Joe . ntang
      • Re: subtree isomorphism problem, Matt Timmermans
      • Re: subtree isomorphism problem, Joe . ntang
      • Re: subtree isomorphism problem, Joe . ntang
• Floor planning algorithms, Arash Partow
• Is P=NP? Thought process approach., Ramasamy C
  • Re: Is P=NP? Thought process approach., Sed
    • Re: Is P=NP? Thought process approach., Ramasamy C
      • Re: Is P=NP? Thought process approach., Jaisingh Solanki
      • Re: Is P=NP? Thought process approach., Ramasamy C
      • Re: Is P=NP? Thought process approach., Jaisingh Solanki
      • Re: Is P=NP? Thought process approach., Ramasamy C
      • Re: Is P=NP? Thought process approach., jeffrey_h_miller
      • Re: Is P=NP? Thought process approach., Jaisingh Solanki
    • Re: Is P=NP? Thought process approach., Ramasamy C
  • Re: Is P=NP? Thought process approach., Ben Rudiak-Gould
• X3SAT Question, Russell Easterly
  • Re: X3SAT Question, RickO
    • Re: X3SAT Question, Russell Easterly
• Implementing a graph algebra, Marius Amado Alves
• polygons question, makc . the . great
  • Re: polygons question, RobertSzefler
    • Re: polygons question, makc . the . great
      • Re: polygons question, RobertSzefler
      • Re: polygons question, makc . the . great
      • Re: polygons question, makc . the . great
      • Re: polygons question, makc . the . great
      • Re: polygons question, RobertSzefler
      • Re: polygons question, makc . the . great
      • Re: polygons question, RobertSzefler
• i-C&P "Computers + Philosophy" int'l conference -LAST CALL (1000+150 wds.), Colin . Schmidt
• Fuzzy CSP, nur
• computation in the limit, examachine
  • Re: computation in the limit, examachine
• Re: Algorithm to define unrestricted grammar, Niek Sombekke
  • <Possible follow-ups>
  • Re: Algorithm to define unrestricted grammar, examachine
• CSR-2006: Call For Papers, CSR-2006
• Complexity Question, nur
  • Re: Complexity Question, crasmarum
    • Re: Complexity Question, nur
      • Re: Complexity Question, crasmarum
• Re: Does random number really exist?, Poldie
  • Re: Does random number really exist?, Jean-Yves Moyen
    • Re: Does random number really exist?, scattered
      • Re: Does random number really exist?, Torben Ægidius Mogensen
    • Re: Does random number really exist?, examachine
  • Re: Does random number really exist?, examachine
  • <Possible follow-ups>
  • Re: Does random number really exist?, examachine
    • Re: Does random number really exist?, Torben Ægidius Mogensen
  • Re: Does random number really exist?, examachine
• Context Free Language, simsim
  • Re: Context Free Language, Gene
  • Re: Context Free Language, Jaisingh Solanki
• interactive "smarts", examachine
  • Re: interactive "smarts", makc . the . great
• Performance issues between different binary trees, Curious
  • Re: Performance issues between different binary trees, Googmeister
    • Re: Performance issues between different binary trees, Ben Pfaff
      • Re: Performance issues between different binary trees, stephen
      • Re: Performance issues between different binary trees, Ben Pfaff
      • Re: Performance issues between different binary trees, stephen
      • Re: Performance issues between different binary trees, Ben Pfaff
      • Re: Performance issues between different binary trees, Googmeister
      • Re: Performance issues between different binary trees, Ben Pfaff
  • Re: Performance issues between different binary trees, Bryan Olson
• collapsing a tree into a list, tunesmith
  • Re: collapsing a tree into a list, Espen Suenson
  • Re: collapsing a tree into a list, Rick Decker
    • Re: collapsing a tree into a list, tunesmith
  • Re: collapsing a tree into a list, tunesmith
• Postdoc Position Univ. of Oxford - Dept. of Statistics, rocco@xxxxxxxxxxxxxx
• Re: minimum disjoint paths covering of a graph - algorithm needed, Marcin
  • Re: minimum disjoint paths covering of a graph - algorithm needed, John Gabbriel
    • Re: minimum disjoint paths covering of a graph - algorithm needed, Marcin
      • Re: minimum disjoint paths covering of a graph - algorithm needed, John Gabbriel
      • Re: minimum disjoint paths covering of a graph - algorithm needed, Marcin
      • Re: minimum disjoint paths covering of a graph - algorithm needed, Nicholas King
  • <Possible follow-ups>
  • Re: minimum disjoint paths covering of a graph - algorithm needed, A . L .

• Security
• UNIX
• Linux
• Coding
• Usenet

• Archive
• About
• Privacy
• Search
• Imprint

coding.derkeiler.com  > Archive  > General  > comp.theory  > 2005-11