Yossi Gil
List of publications from the DBLP Bibliography Server - FAQ| 2012 | ||
|---|---|---|
| j26 | Joseph Gil, Keren Lenz: Keyword- and Default- Parameters in JAVA. Journal of Object Technology 11(1): 1-17 (2012) | |
| c62 | ||
| c61 | Joseph Gil, Maayan Goldstein, Dany Moshkovich: An empirical investigation of changes in some software properties over time. MSR 2012: 227-236 | |
| i1 | Joseph Gil, Maayan Goldstein, Dany Moshkovich: Empirical Confirmation (and Refutation) of Presumptions on Software. CoRR abs/1201.3078 (2012) | |
| 2011 | ||
| c60 | Yossi Gil, Maayan Goldstein, Dany Moshkovich: How much information do software metrics contain? PLATEAU 2011: 57-64 | |
| c59 | ||
| c58 | Joseph Gil, Keren Lenz, Yuval Shimron: A microbenchmark case study and lessons learned. SPLASH Workshops 2011: 297-308 | |
| 2010 | ||
| j25 | Joseph Gil, Keren Lenz: Simple and safe SQL queries with C++ templates. Sci. Comput. Program. 75(7): 573-595 (2010) | |
| c57 | ||
| c56 | Joseph Gil: Reflections on Spartan Programming and the No-Debugger Principle. Haifa Verification Conference 2010: 5-8 | |
| c55 | Yossi Gil, Shiri Kremer-Davidson, Itay Maman: Sans Constraints? Feature Diagrams vs. Feature Models. SPLC 2010: 271-285 | |
| 2009 | ||
| c54 | ||
| c53 | ||
| 2008 | ||
| j24 | Joseph Gil, William Pugh, Grant E. Weddell, Yoav Zibin: Two-dimensional bidirectional object layout. ACM Trans. Program. Lang. Syst. 30(5) (2008) | |
| c52 | ||
| c51 | Tal Cohen, Joseph Gil, Itay Maman: Guarded Program Transformations Using JTL. TOOLS (46) 2008: 100-120 | |
| 2007 | ||
| j23 | Tal Cohen, Joseph Gil: Better Construction with Factories. Journal of Object Technology 6(6): 103-123 (2007) | |
| j22 | Joseph Gil, Yoav Zibin: Randomised algorithms for isomorphisms of simple types. Mathematical Structures in Computer Science 17(3): 565-584 (2007) | |
| j21 | Joseph Gil, Yoav Zibin: Efficient dynamic dispatching with type slicing. ACM Trans. Program. Lang. Syst. 30(1) (2007) | |
| c50 | Sara Cohen, Joseph Gil, Evelina Zarivach: Datalog Programs over Infinite Databases, Revisited. DBPL 2007: 32-47 | |
| c49 | ||
| c48 | ||
| 2006 | ||
| j20 | ||
| c47 | ||
| c46 | ||
| 2005 | ||
| j19 | Joseph Gil, Yoav Zibin: Efficient algorithms for isomorphisms of simple types. Mathematical Structures in Computer Science 15(5): 917-957 (2005) | |
| j18 | Joseph Gil, Yoav Zibin: Efficient subtyping tests with PQ-encoding. ACM Trans. Program. Lang. Syst. 27(5): 819-856 (2005) | |
| c45 | ||
| 2004 | ||
| c44 | ||
| c43 | ||
| 2003 | ||
| c42 | ||
| c41 | Uri Dekel, Joseph Gil: Visualizing class interfaces with formal concept analysis. OOPSLA Companion 2003: 288-289 | |
| c40 | Yoav Zibin, Joseph Gil: Incremental algorithms for dispatching in dynamically typed languages. POPL 2003: 126-138 | |
| c39 | Yoav Zibin, Joseph Gil, Jeffrey Considine: Efficient algorithms for isomorphisms of simple types. POPL 2003: 160-171 | |
| c38 | ||
| 2002 | ||
| j17 | Joseph Gil, Ron Kimmel: Efficient Dilation, Erosion, Opening, and Closing Algorithms. IEEE Trans. Pattern Anal. Mach. Intell. 24(12): 1606-1617 (2002) | |
| j16 | Joseph Gil, John Howse, Elena Tulchinsky: Positive Semantics of Projections in Venn-Euler Diagrams. J. Vis. Lang. Comput. 13(2): 197-227 (2002) | |
| c37 | ||
| c36 | Yoav Zibin, Joseph Gil: Fast algorithm for creating space efficient dispatching tables with application to multi-dispatching. OOPSLA 2002: 142-160 | |
| 2001 | ||
| j15 | John Howse, Fernando Molina, John Taylor, Stuart Kent, Joseph Gil: Spider Diagrams: A Diagrammatic Reasoning System. J. Vis. Lang. Comput. 12(3): 299-324 (2001) | |
| c35 | Marina Biberstein, Joseph Gil, Sara Porat: Sealing, Encapsulation, and Mutability. ECOOP 2001: 28-52 | |
| c34 | ||
| c33 | ||
| c32 | ||
| 2000 | ||
| c31 | Joseph Gil, John Howse, Elena Tulchinsky: Positive Semantics of Projections in Venn-Euler Diagrams. Diagrams 2000: 7-25 | |
| c30 | Natalie Eckel, Joseph Gil: Empirical Study of Object-Layout Strategies and Optimization Techniques. ECOOP 2000: 394-421 | |
| c29 | Joseph Gil, John Howse, Stuart Kent: Advanced visual modeling (tutorial session): beyond UML. ICSE 2000: 833 | |
| c28 | ||
| c27 | ||
| c26 | Joseph Gil, John Howse, Stuart Kent, John Taylor: Projections in Venn-Euler Diagrams. VL 2000: 119-126 | |
| 1999 | ||
| j14 | ||
| j13 | Joseph Gil, Alan S. Wagner: An Alternative Mapping of 3-D Space onto Processor Arrays. J. Parallel Distrib. Comput. 59(3): 360-380 (1999) | |
| c25 | ||
| c24 | Peter F. Sweeney, Joseph Gil: Space and Time-Efficient Memory Layout for Multiple Inheritance. OOPSLA 1999: 256-275 | |
| c23 | Joseph Gil, John Howse, Stuart Kent: Constraint Diagrams: A Step Beyond UML. TOOLS (30) 1999: 453-463 | |
| c22 | ||
| 1998 | ||
| j12 | Joseph Gil, David H. Lorenz: Design Patterns and Language Design. IEEE Computer 31(3): 118-120 (1998) | |
| j11 | Stuart Kent, Joseph Gil: Visualising action contracts in object-oriented modelling. IEE Proceedings - Software 145(2-3): 70-78 (1998) | |
| j10 | Joseph Gil, Yossi Matias: Simple Fast Parallel Hashing by Oblivious Execution. SIAM J. Comput. 27(5): 1348-1375 (1998) | |
| c21 | ||
| c20 | Joseph Gil, Alon Itai: The Complexity of Type Analysis of Object Oriented Programs. ECOOP 1998: 601-634 | |
| c19 | ||
| c18 | ||
| 1997 | ||
| j9 | Amnon H. Eden, Joseph Gil, Amiram Yehudai: Automating the Application of Design Patterns. JOOP 10(2): 44-46 (1997) | |
| c17 | ||
| c16 | Amnon H. Eden, Amiram Yehudai, Joseph Gil: Precise Specification and Automatic Application of Design Patterns. ASE 1997: 143-152 | |
| c15 | ||
| c14 | Joseph Gil, Beery Holstein: T++: A Test Case Generator Using a Debugging Information Based Technique for Source Code Manipulation. TOOLS (23) 1997: 272-281 | |
| c13 | ||
| 1996 | ||
| j8 | Joseph Gil, Yossi Matias: An Effective Load Balancing Policy for Geometric-Decaying Algorithms. J. Parallel Distrib. Comput. 36(2): 185-188 (1996) | |
| j7 | Joseph Gil, Friedhelm Meyer auf der Heide, Avi Wigderson: The Tree Model for Hashing: Lower and Upper Bounds. SIAM J. Comput. 25(5): 936-955 (1996) | |
| c12 | Joseph Gil, Alan S. Wagner: A New Technique for 3-D Domain Decomposition on Multicomputers which Reduces Message-Passing. IPPS 1996: 831-835 | |
| c11 | Joseph Gil, David H. Lorenz: Environmental Acquisition - A New Inheritance-Like Abstraction Mechanism. OOPSLA 1996: 214-231 | |
| 1995 | ||
| j6 | Heinz Breu, Joseph Gil, David G. Kirkpatrick, Michael Werman: Linear Time Euclidean Distance Algorithms. IEEE Trans. Pattern Anal. Mach. Intell. 17(5): 529-533 (1995) | |
| c10 | ||
| 1994 | ||
| j5 | Joseph Gil, Yossi Matias: Designing Algorithms by Expectations. Inf. Process. Lett. 51(1): 31-34 (1994) | |
| j4 | Joseph Gil, Yossi Matias: Fast and Efficient Simulations among CRCW PRAMs. J. Parallel Distrib. Comput. 23(2): 135-148 (1994) | |
| j3 | Joseph Gil: Renaming and dispersing: Techniques for Fast Load Balancing. J. Parallel Distrib. Comput. 23(2): 149-157 (1994) | |
| c9 | ||
| 1993 | ||
| j2 | Joseph Gil, Michael Werman: Computing 2-D Min, Median, and Max Filters. IEEE Trans. Pattern Anal. Mach. Intell. 15(5): 504-507 (1993) | |
| 1992 | ||
| j1 | Joseph Gil, William L. Steiger, Avi Wigderson: Geometric medians. Discrete Mathematics 108(1-3): 37-51 (1992) | |
| c8 | Martin Dietzfelbinger, Joseph Gil, Yossi Matias, Nicholas Pippenger: Polynomial Hash Functions Are Reliable (Extended Abstract). ICALP 1992: 235-246 | |
| c7 | Joseph Gil, Yossi Matias: Leaders Election Without Conflict Resolution Rule - Fast and Efficient Randomized Simulations among CRCW PRAMs. LATIN 1992: 204-218 | |
| 1991 | ||
| c6 | Joseph Gil, Yossi Matias, Uzi Vishkin: Towards a Theory of Nearly Constant Time Parallel Algorithms. FOCS 1991: 698-710 | |
| c5 | ||
| c4 | ||
| 1990 | ||
| c3 | Joseph Gil, Friedhelm Meyer auf der Heide, Avi Wigderson: Not All Keys Can Be Hashed in Constant Time (Preliminary Version). STOC 1990: 244-253 | |
| 1986 | ||
| c2 | ||
| 1984 | ||
| c1 | ||
Colors in the list of coauthors
Last update Mon May 20 09:15:40 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page