Michael Ostapenko Email & Phone Number

Mountain View, Ca, Us

Mountain View, Ca, Us

Provided technical leadership to several cross-functional teams working on all major business communication products, including Business Messages, RCS Business Messaging, Business Voice, and Verified SMS.Spearheaded the development of Verified SMS.Expanded products across multiple dimensions, including Billing, Analytics, Abuse Protection, Policy Enforcement.Routinely handled outages and security breaches, improved functionality, reliability, and efficiency of systems, defined best engineering practices, mentored engineers, advised on product strategy and engineering roadmaps.Engaged in multiple educational courses, such as ‘Pathways in Math’, covering various topics from mathematics, computer science, quantum physics, and software engineering.

Received countless bonuses and awards from Google for outstanding delivery and engineering excellence.1st place in TopCoder NYC, semifinalist in OpenBracket Delaware, 13th in the world's satisfiability competition, and 99th percentile in algorithmic contests on HackerRank.Classic IQ Test (140), Brainbench C# (5/5), Brainbench C++ (4.9/5), GRE Computer Science (800/900), GRE Quantitative (800/800), CPE (B).

Glen Allen, Va, Us

Directed the development of the core in-house frameworks and tools for automated processing of sensitive documents.Designed and implemented several microservices integrating multiple applications.Developed multiple low-latency, high-throughput clients enabling efficient communication between applications and data stores.

Us

Studied and analyzed numerous concepts, problems, representations, inference rules and systems, algorithms, data structures, and heuristics related to boolean satisfiability.Carried out research on or into computational and proof complexity, NP-completeness, boolean satisfiability, graph automorphism, and edge maximum biclique problems, propositional, quantified, and pseudo-boolean formulas, binary decision diagrams, conjunctive and negation normal forms, tree, regular, general, and extended resolution, auto-, iso-, and homo- morphisms, depth-first, breadth-first, and local search, clause learning and lookahead solvers, watched literals data structure, activity-based decision heuristic, and so on.Developed several satisfiability solvers.Designed and implemented a sparse and cache-friendly data structure for manipulating permutation groups.Implemented efficient procedures for enumerating maximum edge bicliques and detecting graph auto-, iso-, and homo- morphisms.Developed several novel heuristics for symmetry detection.Implemented a highly optimized procedure for the transporter problem.Incorporated dynamic symmetry detection into several satisfiability solvers.

Designed and implemented an automated system to anonymously gather, store, and analyze publicly available information and deduce its hidden properties.Designed and implemented an artificial neural network with resilient backpropagation learning algorithm and several financial indexes, such as moving average, Hurst exponent, and so on.Designed and implemented a secure message exchange mechanism between a website's frontend and backend.Developed a system to automatically extract information from semi-structured web pages.Developed a graph visualizer capable of handling millions of data points in real time.Developed a calendar with configurable email and SMS notifications.Designed a console for remote administration of multiple UPSs.Designed and implemented a distributed multi-user chat.Developed a task manager providing extended system information.Designed and implemented a framework for rapid application development in Assembly.Implemented several graphics processing algorithms in Assembly.

Doctor Of Philosophy (Phd) Candidate, Theoretical Foundations Of Informatics

Master'S Degree, Informatics

Engineer'S Degree, Computer Systems And Networks