Service Rating:	9.90 out of 10 9.9   63 reviews
Skill  Rating:	10.00   2 skills
Earnings Reported:	$1,515.00
Location:	Chelyabinsk, Russian Federation
Experience:	3 - 5 years
Employees:	1 - 5
Min. Rate:	$10 / hour

Service Description:
SursuDevelop

SursuDevelop consists of 3 young and dynamic students.

E d u c a t i o n

Computer Science and Supplied Math Faculty, South Ural State University, Chelyabinsk, 2003 - 2008

Q u a l i f i c a t i o n s

3 years experience on creating software.

Software skills: C++, C, JAVA, Delphi, Matlab, Visual Basic, MySQL, PHP

Math skills: Computer simulation of mathematical theories.

Problem solving: including tricky, time-critical decisions.

1. Optimizations Algorithms. Among them Linear Programming/Simplex Method, Genetic Algorithms, etc.

2. Encryption Algorithms. Among them Blowfish, Huffman, etc.

3. Data Structures. Dictionaries, Priority Queues, Suffix Trees and Arrays, Graph Data Structures, Set Data Structures, Kd-Trees

4. Numerical Problems - Solving Linear Equations, Bandwidth Reduction, Matrix Multiplication, Determinants and Permanents, Linear Programming/Simplex Method, Random Number Generation, Factoring and Primality Testing, Arbitrary Precision Arithmetic, Knapsack Problem, Discrete Fourier Transform

5. Combinatorial Problems - Sorting, Searching, Median and Selection, Permutations, Subsets, Partitions, Graphs, Calendrical Calculations, Job Scheduling, Satisfiability

6. Graph Problems - Polynomial Time Problems (Connected Components, Topological Sorting, Minimum Spanning Tree, Shortest Path, Transitive Closure and Reduction, Matching, Eulerian Cycle / Chinese Postman, Edge and Vertex Connectivity, Network Flow, Drawing Graphs Nicely, Drawing Trees, Planarity Detection and Embedding)

7. Graph Problems - Hard Problems (Clique, Independent Set, Vertex Cover, Traveling Salesman Problem, Hamiltonian Cycle, Graph Partition, Vertex Coloring, Edge Coloring, Graph Isomorphism, Steiner Tree, Feedback Edge/Vertex Set

8. Computational Geometry - Robust Geometric Primitives, Convex Hull, Triangulation, Voronoi Diagrams, Nearest Neighbor Search, Range Search, Point Location, Intersection Detection, Bin Packing, Medial-Axis Transformation, Polygon Partitioning, Simplifying Polygons, Shape Similarity, Motion Planning, Maintaining Line Arrangements, Minkowski Sum

9. Set and String Problems - Set Cover, Set Packing, String Matching, Approximate String Matching, Text Compression, Cryptography, Finite State Machine Minimization, Longest Common Substring, Shortest Common Superstring

10. Hash Algorithms.

11. Search Algorithms.

12. Artificial intelligence

S p e c i a l A r e a O f E x p e r t i s e

Solving students's assignments. In recent months have been done about 100 such assignments on C++, C, JAVA, VB, Matlab. Among them different kind of level, from beginning, up to cource works and degree projects. Our code is always simple, commented, with no errors.

A v a i l a b i l i t y & L a n g u a g e s K n o w n

We are available in instant messenger applications MSN, ICQ. We have communications skils in English, Russian, Romanian.

Industry Experience:
Education, Information Technology, Software, Hardware, Electronics.