Skip to main content

Players for Logic Annual Championship for 2016

The following players will be invited to participate in the Logic Annual Championship for 2016, currently scheduled to take place on 4 April.

The number in parentheses after their names are the number of championships in which they have already participated.

Congratulations to all listed below on their accomplishment and best of luck in the upcoming competition!

Name Rank Qualification Country
Pavel Zeman (2) 1 Top 50 Czech Republic
SteliosVlasopoulos (3) 2 Top 50 Belgium
Marek Sobierajski (1) 3 Top 50 Poland
mentzel.iudith (3) 4 Top 50 Israel
Vyacheslav Stepanov (3) 5 Top 50 No Country Set
James Su (3) 6 Top 50 Canada
Rytis Budreika (3) 7 Top 50 Lithuania
JasonC (3) 8 Top 50 United Kingdom
Cor (2) 9 Top 50 Netherlands
Köteles Zsolt (2) 10 Top 50 Hungary
Kuvardin Evgeniy (2) 11 Top 50 Russia
NickL (2) 12 Top 50 United Kingdom
Chad Lee (3) 13 Top 50 United States
NeilC (0) 14 Top 50 United Kingdom
TZ (1) 15 Top 50 Lithuania
D. Kiser (2) 16 Top 50 United States
ted (3) 17 Top 50 United Kingdom
MarkM. (3) 18 Top 50 Germany
Elic (3) 19 Top 50 Belarus
mcelaya (1) 20 Top 50 Spain
Sandra99 (3) 21 Top 50 Italy
tonyC (2) 22 Top 50 United Kingdom
seanm95 (3) 23 Top 50 United States
Talebian (2) 24 Top 50 Netherlands
richdellheim (3) 25 Top 50 United States
Arūnas Antanaitis (1) 26 Top 50 Lithuania
ratte2k4 (1) 27 Top 50 Germany
umir (3) 28 Top 50 Italy
Kanellos (2) 29 Top 50 Greece
NielsHecker (3) 30 Top 50 Germany
Andrii Dorofeiev (2) 31 Top 50 Ukraine
Mehrab (3) 32 Top 50 United Kingdom
JustinCave (3) 33 Top 50 United States
krzysioh (2) 34 Top 50 Poland
Stanislovas (0) 35 Top 50 Lithuania
Vladimir13 (1) 36 Top 50 Russia
danad (3) 37 Top 50 Czech Republic
RalfK (2) 38 Top 50 Germany
YuanT (3) 39 Top 50 United States
Mike Tessier (1) 40 Top 50 Canada
Vijay Mahawar (3) 41 Top 50 No Country Set
Eric Levin (2) 42 Top 50 United States
whab@tele2.at (1) 43 Top 50 Austria
puzzle1fun (0) 44 Top 50 No Country Set
Sartograph (1) 45 Top 50 Germany
tonywinn (1) 46 Top 50 Australia
dovile (0) 47 Top 50 Lithuania
Jeff Stephenson (0) 48 Top 50 No Country Set
craig.mcfarlane (2) 49 Top 50 Norway
Paresh Patel (0) 50 Top 50 No Country Set

Comments

Post a Comment

Popular posts from this blog

Quick Guide to User-Defined Types in Oracle PL/SQL

A Twitter follower recently asked for more information on user-defined types in the PL/SQL language, and I figured the best way to answer is to offer up this blog post. PL/SQL is a strongly-typed language . Before you can work with a variable or constant, it must be declared with a type (yes, PL/SQL also supports lots of implicit conversions from one type to another, but still, everything must be declared with a type). PL/SQL offers a wide array of pre-defined data types , both in the language natively (such as VARCHAR2, PLS_INTEGER, BOOLEAN, etc.) and in a variety of supplied packages (e.g., the NUMBER_TABLE collection type in the DBMS_SQL package). Data types in PL/SQL can be scalars, such as strings and numbers, or composite (consisting of one or more scalars), such as record types, collection types and object types. You can't really declare your own "user-defined" scalars, though you can define subtypes  from those scalars, which can be very helpful from the p
24 comments
Read more

The differences between deterministic and result cache features

 EVERY once in a while, a developer gets in touch with a question like this: I am confused about the exact difference between deterministic and result_cache. Do they have different application use cases? I have used deterministic feature in many functions which retrieve data from some lookup tables. Is it essential to replace these 'deterministic' key words with 'result_cache'?  So I thought I'd write a post about the differences between these two features. But first, let's make sure we all understand what it means for a function to be  deterministic. From Wikipedia : In computer science, a deterministic algorithm is an algorithm which, given a particular input, will always produce the same output, with the underlying machine always passing through the same sequence of states.  Another way of putting this is that a deterministic subprogram (procedure or function) has no side-effects. If you pass a certain set of arguments for the parameters, you will always get
14 comments
Read more

How to Pick the Limit for BULK COLLECT

This question rolled into my In Box today: In the case of using the LIMIT clause of BULK COLLECT, how do we decide what value to use for the limit? First I give the quick answer, then I provide support for that answer Quick Answer Start with 100. That's the default (and only) setting for cursor FOR loop optimizations. It offers a sweet spot of improved performance over row-by-row and not-too-much PGA memory consumption. Test to see if that's fast enough (likely will be for many cases). If not, try higher values until you reach the performance level you need - and you are not consuming too much PGA memory.  Don't hard-code the limit value: make it a parameter to your subprogram or a constant in a package specification. Don't put anything in the collection you don't need. [from Giulio Dottorini] Remember: each session that runs this code will use that amount of memory. Background When you use BULK COLLECT, you retrieve more than row with each fetch,
4 comments
Read more