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.
People Piotr Berman
Person Piotr Berman
Person Piotr Berman
Books & Literature
(1 - 26 from 30
Download/Read "Approximating Transitivity in Directed Networks" by...
and Chris Coulston. Speed is More Powerful than Clairvoyance. Nordic Journal of Computing, 6(2):181-193, Summer 1999. Abstract, References ...
Asymptotically Optimal Distributed Consensus -
, Juan A....
ASYMPTOTICALLY OPTIMAL DISTRIBUTED CONSENSUS.
† ...... [BG1] P.
and ja Garay, "Asymptotically Optimal Distributed Consensus," ...
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.
Marek Karpinski: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]. Publications of Author.
Marek Karpinski ...
Dumitru Brinza PhD
Webapges of Zelikovsky’s Frequent Co-authors .
. Gruia Calinescu. Marek Karpinski. Andrew Kahng. Gabriel Robins. Ion Mandoiu
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...
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 ...
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 ...
of Parallel Computing: Models, Algorithms and Applications -...
The ability of parallel computing to process large data sets and handle time-consuming operations has resulted in unprecedented advances in biological and...
Distributed Algorithms - Page 833 - Google Books Result
Claude Berge. Graphs and Hypergraph. North-Holland, Amsterdam, 1973.
and Anupam A. Bharali. Distributed consensus in semi— synchronous ...
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...
Distributed Computing and Internet Technology
and Anupam A. Bharali, “Distributed consensus in semi-synchronous systems”, In Proceedings of the Sixth International Parallel Processing ...
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 ...
Proceedings of the Twelfth Annual ACM-SIAM Symposium on ...
... be 427 Improved Approximation Algorithms for Rectangle Tiling and Packing
, Bhaskar DasGupta, S Muthukrishnan, and Suneeta Ramaswami.
An Approximation Algorithm for the Steiner Tree Problem -
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 Complexity of Regular Languages in Terms of Finite Automata -...
On Complexity of Regular Languages in Terms of Finite Automata. Front Cover.
, Andrzej Lingas. Institute of Computer Science, Polish Academy of ...
Improved Protocols for Distributed Consensus - Google Books
Improved Protocols for Distributed Consensus. Front Cover.
, Juan A. Garay. Pennsylvania State University, Department of Computer Science, 1990 ...
On the Complexity Approximating the Independent Set Problem -
On Some Tighter Inapproximability Results - Google Books
On Some Tighter Inapproximability Results: Further Improvements. Front Cover.
, Marek Karpiński. Inst. für Informatik, 1998 - 16 pages.
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.
All web results to the name "Piotr Berman"
Report Piotr Berman missing
Find missing people
Related search requests for
Person "Berman" (3)
Forename "Piotr" (8607)
Name "Berman" (1896)
sorted by relevance /
/ People searches:
© 2015 yasni GmbH
e.g. phone no., hobby, attribute...
Find matching people
Background check on name