default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShlomit S. Pinter
Person information
- affiliation: University of Haifa, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2008
[j22]Shlomit S. Pinter, Yariv Aridor, Steven S. Shultz, Sergey Guenender:
Improving machine virtualisation with 'hotplug memory'. Int. J. High Perform. Comput. Netw. 5(4): 241-250 (2008)- 2007
- [j21]Shlomit S. Pinter, Israel Waldman:
Selective Code Compression Scheme for Embedded Systems. Trans. High Perform. Embed. Archit. Compil. 1: 298-316 (2007) - 2006
- [j20]Bilha Mendelson, Shlomit S. Pinter, Ayal Zaks:
Introduction. Int. J. Parallel Program. 34(2): 111-112 (2006) - 2004
- [j19]Shlomit S. Pinter, Mati Golani:
Discovering workflow models from activities' lifespans. Comput. Ind. 53(3): 283-296 (2004) - [j18]Shlomit S. Pinter, Mati Golani:
Erratum to "Discovering workflow models from activities' lifespans": [Comput. Ind. 53(2004) 283-296]. Comput. Ind. 54(3): 325 (2004) - 2002
- [j17]Eitan Farchi, Alan Hartman
, Shlomit S. Pinter:
Using a model-based test generator to test for standard conformance. IBM Syst. J. 41(1): 89-110 (2002) - 1999
- [j16]Shlomit S. Pinter:
Introduction. Int. J. Parallel Program. 27(4): 227-228 (1999) - 1996
- [j15]Shlomit S. Pinter:
Register allocation with instruction scheduling: a new approach. J. Program. Lang. 4(1): 21-38 (1996) - [j14]Roni Khardon, Shlomit S. Pinter:
Partitioning and Scheduling to Counteract Overhead. Parallel Comput. 22(4): 555-593 (1996) - 1995
- [j13]Arkady Zamsky, Amos Israeli, Shlomit S. Pinter:
Optimal Time Byzantine Agreement for t<n/8 With Linear-Messages. Distributed Comput. 9(2): 95-108 (1995) - [j12]Shlomit S. Pinter:
Introduction. Int. J. Parallel Program. 23(1): 3-4 (1995) - [j11]Eli Glikman, Ludmila Ioffe, Itzhak Kelson, Shlomit S. Pinter:
Parallel Algorithms for Molecular Dynamics Simulation of Irradiation Effects in Crystals. Sci. Program. 4(3): 185-192 (1995) - 1994
- [j10]Abraham Mendlson, Shlomit S. Pinter, Ruth Shtokhamer:
Compile time instruction cache optimizations. SIGARCH Comput. Archit. News 22(1): 44-51 (1994) - [j9]Shlomit S. Pinter, Ron Y. Pinter:
Program Optimization and Parallelization Using Idioms. ACM Trans. Program. Lang. Syst. 16(3): 305-327 (1994) - 1992
- [j8]Michael Kaminski, Shlomit S. Pinter:
Finite Automata on Directed Graphs. J. Comput. Syst. Sci. 44(3): 425-446 (1992) - [j7]Jacob Katzenelson, Shlomit S. Pinter, Eugen Schenfeld:
Type Matching, Type-Graphs, and the Schanuel Conjecture. ACM Trans. Program. Lang. Syst. 14(4): 574-588 (1992) - 1991
- [j6]Luis F. Ortiz, Ron Y. Pinter, Shlomit S. Pinter:
An array language for data parallelism: Definition, compilation, and applications. J. Supercomput. 5(1): 7-29 (1991) - 1987
- [j5]Shlomit S. Pinter, Yaron Wolfstahl:
On mapping processes to processors in distributed systems. Int. J. Parallel Program. 16(1): 1-15 (1987) - [j4]Shlomit S. Pinter, Yaron Wolfstahl:
Embedding Ternary Trees in VLSI Arrays. Inf. Process. Lett. 26(4): 187-191 (1987) - [j3]Imrich Chlamtac, Shlomit S. Pinter:
Distributed Nodes Organization Algorithm for Channel Access in a Multihop Dynamic Radio Network. IEEE Trans. Computers 36(6): 728-737 (1987) - [j2]Amir Herzberg, Shlomit S. Pinter:
Public Protection of Software. ACM Trans. Comput. Syst. 5(4): 371-393 (1987) - 1986
- [j1]Danny Dolev, Nancy A. Lynch, Shlomit S. Pinter, Eugene W. Stark, William E. Weihl:
Reaching approximate agreement in the presence of faults. J. ACM 33(3): 499-516 (1986)
Conference and Workshop Papers
- 2007
- [c19]Eric Frizziero, Z. Har'El, Francesco Lelli, B. Mandler, Gaetano Maron, P. Molini, Shlomit S. Pinter:
Fast Information Transport for an Instrument Enabled Grid. eScience 2007: 253-260 - 2006
- [c18]Israel Waldman, Shlomit S. Pinter:
Profile-driven compression scheme for embedded systems. Conf. Computing Frontiers 2006: 95-104 - [c17]Shlomit S. Pinter, Marcel Zalmanovici:
Data Sharing Conscious Scheduling for Multi-threaded Applications on SMP Machines. Euro-Par 2006: 265-275 - 2005
- [c16]Oren Ben-Zwi, Shlomit S. Pinter:
Handling Sensed Data in Hostile Environments. MSN 2005: 433-442 - [c15]Shlomit S. Pinter, Steven S. Shultz, Yariv Aridor, Sergey Guenender:
Improving Machine Virtualization with 'Hotplug Memory'. SBAC-PAD 2005: 168-175 - 2003
- [c14]Mati Golani, Shlomit S. Pinter:
Generating a Process Model from a Process Audit Log. Business Process Management 2003: 136-151 - 2001
- [c13]Katherine Barabash, Niv Buchbinder, Tamar Domani, Elliot K. Kolodner, Yoav Ossia, Shlomit S. Pinter, Janice C. Shepherd, Ron Sivan, Victor Umansky:
Mostly Accurate Stack Scanning. Java Virtual Machine Research and Technology Symposium 2001 - 1996
- [c12]Shlomit S. Pinter, Adi Yoaz:
Tango: A Hardware-Based Data Prefetching Technique for Superscalar Processors. MICRO 1996: 214-225 - 1994
- [c11]Abraham Mendlson, Shlomit S. Pinter, Ruth Shtokhamer:
Compile Time Instruction Cache Optimizations. CC 1994: 404-418 - 1993
- [c10]Shlomit S. Pinter:
Register Allocation with Instruction Scheduling: A New Approach. PLDI 1993: 248-257 - 1992
- [c9]Oded Lempel, Shlomit S. Pinter, Eli Turiel:
Parallelizing a C Dialect for Distributed Memory MIMD Machines. LCPC 1992: 369-390 - [c8]Arkady Zamsky, Amos Israeli, Shlomit S. Pinter:
Optimal Time Byzantine Agreement for t<n/8 With Linear Messages. WDAG 1992: 136-152 - 1991
- [c7]Roni Hardon, Shlomit S. Pinter:
Choosing the Right Grains for Data Flow Machines. ICPP (1) 1991: 672-673 - [c6]Roni Hardon, Shlomit S. Pinter:
Optimal Partitioning of Programs for Data Flow Machines. LCPC 1991: 374-388 - [c5]Shlomit S. Pinter, Ron Y. Pinter:
Program Optimization and Parallelization Using Idioms. POPL 1991: 79-92 - 1989
- [c4]Robert P. Kurshan, Shlomit S. Pinter, Baruch Solomon:
Extensions of Temporal Logic for Counting with Applications to Model Verification. PSTV 1989: 373-386 - 1985
- [c3]Amir Herzberg, Shlomit S. Pinter:
Public Protection of Software. CRYPTO 1985: 158-179 - 1984
- [c2]Shlomit S. Pinter, Pierre Wolper:
A Temporal Logic for Reasoning about Partially Ordered Computations (Extended Abstract). PODC 1984: 28-37 - 1983
- [c1]Danny Dolev, Nancy A. Lynch, Shlomit S. Pinter, Eugene W. Stark, William E. Weihl:
Reaching Approximate Agreement in the Presence of Faults. Symposium on Reliability in Distributed Software and Database Systems 1983: 145-154
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
