Algorithms and Data Structures



  • Pure functional, mutation-free, efficient double-linked lists
  • Eratosthenes and other number sieves
  • How to take a tail of a functional stream
  • Dynamic epistemic logic puzzles
  • Total stream processors and their applications to all infinite streams
     
  • Generic Zipper and its applications
  • LogicT - backtracking monad transformer with fair operations and pruning
    The LogicT code includes solutions to the Missionaries and Cannibals problem, and playing Tic-Tac-Toe with minimax search and two heuristics
  • Treaps: An ordered dictionary data structure, based on randomized search trees
  • Proving complexity of one particular implementation of priority queues
  • Incremental, Linear Pretty-printing
     
  • Secure Counting of members of a subset without revealing their identities
  • Normal-order evaluation of lambda-terms as a bottom-up parsing
  • Provably perfect random shuffling and its pure functional implementations
  • Iterated zipping puzzles
  • Annotating trees post factum
     
  • Selecting a random node from a tree in one pass: from proof to code
  • Optimal justification of text with Dynamic Programming
  • Fast computation of Bernoulli numbers
  • Deriving fast functions to compute all subsets of size N
  • How to zip folds: A library of fold transformers (streams)
     
  • Representing knowledge about knowledge: ``Mr.S and Mr.P'' puzzle
  • Left fold vs. right fold: theory vs. practice
  • A neuron that learns how to play blackjack
  • Generating efficient median filters by an applicative-order term rewriting system
  • Accumulating tree traversals, a better tree fold with applications to XML parsing
     
  • Recursively enumerating binary arithmetic relations -- from addition to logarithm -- as conjunctions and disjunctions
  • Intersection testing of two segments of a circle or two georectangles, with a correctness proof
  • Arithmetic compression
  • Towards the best collection traversal interface: from enumerator to cursor
  • On parent pointers in trees
     
  • Printing the outline of a pruned tree
  • Efficient integer logarithm of large numbers in any base
  • Powers of three
  • Cross-product of sequences
  • Pure-functional transformations of cyclic graphs: viral flattening, the Credit Card Transform
  • Chess Tournament Scheduling
  • Generating interesting lambda-terms

  • Read full article from Algorithms and Data Structures


    No comments:

    Post a Comment

    Labels

    Algorithm (219) Lucene (130) LeetCode (97) Database (36) Data Structure (33) text mining (28) Solr (27) java (27) Mathematical Algorithm (26) Difficult Algorithm (25) Logic Thinking (23) Puzzles (23) Bit Algorithms (22) Math (21) List (20) Dynamic Programming (19) Linux (19) Tree (18) Machine Learning (15) EPI (11) Queue (11) Smart Algorithm (11) Operating System (9) Java Basic (8) Recursive Algorithm (8) Stack (8) Eclipse (7) Scala (7) Tika (7) J2EE (6) Monitoring (6) Trie (6) Concurrency (5) Geometry Algorithm (5) Greedy Algorithm (5) Mahout (5) MySQL (5) xpost (5) C (4) Interview (4) Vi (4) regular expression (4) to-do (4) C++ (3) Chrome (3) Divide and Conquer (3) Graph Algorithm (3) Permutation (3) Powershell (3) Random (3) Segment Tree (3) UIMA (3) Union-Find (3) Video (3) Virtualization (3) Windows (3) XML (3) Advanced Data Structure (2) Android (2) Bash (2) Classic Algorithm (2) Debugging (2) Design Pattern (2) Google (2) Hadoop (2) Java Collections (2) Markov Chains (2) Probabilities (2) Shell (2) Site (2) Web Development (2) Workplace (2) angularjs (2) .Net (1) Amazon Interview (1) Android Studio (1) Array (1) Boilerpipe (1) Book Notes (1) ChromeOS (1) Chromebook (1) Codility (1) Desgin (1) Design (1) Divide and Conqure (1) GAE (1) Google Interview (1) Great Stuff (1) Hash (1) High Tech Companies (1) Improving (1) LifeTips (1) Maven (1) Network (1) Performance (1) Programming (1) Resources (1) Sampling (1) Sed (1) Smart Thinking (1) Sort (1) Spark (1) Stanford NLP (1) System Design (1) Trove (1) VIP (1) tools (1)

    Popular Posts