Please enter a search string of at least 2 characters.
Not on Yasni yet?
Post Exposé now
Didn't receive your confirmation e-mail?
Forgot your password?
Please activate cookies in your browser to log in.
Books & Literature
Algorithmic Issues in Reverse Engineering of Protein and Gene...
Algorithmic Issues in Reverse Engineering of Protein and Gene Networks via the Modular Response Analysis Method.
SCHOLAR - CNKI学术搜索
On-line Load Balancing for Related Machines -
On-line Load Balancing for Related Machines On-line Load Balancing for. Related Machines.
. Moses Charikar. y. Marek Karpinski. z. TR-97-007.
Algorithms and Data Structures: 12th International Symposium, WADS...
constitutes the refereed proceedings of the 12th Algorithms and Data Structures Symposium, WADS 2011, held in New York, NY, USA, in August 2011. The...
Reliable distributed diagnosis for multiprocessor systems with random...
Reliable distributed diagnosis for multiprocessor systems with random faults.
1 and; ... Reliable distributed diagnosis for multiprocessor systems with ...
Marek Karpinski: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]. Publications of Author.
Marek Karpinski ...
Distributed Algorithms: 5th International Workshop, WDAG 91, Delphi,...
and Juan A. Garay. Asymptotically optimal consensus. In Proceedings of the Sixteenth International Conference on Automata, Languages, and ...
Dumitru Brinza PhD
Webapges of Zelikovsky’s Frequent Co-authors .
. Gruia Calinescu. Marek Karpinski. Andrew Kahng. Gabriel Robins. Ion Mandoiu
Distributed Algorithms - Nancy A. Lynch - Google Books
In Distributed Algorithms, Nancy Lynch provides a blueprint for designing, implementing, and analyzing distributed algorithms. She directs her
at a wide...
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete...
... ratio. sity, Pittsburgh, PA, Email: avrim9cs.cmu.edu t Strategic Planning and Optimization 192 Session Optimizing Misdirection
Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete...
Contains 130 papers, which were selected based on originality, technical contribution, and relevance. Although the papers were not formally refereed, every...
Bioinformatics Research and Applications: 6th International...
... on tracing the early cell divisions of mouse embryos by single cell RNA-seq,
from Pennsylvania State University spoke on successes and failures ...
Combinatorial Optimization and Applications: 4th International...
Farid Alizadeh Rutgers University, USA Mikhail (Mike) J. Atallah Purdue University, USA Giorgio Ausiello Universit`a di Roma, Italy
Penn State ...
Complexity Theory Retrospective: In Honor of Juris Hartmanis on the...
In 1965 Juris Hartmanis and Richard E. Stearns published a paper
Algorithms and Data Structures: 12th International ...
Oswin Aichholzer David Bader
Prosenjit Bose Timothy Chan Otfried Cheong Frank Dehne Marina Gavrilova Roberto Grossi John Iacono Giuseppe ...
Approximation, Randomization and Combinatorial ...
An Online Algorithm for the Postman Problem with a Small Penalty
and Junichiro Fukuyama Department of Computer Science and Engineering ...
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete...
—*'De—partment of Mathematics and Computer Science and Artificial Intelligence Laboratory, 641 8/7-Approximation Algorithm for (l ,2)-TSP
Complexity Theory Retrospective: In Honor of Juris ...
The first significant progress on this no-sparse-complete-set conjecture was by
, ([Be–78]), who proved that if there is a polynomial time function, ...
Computer Science -- Theory and Applications: First ...
Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees
, Martin Fürer1,⋆, and Alexander Zelikovsky2,⋆⋆ 1 Department ...
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on ...
* Abstract In this paper we consider the f0110wing problem. Given a (d + l)-claw free graph G = (V, E,w) where w : V —) R+, maximize w(A) where A ...
Approximating Minimum Unsatisfiability of Linear Equations -
Approximating Minimum Unsatisfiability of Linear Equations. Front Cover.
, Marek Karpiński. Inst. für Informatik, 2001 - 14 pages.
On Some Tighter Inapproximability Results: Further Improvements -...
On Some Tighter Inapproximability Results: Further Improvements. Front Cover.
, Marek Karpiński. Inst. für Informatik, 1998 - 16 pages.
The Expressive Power of Deterministic Context-free ...
... Expressive Power of Deterministic Context-free Dynamic Logic. Front Cover.
. Massachusetts Institute of Technology, Department of Mathematics, ...
Approximation Algorithms for Combinatorial Optimization: Third...
Variable Length Sequencing with Two Lengths
⋆ and Junichiro Fukuyama The Pennsylvania State University Department of Computer Science ...
Automata, Languages and Programming: 29th International Colloquium,...
Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION
⋆ and Marek Karpinski⋆⋆ Dept. of Computer Science, University of ...
Approximation Hardness and Satisfiability of Bounded Occurence...
, Marek Karpinski, Alex D. Scott: Approximation Hardness and Satisfiability of Bounded Occurrence Instances of SAT.
Report Piotr Berman missing
Find missing people
Related search requests for
Person "Berman" (3)
Forename "Piotr" (9979)
Name "Berman" (1971)
sorted by relevance /
People by keywords:
© 2016 yasni
e.g. phone no., hobby, attribute...
Find matching people
Background check on name